| Publication | Date of Publication | Type |
|---|
| Pushdown automata and context-free grammars in bisimulation semantics | 2023-12-08 | Paper |
Bounded stacks, bags and queues
CONCUR '97: Concurrency Theory | 2023-05-17 | 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 |
Discrete time process algebra with abstraction
Fundamentals of Computation Theory | 2022-12-09 | Paper |
| CONCUR Test-of-time award 2020 announcement | 2022-07-18 | Paper |
| Sequential composition in the presence of intermediate termination (extended abstract) | 2021-12-08 | Paper |
Sequential composition in the presence of intermediate termination (extended abstract)
(available as arXiv preprint) | 2021-12-08 | Paper |
| scientific article; zbMATH DE number 7315073 (Why is no real title available?) | 2021-02-24 | Paper |
| scientific article; zbMATH DE number 7015117 (Why is no real title available?) | 2019-02-07 | Paper |
Expressiveness modulo bisimilarity of regular expressions with parallel composition
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
A Generic Process Algebra
Electronic Notes in Theoretical Computer Science | 2015-07-10 | Paper |
A basic parallel process as a parallel pushdown automaton
Electronic Notes in Theoretical Computer Science | 2014-07-23 | Paper |
Model-based engineering of embedded systems using the hybrid process algebra Chi
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
Reactive Turing machines
Information and Computation | 2014-01-16 | Paper |
Embedding untimed into timed process algebra; the case for explicit termination
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
Reconciling real and stochastic time: the need for probabilistic refinement
Formal Aspects of Computing | 2013-03-22 | Paper |
Turing Meets Milner
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Reactive Turing machines
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Unguardedness mostly means many solutions
Theoretical Computer Science | 2011-07-07 | Paper |
| Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra. | 2010-02-05 | Paper |
A process-theoretic look at automata
Fundamentals of Software Engineering | 2010-01-28 | Paper |
A characterization of regular expressions under bisimulation
Journal of the ACM | 2008-12-21 | Paper |
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science | 2008-12-10 | Paper |
A Context-Free Process as a Pushdown Automaton
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Calculating with Automata
Concurrency, Graphs and Models | 2008-06-19 | Paper |
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Duplication of constants in process algebra
The Journal of Logic and Algebraic Programming | 2007-02-09 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Formal Methods for the Design of Real-Time Systems
Lecture Notes in Computer Science | 2006-10-19 | 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 |
A brief history of process algebra
Theoretical Computer Science | 2005-06-10 | Paper |
Axiomatizing GSOS with termination
The Journal of Logic and Algebraic Programming | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2086418 (Why is no real title available?) | 2004-08-11 | Paper |
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science | 2004-03-30 | Paper |
| Partial-order process algebra (and its relation to Petri nets) | 2003-10-20 | Paper |
Process algebra with timing
Monographs in Theoretical Computer Science. An EATCS Series | 2002-11-17 | Paper |
Real time process algebra with time-dependent conditions
The Journal of Logic and Algebraic Programming | 2002-09-11 | Paper |
| scientific article; zbMATH DE number 1728523 (Why is no real title available?) | 2002-04-15 | Paper |
| Process algebra with timing: Real time and discrete time | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1701760 (Why is no real title available?) | 2002-02-05 | Paper |
| scientific article; zbMATH DE number 1536546 (Why is no real title available?) | 2000-11-28 | Paper |
On sequential composition, action prefixes and process prefix
Formal Aspects of Computing | 2000-08-14 | Paper |
Real space process algebra
Formal Aspects of Computing | 2000-08-02 | Paper |
| scientific article; zbMATH DE number 1231679 (Why is no real title available?) | 1999-01-07 | Paper |
Process algebra with propositional signals
Theoretical Computer Science | 1998-07-23 | Paper |
Discrete time process algebra
Formal Aspects of Computing | 1996-06-02 | Paper |
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation | 1996-01-22 | Paper |
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM | 1993-12-09 | Paper |
| scientific article; zbMATH DE number 139606 (Why is no real title available?) | 1993-03-28 | Paper |
An algebra for process creation
Acta Informatica | 1993-02-22 | Paper |
| Process Algebra | 1993-01-23 | Paper |
| scientific article; zbMATH DE number 64019 (Why is no real title available?) | 1992-09-27 | Paper |
Real time process algebra
Formal Aspects of Computing | 1991-01-01 | Paper |
Recursive process definitions with the state operator
Theoretical Computer Science | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4117829 (Why is no real title available?) | 1989-01-01 | Paper |
Term-rewriting systems with rule priorities
Theoretical Computer Science | 1989-01-01 | Paper |
Global renaming operators in concrete process algebra
Information and Computation | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4092824 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4037177 (Why is no real title available?) | 1987-01-01 | Paper |
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4011914 (Why is no real title available?) | 1987-01-01 | Paper |
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
The Computer Journal | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4035115 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4074466 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4001464 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3966060 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3895052 (Why is no real title available?) | 1984-01-01 | Paper |
