| Publication | Date of Publication | Type |
|---|
| Just verification of mutual exclusion algorithms | 2026-08-05 | Paper |
| Branching bisimilarity for processes with time-outs | 2026-02-10 | Paper |
Formal methods for mobile ad hoc networks: a survey
Formal Methods in System Design | 2026-01-08 | Paper |
| Semantics for linear-time temporal logic with finite observations | 2025-08-19 | Paper |
| A lean-congruence format for ep-bisimilarity | 2025-07-24 | Paper |
| A cancellation law for probabilistic processes | 2025-07-24 | Paper |
| A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice | 2024-03-14 | Paper |
| Stronger Validity Criteria for Encoding Synchrony | 2024-03-14 | Paper |
Reward testing equivalences for processes
Models, Languages, and Tools for Concurrent and Distributed Programming | 2024-02-23 | Paper |
Comparing the Expressiveness of the π-calculus and CCS
ACM Transactions on Computational Logic | 2024-02-21 | Paper |
A process algebra for link layer protocols
Programming Languages and Systems | 2023-11-24 | Paper |
Just testing
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Modelling mutual exclusion in a process algebra with time-outs
Information and Computation | 2023-09-27 | Paper |
| CONCUR Test-Of-Time Award 2021 (Invited Paper) | 2023-08-21 | Paper |
Enabling Preserving Bisimulation Equivalence
(available as arXiv preprint) | 2023-08-21 | Paper |
Comparing the expressiveness of the \(\pi \)-calculus and CCS
Programming Languages and Systems | 2023-08-03 | Paper |
Fair must testing for I/O automata
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Analysing AWN-Specifications Using mCRL2 (Extended Abstract)
Lecture Notes in Computer Science | 2023-06-28 | Paper |
Cross-chain payment protocols with success guarantees
Distributed Computing | 2023-06-19 | Paper |
Axiomatizing flat iteration
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Reactive bisimulation semantics for a process algebra with timeouts
Acta Informatica | 2023-03-01 | Paper |
Abstract processes in the absence of conflicts in general place/transition systems
Information and Computation | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7559462 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7453963 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-07 | Paper |
| scientific article; zbMATH DE number 7453963 (Why is no real title available?) | 2022-01-07 | Paper |
scientific article; zbMATH DE number 7449995 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-20 | Paper |
| scientific article; zbMATH DE number 7449995 (Why is no real title available?) | 2021-12-20 | Paper |
Analysing mutual exclusion using process algebra with signals
(available as arXiv preprint) | 2021-12-08 | Paper |
| Analysing mutual exclusion using process algebra with signals | 2021-12-08 | Paper |
Analysing and comparing encodability criteria
(available as arXiv preprint) | 2021-12-03 | Paper |
| Analysing and comparing encodability criteria | 2021-12-03 | Paper |
Abstract processes and conflicts in place/transition systems
Information and Computation | 2021-11-25 | Paper |
| scientific article; zbMATH DE number 7378547 (Why is no real title available?) | 2021-08-04 | Paper |
Failure trace semantics for a process algebra with time-outs
(available as arXiv preprint) | 2021-05-25 | Paper |
| Failure trace semantics for a process algebra with time-outs | 2021-05-25 | Paper |
Musings on encodings and expressiveness
(available as arXiv preprint) | 2021-04-27 | Paper |
| Musings on encodings and expressiveness | 2021-04-27 | Paper |
| Real-reward testing for probabilistic processes (extended abstract) | 2021-03-10 | Paper |
Lean and full congruence formats for recursion
(available as arXiv preprint) | 2021-01-19 | Paper |
| Lean and full congruence formats for recursion | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7243676 (Why is no real title available?)
(available as arXiv preprint) | 2020-09-04 | Paper |
| scientific article; zbMATH DE number 7243676 (Why is no real title available?) | 2020-09-04 | Paper |
| Divide and congruence. III: Stability \& divergence | 2020-05-27 | Paper |
| Precongruence formats with lookahead through modal decomposition | 2020-05-26 | Paper |
Justness. A completeness criterion for capturing liveness properties (extended abstract)
(available as arXiv preprint) | 2020-01-28 | Paper |
Ensuring liveness properties of distributed systems: open problems
Journal of Logical and Algebraic Methods in Programming | 2019-11-28 | Paper |
Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
Information and Computation | 2019-09-17 | Paper |
Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
Information and Computation | 2019-09-17 | Paper |
Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
Journal of Logical and Algebraic Methods in Programming | 2018-12-19 | Paper |
A theory of encodings and expressiveness (extended abstract)
(available as arXiv preprint) | 2018-07-17 | Paper |
On the validity of encodings of the synchronous in the asynchronous -calculus
Information Processing Letters | 2018-06-15 | Paper |
Divide and congruence. II: Delay and weak bisimilarity
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
A branching time model of CSP
(available as arXiv preprint) | 2018-03-26 | Paper |
Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
Information and Computation | 2017-11-16 | Paper |
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Proof nets for unit-free multiplicative-additive linear logic
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Modelling and verifying the AODV routing protocol
Distributed Computing | 2016-10-17 | Paper |
Mechanizing a process algebra for network protocols
Journal of Automated Reasoning | 2016-05-26 | Paper |
A timed process algebra for wireless networks with an application in routing (extended abstract)
Programming Languages and Systems | 2016-04-26 | Paper |
A mechanized proof of loop freedom of the (untimed) AODV routing protocol
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
Lecture Notes in Computer Science | 2015-11-04 | Paper |
On the axiomatizability of impossible futures
Logical Methods in Computer Science | 2015-10-29 | Paper |
On Specifying Timeouts
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
Acta Informatica | 2015-04-16 | Paper |
Showing invariance compositionally for a process algebra for network protocols
Interactive Theorem Proving | 2014-09-08 | Paper |
Symmetric and asymmetric asynchronous interaction
Electronic Notes in Theoretical Computer Science | 2014-06-27 | Paper |
Real-reward testing for probabilistic processes
Theoretical Computer Science | 2014-06-06 | Paper |
Remarks on testing probabilistic processes
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
| Divide and congruence applied to -bisimulation | 2013-10-07 | Paper |
On characterising distributability
Logical Methods in Computer Science | 2013-09-26 | Paper |
| On the expressiveness of higher dimensional automata (extended abstract) | 2013-09-25 | Paper |
Abstract processes of place/transition systems
Information Processing Letters | 2013-04-04 | Paper |
Preface
Formal Aspects of Computing | 2013-03-22 | Paper |
A process algebra for wireless mesh networks
Programming Languages and Systems | 2012-06-22 | Paper |
On Distributability of Petri Nets
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
Information and Computation | 2012-05-24 | Paper |
On causal semantics of Petri nets (extended abstract)
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
On cool congruence formats for weak bisimulations
Theoretical Computer Science | 2011-07-07 | Paper |
The coarsest precongruences respecting safety and liveness properties
IFIP Advances in Information and Communication Technology | 2010-10-27 | Paper |
On CSP and the algebraic theory of effects
Reflections on the Work of C.A.R. Hoare | 2010-10-26 | Paper |
Characterising probabilistic processes logically (extended abstract)
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Ready to preorder: the case of weak process semantics
Information Processing Letters | 2010-06-09 | Paper |
Compositionality of Hennessy-Milner logic through structural operational semantics.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Bundle event structures and CCSP.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Computation tree logic with deadlock detection
Logical Methods in Computer Science | 2010-01-28 | Paper |
Testing Finitary Probabilistic Processes
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae | 2009-09-29 | Paper |
Configuration structures, event structures and Petri nets
Theoretical Computer Science | 2009-09-29 | Paper |
Characterising Testing Preorders for Finite Probabilistic Processes
Logical Methods in Computer Science | 2009-04-29 | Paper |
Five Determinisation Algorithms
Implementation and Applications of Automata | 2009-02-12 | Paper |
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
Lecture Notes in Computer Science | 2009-02-03 | Paper |
On Synchronous and Asynchronous Interaction in Distributed Systems
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Correcting a Space-Efficient Simulation Algorithm
Computer Aided Verification | 2008-07-15 | Paper |
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
Formal Methods for Components and Objects | 2007-09-11 | Paper |
Scalar Outcomes Suffice for Finitary Probabilistic Testing
Programming Languages and Systems | 2007-09-04 | Paper |
Liveness, Fairness and Impossible Futures
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Erratum to ``On the expressiveness of higher dimensional automata''
Theoretical Computer Science | 2007-01-22 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Theoretical Aspects of Computing – ICTAC 2005
Lecture Notes in Computer Science | 2006-11-01 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
On the expressiveness of higher dimensional automata
Theoretical Computer Science | 2006-05-29 | Paper |
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science | 2006-04-28 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Well-behaved flow event structures for parallel composition and action refinement
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2102773 (Why is no real title available?) | 2004-09-24 | Paper |
The meaning of negative premises in transition system specifications. II
The Journal of Logic and Algebraic Programming | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2088673 (Why is no real title available?) | 2004-08-12 | Paper |
Nested semantics over finite trees are equationally hard
Information and Computation | 2004-08-06 | Paper |
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica | 2001-02-20 | Paper |
