| Publication | Date of Publication | Type |
|---|
| Structural liveness of conservative Petri nets | 2025-12-04 | Paper |
| The semilinear home-space problem is Ackermann-complete for Petri nets | 2025-06-26 | Paper |
On the home-space problem for Petri nets and its Ackermannian complexity
Logical Methods in Computer Science | 2025-01-31 | Paper |
| Bisimulation equivalence of first-order grammars is ACKERMANN-complete | 2024-12-19 | Paper |
scientific article; zbMATH DE number 7724236 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
Structural Liveness of Immediate Observation Petri Nets
Fundamenta Informaticae | 2023-05-19 | Paper |
Countdown games, and simulation on (succinct) one-counter nets
Logical Methods in Computer Science | 2023-03-22 | Paper |
Restarting automata
Fundamentals of Computation Theory | 2022-12-09 | Paper |
| scientific article; zbMATH DE number 7627630 (Why is no real title available?) | 2022-12-06 | Paper |
Resource Bisimilarity in Petri Nets is Decidable
Fundamenta Informaticae | 2022-10-07 | Paper |
High undecidability of weak bisimilarity for Petri nets
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
Characterization of context-free languages by erasing automata
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Decidability of weak fairness in Petri nets
STACS 89 | 2022-08-16 | Paper |
Bisimilarity on basic parallel processes
Theoretical Computer Science | 2022-02-01 | Paper |
Equivalence of pushdown automata via first-order grammars
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
Journal of Computer and System Sciences | 2020-02-24 | Paper |
Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
Fundamenta Informaticae | 2020-01-24 | Paper |
| State-space reduction of non-deterministically synchronizing systems applicable to deadlock detection in MPI | 2020-01-03 | Paper |
| Co-finiteness and co-emptiness of reachability sets in vector addition systems with states | 2019-12-18 | Paper |
Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
Acta Informatica | 2019-08-13 | Paper |
Game characterization of probabilistic bisimilarity, and applications to pushdown automata
(available as arXiv preprint) | 2018-11-30 | Paper |
| EXPSPACE-complete variant of countdown games, and simulation on succinct one-counter nets | 2018-10-23 | Paper |
Bisimulation equivalence is decidable for one-counter processes
Automata, Languages and Programming | 2018-07-04 | Paper |
Branching bisimilarity of normed BPA processes is in NExpTime
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence.
(available as arXiv preprint) | 2018-03-21 | Paper |
Branching bisimilarity of normed BPA processes as a rational monoid
(available as arXiv preprint) | 2017-12-11 | Paper |
| On reachability-related games on vector addition systems with states | 2017-10-27 | Paper |
Decidability of DPDA language equivalence via first-order grammars
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Deciding Structural Liveness of Petri Nets
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Bisimilarity of probabilistic pushdown automata
(available as arXiv preprint) | 2017-01-26 | Paper |
On reachability for unidirectional channel systems extended with regular tests
Logical Methods in Computer Science | 2015-04-22 | Paper |
Equivalence of deterministic one-counter automata is NL-complete
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Language equivalence of probabilistic pushdown automata
Information and Computation | 2014-07-18 | Paper |
Bisimulation Equivalence of First-Order Grammars
Automata, Languages, and Programming | 2014-07-01 | Paper |
Equivalences of Pushdown Systems Are Hard
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences | 2014-02-13 | Paper |
Complexity of checking bisimilarity between sequential and parallel processes
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Bisimilarity on basic process algebra is in 2-ExpTime (an explicit proof)
Logical Methods in Computer Science | 2013-04-09 | Paper |
Unidirectional channel systems can be tested
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Equivalence-checking with infinite-state systems: techniques and results
SOFSEM 2002: Theory and Practice of Informatics | 2011-04-01 | Paper |
Complexity of deciding bisimilarity between normed BPA and normed BPP
Information and Computation | 2010-10-07 | Paper |
Reachability games on extended vector addition systems with states
Automata, Languages and Programming | 2010-09-07 | Paper |
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR 2010 - Concurrency Theory | 2010-08-31 | Paper |
Deciding bisimilarity between BPA and BPP processes.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
A note on emptiness for alternating finite automata with a one-letter alphabet
Information Processing Letters | 2010-03-24 | Paper |
Non-interleaving bisimulation equivalences on basic parallel processes
Information and Computation | 2010-01-12 | Paper |
Hardness of equivalence checking for composed finite-state systems
Acta Informatica | 2009-05-08 | Paper |
Undecidability of bisimilarity by defender's forcing
Journal of the ACM | 2008-12-21 | Paper |
Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm
Information and Computation | 2008-12-03 | Paper |
Normed BPA vs. Normed BPP Revisited
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
Developments in Language Theory | 2008-10-30 | Paper |
| Monotonicity of restarting automata | 2008-08-12 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
| Behavioural equivalences on finite-state systems are PTIME-hard | 2007-03-07 | Paper |
| scientific article; zbMATH DE number 5051573 (Why is no real title available?) | 2006-09-06 | Paper |
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming | 2006-07-14 | Paper |
Applications and Theory of Petri Nets 2005
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2163042 (Why is no real title available?) | 2005-04-29 | Paper |
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2102771 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2087430 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080931 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2013185 (Why is no real title available?) | 2003-12-04 | Paper |
Decidability of bisimilarity for one-counter processes.
Information and Computation | 2003-01-14 | Paper |
A note on well quasi-orderings for powersets
Information Processing Letters | 2002-07-25 | Paper |
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science | 2001-08-20 | Paper |
Nonprimitive recursive complexity and undecidability for Petri net equivalences
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1500527 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1490007 (Why is no real title available?) | 2000-08-13 | Paper |
Petri nets and regular processes
Journal of Computer and System Sciences | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1414283 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1405652 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1394484 (Why is no real title available?) | 2000-01-30 | Paper |
| scientific article; zbMATH DE number 1361117 (Why is no real title available?) | 1999-11-10 | Paper |
| scientific article; zbMATH DE number 1333609 (Why is no real title available?) | 1999-09-19 | Paper |
| scientific article; zbMATH DE number 1232243 (Why is no real title available?) | 1999-01-03 | Paper |
Undecidability of bisimilarity for Petri nets and some related problems
Theoretical Computer Science | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 898049 (Why is no real title available?) | 1996-08-21 | Paper |
Forgetting automata and contex-free languages
Acta Informatica | 1995-11-19 | Paper |
Completeness results for single-path Petri nets
Information and Computation | 1994-05-06 | Paper |
| scientific article; zbMATH DE number 176140 (Why is no real title available?) | 1993-05-18 | Paper |
Decidability of a temporal logic problem for Petri nets
Theoretical Computer Science | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4117879 (Why is no real title available?) | 1989-01-01 | Paper |
