| Publication | Date of Publication | Type |
|---|
| Termination, deadlock and divergence | 2023-04-12 | Paper |
| An efficiency preorder for processes | 2022-08-16 | Paper |
| A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes | 2020-02-24 | Paper |
| Higher-order processes and their models | 2019-04-29 | Paper |
| Distributed processes and location failures | 2018-07-04 | Paper |
| Distinguishing between communicating transactions | 2018-03-21 | Paper |
| A theory of weak bisimulation for core CML | 2016-09-01 | Paper |
| Modelling session types using contracts | 2016-07-28 | Paper |
| Using higher-order contracts to model session types | 2016-07-06 | Paper |
| The security picalculus and non-interference (extended abstract) | 2016-05-03 | Paper |
| Modelling MAC-Layer Communications in Wireless Systems | 2015-04-22 | Paper |
| Mutually Testing Processes | 2015-04-22 | Paper |
| Bisimulation congruences in safe ambients | 2015-03-17 | Paper |
| Uniqueness typing for resource management in message-passing concurrency | 2015-01-12 | Paper |
| Using Higher-Order Contracts to Model Session Types (Extended Abstract) | 2014-09-15 | Paper |
| Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency | 2014-07-31 | Paper |
| Counting the Cost in the Picalculus (Extended Abstract) | 2014-06-27 | Paper |
| Real-reward testing for probabilistic processes | 2014-06-06 | Paper |
| Bisimulations for Communicating Transactions | 2014-04-16 | Paper |
| Remarks on Testing Probabilistic Processes | 2013-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852098 | 2013-10-07 | Paper |
| Modelling Probabilistic Wireless Networks | 2013-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2848667 | 2013-09-26 | Paper |
| Mutually Testing Processes | 2013-08-12 | Paper |
| Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation | 2013-08-12 | Paper |
| Typed behavioural equivalences for processes in the presence of subtyping | 2013-07-24 | Paper |
| On the semantics of Markov automata | 2013-06-06 | Paper |
| Exploring probabilistic bisimulations. I | 2013-03-22 | Paper |
| First-order reasoning for higher-order concurrency | 2012-10-25 | Paper |
| Compositional Reasoning for Markov Decision Processes | 2012-06-29 | Paper |
| On the Semantics of Markov Automata | 2011-07-07 | Paper |
| A calculus for costed computations | 2011-05-26 | Paper |
| A Testing Theory for a Higher-Order Cryptographic Language | 2011-05-19 | Paper |
| Communicating Transactions | 2010-08-31 | Paper |
| Towards a semantic theory of CML | 2010-06-17 | Paper |
| Testing Finitary Probabilistic Processes | 2009-10-22 | Paper |
| Characterising Testing Preorders for Finite Probabilistic Processes | 2009-04-29 | Paper |
| A theory of system behaviour in the presence of node and link failure | 2008-08-22 | Paper |
| Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra | 2008-06-19 | Paper |
| Security Policies as Membranes in Systems for Global Computing | 2007-10-11 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) | 2007-09-04 | Paper |
| A theory for observational fault tolerance | 2007-08-23 | Paper |
| A Distributed Pi-Calculus | 2007-05-21 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Adding recursion to Dpi | 2007-04-19 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| Formal Techniques for Networked and Distributed Systems - FORTE 2005 | 2006-07-07 | Paper |
| safeDpi: a language for controlling mobile code | 2006-01-10 | Paper |
| The security pi-calculus and non-interference | 2005-04-18 | Paper |
| Typed behavioural equivalences for processes in the presence of subtyping | 2005-02-28 | Paper |
| Towards a behavioural theory of access and mobility control in distributed systems | 2004-10-04 | Paper |
| Trust and partial typing in open systems of mobile agents | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417865 | 2003-07-30 | Paper |
| Resource access control in systems of mobile agents | 2003-01-14 | Paper |
| Assigning types to processes | 2003-01-14 | Paper |
| A fully abstract denotational semantics for the \(\pi\)-calculus | 2002-07-15 | Paper |
| Testing equivalences for processes | 2002-05-13 | Paper |
| Distributed processes and location failures | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754161 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494236 | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270081 | 1999-11-10 | Paper |
| Bisimulations for a calculus of broadcasting systems | 1999-06-22 | Paper |
| A behavioural theory of first-order CML | 1999-04-28 | Paper |
| A theory of weak bisimulation for Core CML | 1999-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218935 | 1999-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223018 | 1999-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223008 | 1999-01-07 | Paper |
| Full abstractness for a functional/concurrent language with higher-order value-passing | 1998-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4349577 | 1998-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364391 | 1997-11-17 | Paper |
| Concurrent testing of processes | 1995-11-20 | Paper |
| A modal logic for message passing processes | 1995-07-24 | Paper |
| A process algebra for timed systems | 1995-07-10 | Paper |
| Adding action refinement to a finite process algebra | 1995-02-16 | Paper |
| A fully abstract denotational model for higher-order processes | 1995-01-22 | Paper |
| Termination, deadlock, and divergence | 1994-08-21 | Paper |
| An efficiency preorder for processes | 1994-06-30 | Paper |
| A theory of processes with localities | 1994-06-29 | Paper |
| A theory of communicating processes with value passing | 1994-03-24 | Paper |
| Communicating processes with value-passing and assignments | 1993-12-06 | Paper |
| Observing localities | 1993-10-17 | Paper |
| Towards action-refinement in process algebras | 1993-06-29 | Paper |
| Testing equivalence as a bisimulation equivalence | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035230 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036589 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038693 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3998266 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3997501 | 1992-09-17 | Paper |
| A proof system for communicating processes with value-passing | 1992-06-27 | Paper |
| Priorities in process algebras | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204033 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355228 | 1989-01-01 | Paper |
| Distributed bisimulations | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733391 | 1989-01-01 | Paper |
| Axiomatising Finite Concurrent Processes | 1988-01-01 | Paper |
| An algebraic theory of fair asynchronous communicating processes | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794154 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721641 | 1987-01-01 | Paper |
| Proving systolic systems correct | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3681913 | 1985-01-01 | Paper |
| The power of the future perfect in program logics | 1985-01-01 | Paper |
| Algebraic laws for nondeterminism and concurrency | 1985-01-01 | Paper |
| Acceptance trees | 1985-01-01 | Paper |
| Axiomatising finite delay operators | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221398 | 1984-01-01 | Paper |
| Synchronous and asynchronous experiments on processes | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657414 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3662610 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3947096 | 1982-01-01 | Paper |
| A term model for synchronous processes | 1981-01-01 | Paper |
| A proof system for the first-order relational calculus | 1980-01-01 | Paper |
| A mathematical semantics for a nondeterministic typed lambda-calculus | 1980-01-01 | Paper |
| The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883467 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3938462 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907039 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4159365 | 1976-01-01 | Paper |
