Petr Jancar

According to our database, Petr Jancar authored at least 92 papers between 1989 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

A concise proof of Commoner's theorem.

Petr Jancar

CoRR, 2024

On the Home-Space Problem for Petri Nets.

Petr Jancar, Jérôme Leroux

Proceedings of the Taming the Infinities of Concurrency, 2024

2023

Countdown games, and simulation on (succinct) one-counter nets.

Petr Jancar, Petr Osicka, Zdenek Sawa

Log. Methods Comput. Sci., 2023

The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets.

Petr Jancar, Jérôme Leroux

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Bisimilarity on Basic Parallel Processes.

Petr Jancar

Theor. Comput. Sci., 2022

Resource Bisimilarity in Petri Nets is Decidable.

Irina A. Lomazova, Vladimir A. Bashkin, Petr Jancar

Fundam. Informaticae, 2022

Structural Liveness of Immediate Observation Petri Nets.

Petr Jancar, Jiri Valusek

Fundam. Informaticae, 2022

Semilinear Home-space is Decidable for Petri Nets.

Petr Jancar, Jérôme Leroux

CoRR, 2022

2021

Equivalence of pushdown automata via first-order grammars.

Petr Jancar

J. Comput. Syst. Sci., 2021

The Simplest Non-Regular Deterministic Context-Free Language.

Petr Jancar, Jirí Síma

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence.

Petr Jancar

J. Comput. Syst. Sci., 2020

2019

Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States.

Petr Jancar, Jérôme Leroux, Grégoire Sutre

Fundam. Informaticae, 2019

Structural liveness of Petri nets is ExpSpace-hard and decidable.

Petr Jancar, David Purser

Acta Informatica, 2019

Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete.

Petr Jancar, Sylvain Schmitz

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata.

Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell

Log. Methods Comput. Sci., 2018

EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets.

Petr Jancar, Petr Osicka, Zdenek Sawa

CoRR, 2018

EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets.

Petr Jancar, Petr Osicka, Zdenek Sawa

Proceedings of the Reachability Problems - 12th International Conference, 2018

2017

Branching Bisimilarity of Normed BPA Processes as a Rational Monoid.

Petr Jancar

Log. Methods Comput. Sci., 2017

Deciding Structural Liveness of Petri Nets.

Petr Jancar

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016

State-Space Reduction of Non-deterministically Synchronizing Systems Applicable to Deadlock Detection in MPI.

Stanislav Böhm, Ondrej Meca, Petr Jancar

Proceedings of the FM 2016: Formal Methods, 2016

An Approach to Verification of MPI Applications Defined in a High-Level Model.

Ondrej Meca, Stanislav Böhm, Marek Behalek, Petr Jancar

Proceedings of the 16th International Conference on Application of Concurrency to System Design, 2016

2015

On Reachability for Unidirectional Channel Systems Extended with Regular Tests.

Petr Jancar, Prateek Karandikar, Philippe Schnoebelen

Log. Methods Comput. Sci., 2015

On Reachability-Related Games on Vector Addition Systems with States.

Petr Jancar

Proceedings of the Reachability Problems - 9th International Workshop, 2015

Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME.

Wojciech Czerwinski, Petr Jancar

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Bisimulation equivalence and regularity for real-time one-counter automata.

Stanislav Böhm, Stefan Göller, Petr Jancar

J. Comput. Syst. Sci., 2014

Language equivalence of probabilistic pushdown automata.

Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell

Inf. Comput., 2014

Bisimulation Equivalence of First-Order Grammars.

Petr Jancar

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Equivalences of Pushdown Systems Are Hard.

Petr Jancar

Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013

Finiteness up to bisimilarity is decidable for pushdown processes

Petr Jancar

CoRR, 2013

Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes

Petr Jancar, Jirí Srba

CoRR, 2013

Bisimulation equivalence of first-order grammars is Ackermann-hard.

Petr Jancar

CoRR, 2013

Equivalence of deterministic one-counter automata is NL-complete.

Stanislav Böhm, Stefan Göller, Petr Jancar

Proceedings of the Symposium on Theory of Computing Conference, 2013

Complexity of Checking Bisimilarity between Sequential and Parallel Processes.

Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)

Petr Jancar

Log. Methods Comput. Sci., 2012

Decidability of DPDA Language Equivalence via First-Order Grammars.

Petr Jancar

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Unidirectional Channel Systems Can Be Tested.

Petr Jancar, Prateek Karandikar, Philippe Schnoebelen

Proceedings of the Theoretical Computer Science, 2012

Bisimilarity of Probabilistic Pushdown Automata.

Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2010

Complexity of deciding bisimilarity between normed BPA and normed BPP.

Petr Jancar, Martin Kot, Zdenek Sawa

Inf. Comput., 2010

Non-interleaving bisimulation equivalences on Basic Parallel Processes.

Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa

Inf. Comput., 2010

Short Decidability Proof for DPDA Language Equivalence via 1st Order Grammar Bisimilarity

Petr Jancar

CoRR, 2010

Reachability Games on Extended Vector Addition Systems with States.

Tomás Brázdil, Petr Jancar, Antonín Kucera

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Bisimilarity of One-Counter Processes Is PSPACE-Complete.

Stanislav Böhm, Stefan Göller, Petr Jancar

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

Hardness of equivalence checking for composed finite-state systems.

Zdenek Sawa, Petr Jancar

Acta Informatica, 2009

2008

Undecidability of bisimilarity by defender's forcing.

Petr Jancar, Jirí Srba

J. ACM, 2008

Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm.

Petr Jancar

Inf. Comput., 2008

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs.

Javier Esparza, Petr Jancar, Alexander Miller

Fundam. Informaticae, 2008

Selected Ideas Used for Decidability and Undecidability of Bisimilarity.

Petr Jancar

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Normed BPA vs. Normed BPP Revisited.

Petr Jancar, Martin Kot, Zdenek Sawa

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007

Monotonicity of Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

J. Autom. Lang. Comb., 2007

A note on emptiness for alternating finite automata with a one-letter alphabet.

Petr Jancar, Zdenek Sawa

Inf. Process. Lett., 2007

2006

Equivalence-checking on infinite-state systems: Techniques and results.

Antonín Kucera, Petr Jancar

Theory Pract. Log. Program., 2006

Undecidability Results for Bisimilarity on Prefix Rewrite Systems.

Petr Jancar, Jirí Srba

Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005

Behavioural Equivalences on Finite-State Systems are PTIME-hard.

Zdenek Sawa, Petr Jancar

Comput. Artif. Intell., 2005

Determinate STG Decomposition of Marked Graphs.

Mark Schäfer, Walter Vogler, Petr Jancar

Proceedings of the Applications and Theory of Petri Nets 2005, 2005

2004

DP lower bounds for equivalence-checking and model-checking of one-counter automata.

Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa

Inf. Comput., 2004

Highly Undecidable Questions for Process Algebras.

Petr Jancar, Jirí Srba

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete.

Petr Jancar

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Deciding Bisimilarity between BPA and BPP Processes.

Petr Jancar, Antonín Kucera, Faron Moller

Proceedings of the CONCUR 2003, 2003

2002

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.

Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

Deciding bisimulation-like equivalences with finite-state processes.

Petr Jancar, Antonín Kucera, Richard Mayr

Theor. Comput. Sci., 2001

Nonprimitive recursive complexity and undecidability for Petri net equivalences.

Petr Jancar

Theor. Comput. Sci., 2001

P-Hardness of Equivalence Testing on Finite-State Processes.

Zdenek Sawa, Petr Jancar

Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

2000

Decidability of Bisimilarity for One-Counter Processes.

Petr Jancar

Inf. Comput., 2000

Simulation and Bisimulation over One-Counter Processes.

Petr Jancar, Antonín Kucera, Faron Moller

Proceedings of the STACS 2000, 2000

1999

Petri Nets and Regular Processes.

Petr Jancar, Javier Esparza, Faron Moller

J. Comput. Syst. Sci., 1999

On Monotonic Automata with a Restart Operation.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

J. Autom. Lang. Comb., 1999

A Note on Well Quasi-Orderings for Powersets.

Petr Jancar

Inf. Process. Lett., 1999

Simulation Problems for One-Counter Machines.

Petr Jancar, Faron Moller, Zdenek Sawa

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Boundedness of Reset P/T Nets.

Catherine Dufourd, Petr Jancar, Philippe Schnoebelen

Proceedings of the Automata, 1999

Techniques for Decidability and Undecidability of Bisimilarity.

Petr Jancar, Faron Moller

Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998

Preface.

Petr Jancar, Mojmír Kretínský

Proceedings of the MFCS '98 Workshop on Concurrency, 1998

Different Types of Monotonicity for Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

Bisimilarity of processes with finite-state systems.

Petr Jancar, Antonín Kucera

Proceedings of the Second International Workshop on Verification of Infinite State Systems, 1997

Monotonic Rewriting Automata with a Restart Operation.

Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Bisimulation Equivalence is Decidable for One-Counter Processes.

Petr Jancar

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Deleting Automata with a Restart Operation.

Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On Restarting Automata with Rewriting.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the New Trends in Formal Languages, 1997

1996

Forgetting Automata and Context-Free Languages.

Petr Jancar, Frantisek Mráz, Martin Plátek

Acta Informatica, 1996

Deciding Finiteness of Petri Nets Up To Bisimulation.

Petr Jancar, Javier Esparza

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

Undecidability of Bisimilarity for Petri Nets and Some Related Problems.

Petr Jancar

Theor. Comput. Sci., 1995

All action-based behavioural equivalences are undecidable for labelled Petri nets.

Petr Jancar

Bull. EATCS, 1995

High Undecidability of Weak Bisimilarity for Petri Nets.

Petr Jancar

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Restarting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Restarting Automata, Marcus Grammars and Context-Free Languages.

Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel

Proceedings of the Developments in Language Theory II, 1995

Checking Regular Properties of Petri Nets.

Petr Jancar, Faron Moller

Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994

Decidability Questions for Bismilarity of Petri Nets and Some Related Problems.

Petr Jancar

Proceedings of the STACS 94, 1994

1993

Completeness Results for Single-Path Petri Nets

Rodney R. Howell, Petr Jancar, Louis E. Rosier

Inf. Comput., October, 1993

A Taxonomy of Forgetting Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

Characterization of Context-Free Languages by Erasing Automata.

Petr Jancar, Frantisek Mráz, Martin Plátek

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991

Single-Path Petri Nets.

Rodney R. Howell, Petr Jancar, Louis E. Rosier

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990

Decidability of a Temporal Logic Problem for Petri Nets.

Petr Jancar

Theor. Comput. Sci., 1990

1989

Decidability of Waek Fairness in Petri Nets.

Petr Jancar

Proceedings of the STACS 89, 1989