Finite representations of CCS and TCSP programs by automata and Petri nets (Q1187659)

The book provides a bridge between automata-based models (as Petri nets) and algebraic models (as CCS or TCSP) of concurrency phenomenon. It is an important step towards building an unified and universal model. In Chapter 1 the syntax and interleaving semantics of an abstract programming language is introduced, Chapter 2 proves that the subsets of this language which correspond to CCS and TCSP are Turing powerful. Chapter 3 gives a syntax-driven construction for abstract programs which leads to transition systems. Chapter 4 transfers this construction to safe Petri nets while modelling the concurrency explicitly. The transitions of a petri nets are natural generalizations of the transitions of a transition system. In Chapter 5 a representation of CCS programs (without renaming and restriction) as finite but not necessarily safe Petri nets is discussed. Chapter 6 (the last) gives a syntax-driven construction which leads to predicate/transition nets.