| Publication | Date of Publication | Type |
|---|
Extensible Proof Systems for Infinite-State Systems
ACM Transactions on Computational Logic | 2024-02-21 | Paper |
Better automata through process algebra
Lecture Notes in Computer Science | 2023-07-26 | Paper |
An algebraic theory of multiple clocks
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Resilience to denial-of-service and integrity attacks: a structured systems approach
European Journal of Control | 2022-03-04 | Paper |
| Bisimulation and Hennessy-Milner logic for generalized synchronization trees | 2021-12-08 | Paper |
Bisimulation and Hennessy-Milner logic for generalized synchronization trees
(available as arXiv preprint) | 2021-12-08 | Paper |
Generating diagnostic information for behavioral preorders
Distributed Computing | 2020-11-30 | Paper |
Notions of Centralized and Decentralized Opacity in Linear Systems
IEEE Transactions on Automatic Control | 2020-10-07 | Paper |
Testing preorders for probabilistic processes
Automata, Languages and Programming | 2019-12-04 | Paper |
Corrections to “A Menagerie of Timed Automata”
ACM Computing Surveys | 2019-08-09 | Paper |
Probabilistic reachability for multi-parameter bifurcation analysis of cardiac alternans
Theoretical Computer Science | 2019-06-18 | Paper |
Process algebra and model checking
Handbook of Model Checking | 2018-07-20 | Paper |
The Power of Proofs: New Algorithms for Timed Automata Model Checking
Lecture Notes in Computer Science | 2015-08-06 | Paper |
A menagerie of timed automata
ACM Computing Surveys | 2015-03-02 | Paper |
Generalized synchronization trees
Lecture Notes in Computer Science | 2014-04-16 | Paper |
An instrumentation-based approach to controller validation
Next Generation Design and Verification Methodologies for Distributed Embedded Control Systems | 2010-06-02 | Paper |
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science | 2010-03-30 | Paper |
An Integrated Framework for Scenarios and State Machines
Lecture Notes in Computer Science | 2007-11-29 | Paper |
Probabilistic I/O Automata: Theories of Two Equivalences
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2005
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science | 2005-09-22 | Paper |
| scientific article; zbMATH DE number 2080212 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1956598 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1903371 (Why is no real title available?) | 2003-05-01 | Paper |
Testing preorders for probabilistic processes.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1796122 (Why is no real title available?) | 2002-09-04 | Paper |
Hiding resources that can fail: An axiomatic perspective
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1759619 (Why is no real title available?) | 2002-06-25 | Paper |
Generic tools for verifying concurrent systems
Science of Computer Programming | 2002-06-02 | Paper |
| scientific article; zbMATH DE number 1705168 (Why is no real title available?) | 2002-02-14 | Paper |
| Equivalence and preorder checking for finite-state systems | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1497761 (Why is no real title available?) | 2001-03-06 | Paper |
| Priority in process algebra. | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1330140 (Why is no real title available?) | 1999-09-01 | Paper |
Local model checking and protocol analysis
International Journal on Software Tools for Technology Transfer. STTT | 1999-01-01 | Paper |
Pragmatics of model checking: An STTT special section
International Journal on Software Tools for Technology Transfer. STTT | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 742883 (Why is no real title available?) | 1995-04-11 | Paper |
A linear-time model-checking algorithm for the alternation-free modal mu- calculus
Formal Methods in System Design | 1993-08-17 | Paper |
Testing equivalence as a bisimulation equivalence
Formal Aspects of Computing | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176729 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177261 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177532 (Why is no real title available?) | 1993-05-18 | Paper |
Priorities in process algebras
Information and Computation | 1990-01-01 | Paper |
Tableau-based model checking in the propositional mu-calculus
Acta Informatica | 1990-01-01 | Paper |
Type theory and concurrency
International Journal of Parallel Programming | 1988-01-01 | Paper |
