Jos C. M. Baeten

Learn More
We describe an axiom system ACP p 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 implies that some of the axioms have to be relaxed and that ACP can be recovered as a special case from it. The purpose of ACP p is to serve as a specification(More)
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 on relative timing and on absolute timing. Both approaches are integrated using parametric timing. The time free ACP theory is embedded in the discrete time(More)
This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The author gives his personal views on these matters. He also considers(More)
ion, 13<lb>in object-oriented design, 144 in process algebra, 49, 51, 144 abstraction operator<lb>on labeled, ordinary P/T nets, 165, 169<lb>in process algebra, 40, 49, 148, 150–152ion operator<lb>on labeled, ordinary P/T nets, 165, 169<lb>in process algebra, 40, 49, 148, 150–152 in process algebra with multi-actions,<lb>71, 72 ACP, 33<lb>action, 5, 6, 18,(More)
We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisim-ulation is a congruence for all the operators that can be deened within the path format. To show that this format is useful we provided many examples that we took from the literature about CCS, CSP, and ACP; they(More)
A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system of guarded recursion equations in Basic Process .$dgebrzd. Hence, to each CFG, aprocess can be assigned absolution, which has as its set of finite traces the context-free language (CFL)determined by that CFG. Although theequality problem for CFLs is(More)
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 Principle (AIP) and the Recursive Definition & Specification Principles (RDP&RSP). We use this model to prove that in ACP, (but not in ACP!) each computably(More)
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 composition may proceed conditionally, dependent on the presence of a signal in the process in parallel. This allows a natural treatment of signal observation.