| Publication | Date of Publication | Type |
|---|
| Decidability results in automata and process theory | 2024-06-21 | Paper |
Infinite results CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Behavioural abstraction in TCCS Automata, Languages and Programming | 2019-12-04 | Paper |
| A specification theory of real-time processes | 2018-03-26 | Paper |
Automated Verification of Signalling Principles in Railway Interlocking Systems Electronic Notes in Theoretical Computer Science | 2015-03-18 | Paper |
Modelling computing systems. Mathematics for computer science Undergraduate Topics in Computer Science | 2013-07-23 | Paper |
Deciding bisimilarity between BPA and BPP processes. Lecture Notes in Computer Science | 2010-03-30 | Paper |
Weak Bisimulation Approximants Computer Science Logic | 2009-03-12 | Paper |
On the computational complexity of bisimulation, redux Information and Computation | 2005-01-11 | Paper |
DP lower bounds for equivalence-checking and model-checking of one-counter automata Information and Computation | 2004-11-23 | Paper |
Equivalence-checking with one-counter automata: A generic method for proving lower bounds Lecture Notes in Computer Science | 2004-08-11 | Paper |
Counting on CTL^*: On the expressive power of monadic path logic Information and Computation | 2003-07-29 | Paper |
Pushdown automata, multiset automata, and Petri nets Theoretical Computer Science | 2001-08-20 | Paper |
| Verification on infinite structures. | 2001-01-01 | Paper |
Simulation and bisimulation over one-counter processes Lecture Notes in Computer Science | 2000-09-04 | Paper |
Simulation problems for one-counter machines Lecture Notes in Computer Science | 2000-08-13 | Paper |
Petri nets and regular processes Journal of Computer and System Sciences | 2000-03-19 | Paper |
Techniques for decidability and undecidability of bisimilarity Lecture Notes in Computer Science | 1999-11-10 | Paper |
A polynomial algorithm for deciding bisimilarity of normed context-free processes Theoretical Computer Science | 1997-02-27 | Paper |
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes Mathematical Structures in Computer Science | 1996-11-18 | Paper |
The importance of the left merge operator in process algebra Lecture Notes in Computer Science | 1993-05-18 | Paper |
Unique decomposition of processes Theoretical Computer Science | 1993-05-16 | Paper |
Unique decomposition of processes Theoretical Computer Science | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 4777 (Why is no real title available?) | 1992-06-25 | Paper |