| 2025 | FOSSACS | Structural Liveness of Conservative Petri Nets. | Petr Jancar, Jrme Leroux, Jiri Valusek |
| 2023 | CONCUR | The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. | Petr Jancar, Jrme Leroux |
| 2021 | MFCS | The Simplest Non-Regular Deterministic Context-Free Language. | Petr Jancar, Jir Sma |
| 2019 | LICS | Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. | Petr Jancar, Sylvain Schmitz |
| 2017 | SOFSEM | Deciding Structural Liveness of Petri Nets. | Petr Jancar |
| 2016 | FM | State-Space Reduction of Non-deterministically Synchronizing Systems Applicable to Deadlock Detection in MPI. | Stanislav Bhm, Ondrej Meca, Petr Jancar |
| 2016 | MFCS | Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. | Petr Jancar |
| 2015 | LICS | Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. | Wojciech Czerwinski, Petr Jancar |
| 2014 | FOSSACS | Equivalences of Pushdown Systems Are Hard. | Petr Jancar |
| 2014 | ICALP | Bisimulation Equivalence of First-Order Grammars. | Petr Jancar |
| 2013 | MFCS | Complexity of Checking Bisimilarity between Sequential and Parallel Processes. | Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa |
| 2013 | STOC | Equivalence of deterministic one-counter automata is NL-complete. | Stanislav Bhm, Stefan Gller, Petr Jancar |
| 2012 | LICS | Decidability of DPDA Language Equivalence via First-Order Grammars. | Petr Jancar |
| 2010 | CONCUR | Bisimilarity of One-Counter Processes Is PSPACE-Complete. | Stanislav Bhm, Stefan Gller, Petr Jancar |
| 2010 | ICALP | Reachability Games on Extended Vector Addition Systems with States. | Toms Brzdil, Petr Jancar, Antonn Kucera |
| 2008 | CONCUR | Normed BPA vs. Normed BPP Revisited. | Petr Jancar, Martin Kot, Zdenek Sawa |
| 2008 | DLT | Selected Ideas Used for Decidability and Undecidability of Bisimilarity. | Petr Jancar |
| 2006 | FOSSACS | Undecidability Results for Bisimilarity on Prefix Rewrite Systems. | Petr Jancar, Jir Srba |
| 2003 | CONCUR | Deciding Bisimilarity between BPA and BPP Processes. | Petr Jancar, Antonn Kucera, Faron Moller |
| 2003 | LICS | Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. | Petr Jancar |
| 2002 | FOSSACS | Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. | Petr Jancar, Antonn Kucera, Faron Moller, Zdenek Sawa |
| 2002 | SOFSEM | Equivalence-Checking with Infinite-State Systems: Techniques and Results. | Antonn Kucera, Petr Jancar |
| 2001 | SOFSEM | P-Hardness of Equivalence Testing on Finite-State Processes. | Zdenek Sawa, Petr Jancar |
| 2000 | STACS | Simulation and Bisimulation over One-Counter Processes. | Petr Jancar, Antonn Kucera, Faron Moller |
| 1999 | CONCUR | Techniques for Decidability and Undecidability of Bisimilarity. | Petr Jancar, Faron Moller |
| 1999 | ICALP | Boundedness of Reset P/T Nets. | Catherine Dufourd, Petr Jancar, Philippe Schnoebelen |
| 1999 | SOFSEM | Simulation Problems for One-Counter Machines. | Petr Jancar, Faron Moller, Zdenek Sawa |
| 1998 | ICALP | Deciding Bisimulation-Like Equivalences with Finite-State Processes. | Petr Jancar, Antonn Kucera, Richard Mayr |
| 1997 | DLT | Deleting Automata with a Restart Operation. | Petr Jancar, Frantisek Mrz, Martin Pltek, Martin Prochzka, Jrg Vogel |
| 1997 | ICALP | Bisimulation Equivalence is Decidable for One-Counter Processes. | Petr Jancar |
| 1997 | SOFSEM | Monotonic Rewriting Automata with a Restart Operation. | Frantisek Mrz, Martin Pltek, Petr Jancar, Jrg Vogel |
| 1996 | ICALP | Deciding Finiteness of Petri Nets Up To Bisimulation. | Petr Jancar, Javier Esparza |
| 1995 | CONCUR | Checking Regular Properties of Petri Nets. | Petr Jancar, Faron Moller |
| 1995 | DLT | Restarting Automata, Marcus Grammars and Context-Free Languages. | Petr Jancar, Frantisek Mrz, Martin Pltek, Martin Prochzka, Jrg Vogel |
| 1995 | FCT | Restarting Automata. | Petr Jancar, Frantisek Mrz, Martin Pltek, Jrg Vogel |
| 1994 | STACS | Decidability Questions for Bismilarity of Petri Nets and Some Related Problems. | Petr Jancar |
| 1993 | MFCS | A Taxonomy of Forgetting Automata. | Petr Jancar, Frantisek Mrz, Martin Pltek |
| 1992 | MFCS | Characterization of Context-Free Languages by Erasing Automata. | Petr Jancar, Frantisek Mrz, Martin Pltek |
| 1991 | MFCS | Single-Path Petri Nets. | Rodney R. Howell, Petr Jancar, Louis E. Rosier |
| 1989 | STACS | Decidability of Waek Fairness in Petri Nets. | Petr Jancar |