| Publication | Date of Publication | Type |
|---|
| Optimally-fair exchange of secrets via delay encryption and commutative blinding | 2024-07-17 | Paper |
| Optimally-fair multi-party exchange without trusted parties | 2024-06-05 | Paper |
| The consensus machine: formalising consensus in the presence of malign agents | 2024-02-28 | Paper |
| Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer | 2023-04-13 | Paper |
| Unbounded nondeterminism in CSP | 2023-04-12 | Paper |
| Checking Static Properties Using Conservative SAT Approximations for Reachability | 2022-11-04 | Paper |
| CSP: A Practical Process Algebra | 2022-02-14 | Paper |
| Non-interference through determinism | 2021-12-20 | Paper |
| The Automatic Detection of Token Structures and Invariants Using SAT Checking | 2020-08-05 | Paper |
| Translating between models of concurrency | 2020-05-26 | Paper |
| Key agreement via protocols | 2020-03-03 | Paper |
| Tighter reachability criteria for deadlock-freedom analysis | 2020-01-03 | Paper |
| Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving | 2019-06-03 | Paper |
| Process Algebra and Model Checking | 2018-07-20 | Paper |
| Reducing complex CSP models to traces via priority | 2018-04-23 | Paper |
| Computing maximal weak and other bisimulations | 2017-02-14 | Paper |
| The expressiveness of CSP with priority | 2016-12-16 | Paper |
| Rigorous development of component-based systems using component metadata and patterns | 2016-10-28 | Paper |
| Confluence Thanks to Extensional Determinism | 2015-07-10 | Paper |
| FDR3 — A Modern Refinement Checker for CSP | 2015-02-10 | Paper |
| Machine-verifiable responsiveness | 2013-12-04 | Paper |
| On the relationship between web services security and traditional protocols | 2013-10-08 | Paper |
| A static analysis framework for livelock freedom in CSP | 2013-09-26 | Paper |
| Slow Abstraction via Priority | 2013-08-16 | Paper |
| Checking noninterference in timed CSP | 2013-03-22 | Paper |
| Short-Output Universal Hash Functions and Their Use in Fast and Secure Data Authentication | 2013-01-08 | Paper |
| SAT-solving in CSP trace refinement | 2012-07-20 | Paper |
| Static Livelock Analysis in CSP | 2011-09-02 | Paper |
| CSP is Expressive Enough for π | 2010-10-26 | Paper |
| Insight, Inspiration and Collaboration | 2010-10-26 | Paper |
| Understanding concurrent systems | 2010-03-10 | Paper |
| Local Search in Model Checking | 2009-12-01 | Paper |
| Integrated Formal Methods | 2009-05-07 | Paper |
| Revivals, stuckness and the hierarchy of CSP models | 2009-03-20 | Paper |
| Nets with Tokens Which Carry Data | 2009-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601861 | 2009-02-12 | Paper |
| The Three Platonic Models of Divergence-Strict CSP | 2009-01-27 | Paper |
| Authenticating ad hoc networks by comparison of short digests | 2008-04-16 | Paper |
| Responsiveness and stable revivals | 2007-09-06 | Paper |
| On the expressive power of CSP refinement | 2005-12-13 | Paper |
| Communicating Sequential Processes. The First 25 Years | 2005-11-29 | Paper |
| Communicating Sequential Processes. The First 25 Years | 2005-11-29 | Paper |
| On model checking data-independent systems with arrays without reset | 2005-04-15 | Paper |
| Responsiveness of interoperating components | 2005-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942029 | 2000-03-19 | Paper |
| The timed failures -- Stability model for CSP | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373426 | 1998-01-21 | Paper |
| Fixed points without completeness | 1997-02-28 | Paper |
| Unbounded Non-determinism in CSP | 1994-11-29 | Paper |
| An Alternative Order for the Failures Model | 1993-06-29 | Paper |
| Concepts of digital topology | 1993-04-01 | Paper |
| Acyclic monotone normality | 1993-04-01 | Paper |
| A lattice of conditions on topological spaces II | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975026 | 1992-06-26 | Paper |
| Star covering properties | 1992-06-25 | Paper |
| Deadlock analysis in networks of communicating processes | 1991-01-01 | Paper |
| A timed model for communicating sequential processes | 1988-01-01 | Paper |
| The laws of Occam programming | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787461 | 1988-01-01 | Paper |
| The Decomposition of a Rectangle into Rectangles of Minimal Perimeter | 1988-01-01 | Paper |
| Laws of programming | 1987-01-01 | Paper |
| The pursuit of deadlock freedom | 1987-01-01 | Paper |
| Corrigenda: laws of programming | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725534 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680258 | 1985-01-01 | Paper |
| A Lattice of Conditions on Topological Spaces | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700823 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680259 | 1985-01-01 | Paper |
| Characterizations of Simply-Connected Finite Polyhedra in 3-Space | 1985-01-01 | Paper |
| A theory of binary digital pictures | 1985-01-01 | Paper |
| Continuous analogs of axiomatized digital surfaces | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3726974 | 1985-01-01 | Paper |
| A Theory of Communicating Sequential Processes | 1984-01-01 | Paper |
| Criteria for Metrisability | 1984-01-01 | Paper |
