Jančar P., Leroux J. On the home-space problem for Petri nets and its Ackermannian complexity. Logical Methods in Computer Science. 2024.

Jančar P., Osička P., Sawa Z. Countdown games, and simulation on (succinct) one-counter nets. Logical Methods in Computer Science. 2023.

Jančar P., Valůšek J. Structural Liveness of Immediate Observation Petri Nets. FUNDAMENTA INFORMATICAE. 2023.

Jančar P. Bisimilarity on Basic Parallel Processes. THEORETICAL COMPUTER SCIENCE. 2022.

Lomazova IA., Bashkin VA., Jančar P. Resource Bisimilarity in Petri Nets is Decidable. FUNDAMENTA INFORMATICAE. 2022.

Jančar P. Equivalence of pushdown automata via first-order grammars. JOURNAL OF COMPUTER AND SYSTEM SCIENCES. 2021.

Jančar P. Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence. JOURNAL OF COMPUTER AND SYSTEM SCIENCES. 2020.

Jančar P., Leroux J., Sutre G. Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. FUNDAMENTA INFORMATICAE. 2019.

Jančar P., Purser D. Structural liveness of Petri nets is ExpSpace-hard and decidable. ACTA INFORMATICA. 2019.

Forejt V., Jančar P., Kiefer S., Worrell J. Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. Logical Methods in Computer Science. 2018.

Jančar P., Leroux J. The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets. Leibniz International Proceedings in Informatics (LIPIcs). 2023.

Jančar P., Šíma J. The Simplest Non-Regular Deterministic Context-Free Language. 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). 2021.

Jančar P., Schmitz S. Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. Proceedings - Symposium on Logic in Computer Science Volume 2019. 2019.

Jančar P., Leroux J., Sutre G. Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States. 39th International Conference on Application and Theory of Petri Nets and Concurrency. 2018.

Jančar P., Osička P., Sawa Z. EXPSPACE-complete variant of countdown games, and simulation on succinct one-counter nets. International Conference on Reachability Problems, RP 2018: Reachability Problems. 2018.

Jančar P., Leroux J. On the Home-Space Problem for Petri Nets. TAMING THE INFINITIES OF CONCURRENCY. 2024.

Jančar P., Leroux J. On the Home-Space Problem for Petri Nets. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2024.