Induction is a pervasive tool in computer science and mathematics for defining objects and
reasoning on them. Coinduction is the dual of induction and as such it brings in quite …

This paper studies semantic equivalences and preorders for sequential systems with silent
moves, restricting attention to the ones that abstract from successful termination, stochastic …

Progress, Justness, and Fairness Page 1 69 Progress, Justness, and Fairness ROB VAN
GLABBEEK and PETER HÖFNER, Data61, CSIRO and UNSW, Australia Fairness assumptions …

Automated and semi-automated manipulation of so-called labelled transition systems has
become an important means in discovering flaws in software and hardware systems …

Process algebra is a widely accepted and much used technique in the specification and
verification of parallel and distributed software systems. This book sets the standard for the …

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 …

Finite state automata, with non-determinism and silent transitions, can be interpreted not as
subsets of the free monoid as in classical automata theory, but as congruence classes under …

Renaming operators are introduced in concrete process algebra (concrete means that
abstraction and silent moves are not considered). Examples of renaming operators are …

This book is concerned with a number of theories that can be used for describ ing and
analyzing systems of interacting components in case it is desirable or necessary to regard …

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 …