| Publication | Date of Publication | Type |
|---|
A case in point: verification and testing of a EULYNX interface
Formal Aspects of Computing | 2024-09-25 | Paper |
On the axiomatisation of branching bisimulation congruence over CCS
| 2024-08-13 | Paper |
Pushdown automata and context-free grammars in bisimulation semantics
| 2023-12-08 | Paper |
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
Logical Methods in Computer Science | 2023-03-22 | Paper |
Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
| 2023-02-03 | Paper |
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7559474 (Why is no real title available?)
| 2022-07-18 | Paper |
Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)
| 2022-03-21 | Paper |
scientific article; zbMATH DE number 7471704 (Why is no real title available?)
| 2022-02-09 | Paper |
scientific article; zbMATH DE number 7453959 (Why is no real title available?)
| 2022-01-07 | Paper |
scientific article; zbMATH DE number 7453962 (Why is no real title available?)
| 2022-01-07 | Paper |
Sequential composition in the presence of intermediate termination (extended abstract)
| 2021-12-08 | Paper |
Unique parallel decomposition for the \(\pi\)-calculus
| 2021-12-07 | Paper |
scientific article; zbMATH DE number 7407791 (Why is no real title available?)
| 2021-10-08 | Paper |
The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
| 2021-03-26 | Paper |
scientific article; zbMATH DE number 7315073 (Why is no real title available?)
| 2021-02-24 | Paper |
scientific article; zbMATH DE number 7243676 (Why is no real title available?)
| 2020-09-04 | Paper |
On the axiomatisability of priority. III: Priority strikes again
Theoretical Computer Science | 2020-08-25 | Paper |
Up-to techniques for branching bisimilarity
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Divide and congruence. III: Stability \& divergence
| 2020-05-27 | Paper |
Brzozowski goes concurrent -- a Kleene theorem for pomset languages
| 2020-05-27 | Paper |
Off-the-shelf automated analysis of liveness properties for just paths
Acta Informatica | 2020-05-26 | Paper |
Executable behaviour and the \(\pi \)-calculus (extended abstract)
| 2020-02-14 | Paper |
Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
Information and Computation | 2019-09-17 | Paper |
On series-parallel pomset languages: rationality, context-freeness and automata
Journal of Logical and Algebraic Methods in Programming | 2019-03-27 | Paper |
Evidence for Fixpoint Logic
| 2017-08-31 | Paper |
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Expressiveness modulo bisimilarity of regular expressions with parallel composition
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
On the executability of interactive computation
Pursuit of the Universal | 2016-08-17 | Paper |
Unique parallel decomposition in branching and weak bisimulation semantics
Theoretical Computer Science | 2015-12-15 | Paper |
Reflections on a Geometry of Processes
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
Reactive Turing machines
Information and Computation | 2014-01-16 | Paper |
Proof graphs for parameterised Boolean equation systems
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Turing Meets Milner
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Unique parallel decomposition in branching and weak bisimulation semantics
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Reactive Turing machines
Fundamentals of Computation Theory | 2011-08-19 | Paper |
On the axiomatizability of priority. II
Theoretical Computer Science | 2011-07-07 | Paper |
Unguardedness mostly means many solutions
Theoretical Computer Science | 2011-07-07 | Paper |
The equational theory of prebisimilarity over basic CCS with divergence
Information Processing Letters | 2010-06-09 | Paper |
A process-theoretic look at automata
Fundamentals of Software Engineering | 2010-01-28 | Paper |
Computation tree logic with deadlock detection
Logical Methods in Computer Science | 2010-01-28 | Paper |
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae | 2009-09-29 | Paper |
scientific article; zbMATH DE number 5605079 (Why is no real title available?)
| 2009-09-19 | Paper |
On finite alphabets and infinite bases
Information and Computation | 2008-05-19 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
Logical Methods in Computer Science | 2007-10-11 | Paper |
A Finite Equational Base for CCS with Left Merge and Communication Merge
Automata, Languages and Programming | 2007-09-11 | Paper |
Some Remarks on Definability of Process Graphs
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Model Checking Software
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
The Journal of Logic and Algebraic Programming | 2005-10-17 | Paper |
Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
Theoretical Computer Science | 2005-06-10 | Paper |
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science | 2005-02-22 | Paper |
Remarks on Thatte's transformation of term rewriting systems
Information and Computation | 2005-02-22 | Paper |
On the expressiveness of choice quantification
Annals of Pure and Applied Logic | 2003-05-22 | Paper |
