Get Free Shipping on orders over $0
Nets, Terms and Formulas : Three Views of Concurrent Processes and their Relationship - No Information Available

Nets, Terms and Formulas

Three Views of Concurrent Processes and their Relationship

By: No Information Available

Paperback | 25 August 2005

At a Glance

Paperback


RRP $89.95

$81.99

or 4 interest-free payments of $20.50 with

 or 

Ships in 5 to 7 business days

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 future research. The book is written for graduate students and researchers in computer science; the author assumes a basic understanding of mathematical terminology, predicate logic and programming, but develops the semantic concepts used in a self-contained manner. The core of the material can be used for a one-semester course on concurrent processes. The book is self-contained in the semantics used, and will be of considerable interest to researchers and graduates in computer science working in models of concurrency.
Industry Reviews
"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

More in Mathematical Theory of Computation

Discrete Mathematics for Computing : Grassroots - Peter Grossman

RRP $150.00

$129.75

13%
OFF
AI Engineering : Building Applications with Foundation Models - Chip Huyen
Nonlinear Analysis for Human Movement Variability - Aaron D. Likens

RRP $194.00

$171.75

11%
OFF
Introduction to Modern Cryptography : Revised Third Edition - Jonathan  Katz
Beading With Algorithms : Cellular Automata In Peyote Stitch - Gwen Fisher
Beading With Algorithms : Cellular Automata In Peyote Stitch - Gwen Fisher