Decidability of Waek Fairness in Petri Nets. - Petr Jancar (STACS, 1989)

Decidability of a Temporal Logic Problem for Petri Nets. - Petr Jancar (Theor. Comput. Sci., 1990)

Single-Path Petri Nets. - Rodney R. Howell; Petr Jancar; Louis E. Rosier (MFCS, 1991)

Characterization of Context-Free Languages by Erasing Automata. - Petr Jancar; Frantisek Mráz; Martin Plátek (MFCS, 1992)

A Taxonomy of Forgetting Automata. - Petr Jancar; Frantisek Mráz; Martin Plátek (MFCS, 1993)

Completeness Results for Single-Path Petri Nets - Rodney R. Howell; Petr Jancar; Louis E. Rosier (Inf. Comput., 1993)

Decidability Questions for Bismilarity of Petri Nets and Some Related Problems. - Petr Jancar (STACS, 1994)

Checking Regular Properties of Petri Nets. - Petr Jancar; Faron Moller (CONCUR, 1995)

Restarting Automata, Marcus Grammars and Context-Free Languages. - Petr Jancar; Frantisek Mráz; Martin Plátek; Martin Procházka; Jörg Vogel 001 (Developments in Language Theory, 1995)

Restarting Automata. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (FCT, 1995)

High Undecidability of Weak Bisimilarity for Petri Nets. - Petr Jancar (TAPSOFT, 1995)

All action-based behavioural equivalences are undecidable for labelled Petri nets. - Petr Jancar (Bull. EATCS, 1995)

Undecidability of Bisimilarity for Petri Nets and Some Related Problems. - Petr Jancar (Theor. Comput. Sci., 1995)

Deciding Finiteness of Petri Nets Up To Bisimulation. - Petr Jancar; Javier Esparza (ICALP, 1996)

Forgetting Automata and Context-Free Languages. - Petr Jancar; Frantisek Mráz; Martin Plátek (Acta Informatica, 1996)

On Restarting Automata with Rewriting. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (New Trends in Formal Languages, 1997)

Deleting Automata with a Restart Operation. - Petr Jancar; Frantisek Mráz; Martin Plátek; Martin Procházka; Jörg Vogel 001 (Developments in Language Theory, 1997)

Bisimulation Equivalence is Decidable for One-Counter Processes. - Petr Jancar (ICALP, 1997)

Monotonic Rewriting Automata with a Restart Operation. - Frantisek Mráz; Martin Plátek; Petr Jancar; Jörg Vogel 001 (SOFSEM, 1997)

Bisimilarity of processes with finite-state systems. - Petr Jancar; Antonín Kucera 001 (INFINITY, 1997)

Different Types of Monotonicity for Restarting Automata. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (FSTTCS, 1998)

Preface. - Petr Jancar; Mojmír Kretínský (MFCS Workshop on Concurrency, 1998)

Techniques for Decidability and Undecidability of Bisimilarity. - Petr Jancar; Faron Moller (CONCUR, 1999)

Boundedness of Reset P/T Nets. - Catherine Dufourd; Petr Jancar; Philippe Schnoebelen (ICALP, 1999)

Simulation Problems for One-Counter Machines. - Petr Jancar; Faron Moller; Zdenek Sawa (SOFSEM, 1999)

A Note on Well Quasi-Orderings for Powersets. - Petr Jancar (Inf. Process. Lett., 1999)

On Monotonic Automata with a Restart Operation. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (J. Autom. Lang. Comb., 1999)

Petri Nets and Regular Processes. - Petr Jancar; Javier Esparza; Faron Moller (J. Comput. Syst. Sci., 1999)

Simulation and Bisimulation over One-Counter Processes. - Petr Jancar; Antonín Kucera 001; Faron Moller (STACS, 2000)

Decidability of Bisimilarity for One-Counter Processes. - Petr Jancar (Inf. Comput., 2000)

P-Hardness of Equivalence Testing on Finite-State Processes. - Zdenek Sawa; Petr Jancar (SOFSEM, 2001)

Nonprimitive recursive complexity and undecidability for Petri net equivalences. - Petr Jancar (Theor. Comput. Sci., 2001)

Deciding bisimulation-like equivalences with finite-state processes. - Petr Jancar; Antonín Kucera 001; Richard Mayr (Theor. Comput. Sci., 2001)

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. - Petr Jancar; Antonín Kucera 001; Faron Moller; Zdenek Sawa (FoSSaCS, 2002)

Deciding Bisimilarity between BPA and BPP Processes. - Petr Jancar; Antonín Kucera 001; Faron Moller (CONCUR, 2003)

Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. - Petr Jancar (LICS, 2003)

Highly Undecidable Questions for Process Algebras. - Petr Jancar; Jirí Srba (IFIP TCS, 2004)

DP lower bounds for equivalence-checking and model-checking of one-counter automata. - Petr Jancar; Antonín Kucera 001; Faron Moller; Zdenek Sawa (Inf. Comput., 2004)

Determinate STG Decomposition of Marked Graphs. - Mark Schäfer; Walter Vogler; Petr Jancar (ICATPN, 2005)

Behavioural Equivalences on Finite-State Systems are PTIME-hard. - Zdenek Sawa; Petr Jancar (Comput. Artif. Intell., 2005)

Undecidability Results for Bisimilarity on Prefix Rewrite Systems. - Petr Jancar; Jirí Srba (FoSSaCS, 2006)

Equivalence-checking on infinite-state systems: Techniques and results. - Antonín Kucera 001; Petr Jancar (Theory Pract. Log. Program., 2006)

A note on emptiness for alternating finite automata with a one-letter alphabet. - Petr Jancar; Zdenek Sawa (Inf. Process. Lett., 2007)

Monotonicity of Restarting Automata. - Petr Jancar; Frantisek Mráz; Martin Plátek; Jörg Vogel 001 (J. Autom. Lang. Comb., 2007)

Normed BPA vs. Normed BPP Revisited. - Petr Jancar; Martin Kot; Zdenek Sawa (CONCUR, 2008)

Selected Ideas Used for Decidability and Undecidability of Bisimilarity. - Petr Jancar (Developments in Language Theory, 2008)

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. - Javier Esparza; Petr Jancar; Alexander Miller (Fundam. Informaticae, 2008)

Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm. - Petr Jancar (Inf. Comput., 2008)

Undecidability of bisimilarity by defender's forcing. - Petr Jancar; Jirí Srba (J. ACM, 2008)

Hardness of equivalence checking for composed finite-state systems. - Zdenek Sawa; Petr Jancar (Acta Informatica, 2009)

Bisimilarity of One-Counter Processes Is PSPACE-Complete. - Stanislav Böhm; Stefan Göller; Petr Jancar (CONCUR, 2010)

Reachability Games on Extended Vector Addition Systems with States. - Tomás Brázdil; Petr Jancar; Antonín Kucera 001 (ICALP (2), 2010)

Short Decidability Proof for DPDA Language Equivalence via 1st Order Grammar Bisimilarity - Petr Jancar (CoRR, 2010)

Non-interleaving bisimulation equivalences on Basic Parallel Processes. - Sibylle B. Fröschle; Petr Jancar; Slawomir Lasota 001; Zdenek Sawa (Inf. Comput., 2010)

Complexity of deciding bisimilarity between normed BPA and normed BPP. - Petr Jancar; Martin Kot; Zdenek Sawa (Inf. Comput., 2010)

Bisimilarity of Probabilistic Pushdown Automata. - Vojtech Forejt; Petr Jancar; Stefan Kiefer; James Worrell 001 (FSTTCS, 2012)

Unidirectional Channel Systems Can Be Tested. - Petr Jancar; Prateek Karandikar; Philippe Schnoebelen (IFIP TCS, 2012)

Decidability of DPDA Language Equivalence via First-Order Grammars. - Petr Jancar (LICS, 2012)

Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof) - Petr Jancar (Log. Methods Comput. Sci., 2012)

Complexity of Checking Bisimilarity between Sequential and Parallel Processes. - Wojciech Czerwinski; Petr Jancar; Martin Kot; Zdenek Sawa (MFCS, 2013)

Equivalence of deterministic one-counter automata is NL-complete. - Stanislav Böhm; Stefan Göller; Petr Jancar (STOC, 2013)

Bisimulation equivalence of first-order grammars is Ackermann-hard. - Petr Jancar (CoRR, 2013)

Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes - Petr Jancar; Jirí Srba (CoRR, 2013)

Finiteness up to bisimilarity is decidable for pushdown processes - Petr Jancar (CoRR, 2013)

Equivalences of Pushdown Systems Are Hard. - Petr Jancar (FoSSaCS, 2014)

Bisimulation Equivalence of First-Order Grammars. - Petr Jancar (ICALP (2), 2014)

Language equivalence of probabilistic pushdown automata. - Vojtech Forejt; Petr Jancar; Stefan Kiefer; James Worrell 001 (Inf. Comput., 2014)

Bisimulation equivalence and regularity for real-time one-counter automata. - Stanislav Böhm; Stefan Göller; Petr Jancar (J. Comput. Syst. Sci., 2014)

Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. - Wojciech Czerwinski; Petr Jancar (LICS, 2015)

On Reachability-Related Games on Vector Addition Systems with States. - Petr Jancar (RP, 2015)

On Reachability for Unidirectional Channel Systems Extended with Regular Tests. - Petr Jancar; Prateek Karandikar; Philippe Schnoebelen (Log. Methods Comput. Sci., 2015)

An Approach to Verification of MPI Applications Defined in a High-Level Model. - Ondrej Meca; Stanislav Böhm; Marek Behalek; Petr Jancar (ACSD, 2016)

State-Space Reduction of Non-deterministically Synchronizing Systems Applicable to Deadlock Detection in MPI. - Stanislav Böhm; Ondrej Meca; Petr Jancar (FM, 2016)

Deciding Structural Liveness of Petri Nets. - Petr Jancar (SOFSEM, 2017)

Branching Bisimilarity of Normed BPA Processes as a Rational Monoid. - Petr Jancar (Log. Methods Comput. Sci., 2017)

EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets. - Petr Jancar; Petr Osicka; Zdenek Sawa (RP, 2018)

EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets. - Petr Jancar; Petr Osicka; Zdenek Sawa (CoRR, 2018)

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. - Vojtech Forejt; Petr Jancar; Stefan Kiefer; James Worrell 001 (Log. Methods Comput. Sci., 2018)

Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. - Petr Jancar; Sylvain Schmitz (LICS, 2019)

Structural liveness of Petri nets is ExpSpace-hard and decidable. - Petr Jancar; David Purser (Acta Informatica, 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)

Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence. - Petr Jancar (J. Comput. Syst. Sci., 2020)

The Simplest Non-Regular Deterministic Context-Free Language. - Petr Jancar; Jirí Síma (MFCS, 2021)

Equivalence of pushdown automata via first-order grammars. - Petr Jancar (J. Comput. Syst. Sci., 2021)

Semilinear Home-space is Decidable for Petri Nets. - Petr Jancar; Jérôme Leroux (CoRR, 2022)

Structural Liveness of Immediate Observation Petri Nets. - Petr Jancar; Jiri Valusek (Fundam. Informaticae, 2022)

Resource Bisimilarity in Petri Nets is Decidable. - Irina A. Lomazova; Vladimir A. Bashkin; Petr Jancar (Fundam. Informaticae, 2022)

Bisimilarity on Basic Parallel Processes. - Petr Jancar (Theor. Comput. Sci., 2022)

The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. - Petr Jancar; Jérôme Leroux (CONCUR, 2023)

Countdown games, and simulation on (succinct) one-counter nets. - Petr Jancar; Petr Osicka; Zdenek Sawa (Log. Methods Comput. Sci., 2023)

On the Home-Space Problem for Petri Nets. - Petr Jancar; Jérôme Leroux (Taming the Infinities of Concurrency, 2024)

A concise proof of Commoner's theorem. - Petr Jancar (CoRR, 2024)

On the Home-Space Problem for Petri Nets and its Ackermannian Complexity. - Petr Jancar; Jérôme Leroux (Log. Methods Comput. Sci., 2024)

Coverability in Well-Formed Free-Choice Nets. - Eike Best; Raymond Devillers; Petr Jancar (Petri Nets, 2025)

Structural Liveness of Conservative Petri Nets. - Petr Jancar; Jérôme Leroux; Jiri Valusek (FoSSaCS, 2025)