Nets, Terms and Formulas
Three Views of Concurrent Processes and their Relationship

The author presents a theory whereby nets, terms and formulas represent concurrent processes at three levels of abstraction.

E. -R. Olderog (Author)

9780521018456, Cambridge University Press

Paperback, published 22 August 2005

280 pages
24.5 x 17 x 1.5 cm, 0.446 kg

"The unique feature of this book is that it unifies different views of concurrency rather than adding another view. The author does so in a clear and convincing fashion....requires the reader to be fluent in such mathematical concepts as sets, relations, functions, and predicate logic, and to be familiar with the basic concepts of automata and regular languages. Readers who enjoy the mathematical maturity will find the book excellent: it is carefully written, and the material is presented in a well-chosen order and at the right level of detail. The author must be a good teacher." Martin Rem, Computing Reviews

The author presents a theory of concurrent processes where three different semantic description methods that are usually studied in isolation are brought together. Petri nets describe processes as concurrent and interacting machines; algebraic process terms describe processes as abstract concurrent processes; and logical formulas specify the intended communication behaviour of processes. At the heart of this theory are two sets of transformation rules for the top-down design of concurrent processes. The first set can be used to transform stepwise logical formulas into process terms, whilst process terms can be transformed into Petri nets by the second set. These rules are based on novel techniques for the operational and denotational semantics of concurrent processes. Various results and relationships between nets, terms and formulas starting with formulas and illustrated by examples. The use of transformations is demonstrated in a series of case studies, and the author also identifies directions for research.

1. Introduction
2. Petri nets
3. Process terms
4. Logical formulas
5. Process construction
6. Extensions
References.

Subject Areas: Parallel processing [UYFP], Mathematical theory of computation [UYA]