A new equivalence for processes with timing. With an application to protocol verification (2002)
Baeten, J.C.M., Middelburg, C.A., Reniers, M.A.
We propose a variant of the version of branching bisimilation equivalence for processes with discrete relative timing from Baeten, Bergstra, and Reniers. We show that this new equivalence allows for...
Real time process algebra with time-dependent conditions (2000)
Baeten, J.C.M., Middelburg, C.A.
We extend the main real time version of ACP presented in [6] with conditionals in which the condition depends on time. This extension facilitates flexible dependence of proccess behaviour on...
Process algebra with timing: Real time and discrete time (1999)
Baeten, J.C.M., Middelburg, C.A.
We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint is a new real time version with absolute timing, called ACPsat , featuring urgent...
Deadlock Behaviour in Split and ST Bisimulation Semantics (1998)
Baeten, J.C.M., Bergstra, J.A.
We investigate split and ST bisimulation semantics, in particular the deadlock behaviour of processes in these semantics. We define and axiomatise a variant of ACP, where atomic actions and...
Bounded Stacks, Bags and Queues (1997)
Baeten, J.C.M., Bergstra, J.A.
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified with these...
Process algebra with propositional signals (1997)
Bergstra, J.A., Baeten, J.C.M.
We consider processes that have transitions labeled with atomic actions, and states labeled with formulas over a propositional logic. These state labels are called signals. A process in a parallel...
Discrete time process algebra (1996)
Bergstra, J.A., Baeten, J.C.M.
The axiom system ACP of [BeK84a] was extended with real time features in [BaB91]. Here we proceed to define a discrete time extension of ACP, along the lines of ATP [NiS94]. We present versions based...
Discrete time process algebra with abstraction (1995)
Bergstra, J.A., Baeten, J.C.M.
The axiom system ACP of [BEK84a] was extended to cliscrete time in [BAB95]. Here we proceed to define the silent step in this theory in branching bisimulation semantics [GLW91, BAW90] rather than...
Process Algebra with Propositional Signals (1994)
Baeten, J.C.M., Bergstra, J.A.
We consider processes that have transitions labeled with atomic actions, and states labeled with formulas over a propositional logic. These state labels are called signals. A process in a parallel...
On sequential composition, action prefixes and process prefix (1994)
Bergstra, J.A., Baeten, J.C.M.
We illustrate the difference between sequential composition in process algebra axiomatisations like ACP and action prefixing in process calculi like CCS. We define both early and late input in a...
Process algebra with partial choice (1994)
Bergstra, J.A., Baeten, J.C.M.
The objective of this paper is to bridge the gap between ACP and TCSP. To this end, ACP is extended with two non-deterministic choice operators in a setting of bisimulation semantics. With these...
Decidability of bisimulation equivalence for processes generating context-free languages (1993)
Bergstra, J.A., Baeten, J.C.M., Klop, J.W.
A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system of guarded recursion equations in Basic Process algebra. Hence, to each CFG, aprocess can be...
Real space process algebra (1993)
Bergstra, J.A., Baeten, J.C.M.
The real time process algebra of Baeten and Bergstra [Formal Aspects of Computing, 3, 142-188 (1991)] is extended to real space by requiring the presence of spatial coordinates for each atomic...
Non interleaving process algebra (1993)
Baeten, J.C.M., Bergstra, J.A.
We study a non interleaving subalgebra of a reduct of a model of ACP. The model discussed uses step bisimulation semantics. We can derive identities in this model with the help of the (interleaving)...
Asynchronous communication in real space process algebra (1992)
Bergstra, J.A., Baeten, J.C.M.
A version of classical real space process algebra is given in which messages travel with constant speed through a three-dimensional medium. It follows that communication is asynchronous and has a...
Real-time process algebra (1991)
Bergstra, J.A., Baeten, J.C.M.
We describe an axiom system ACPp that incorporates real timed actions. Many examples are provided in order to explain the intuitive contents of the notation. ACP p is a generalisation of ACP. This...
Recursive process definitions with the state operator (1991)
Bergstra, J.A., Baeten, J.C.M.
We investigate the defining power of finite recursive specifications over the theory with + (alternative composition) and • (sequential composition) and λ (the state operator) over a finite set of...
Design of a specification language by abstract syntax engineering (1991)
Baeten, J.C.M., Bergstra, J.A.
In this paper, we design a specification language in an entirely algebraic style. We describe the language in terms of abstract syntax only. We argue that this is the correct approach in language...
Term rewriting systems with rule priorities (1989)
Bergstra, J.A., Baeten, J.C.M., Klop, J.W., Weijland, W.P.
In this paper we discuss term-rewriting systems with rule priorities, which simply is a partial ordering on the rules. The procedural meaning of such an ordering then is, that the application of a...
On the consistency of Koomen's fair abstraction rule (1987)
Bergstra, J.A., Baeten, J.C.M., Klop, J.W.
We construct a graph model for ACP,, the algebra of communicating processes w%h silent steps, in which Koomen’s Fair Abstraction Rule (KFAR) holds, and also versions of the Approximation Induction...
Decidability of bisimulation equivalence for processes generating context-free languages (1987)
Bergstra, J.A., Baeten, J.C.M., Klop, J.W.
A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can be assigned...
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator (1987)
Baeten, J. C. M., Bergstra, J. A., Klop, J. W.
We consider a process semantics intermediate between bi-simulation semantics and readiness semantics, called here ready-trace semantics. The advantage of this semantics is that, while retaining the...