Petri Net Algebra
By: by Eike Best, Raymond Devillers, Maciej Koutny
Contributors: Devillers, Raymond; Koutny, Maciej
Series: Monographs in Theoretical Computer Science An EATCS Series; Monographs in Theoretical Computer Science An EATCS Series
Publisher: Springer Berlin Heidelberg
Published: 2001
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 380
ISBN-13: 9783642086779; 9783662044575
Subjects: Logic design; Computational complexity; Computer science; Software engineering; Algebra; Data processing
Description: This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process Algebra and Petri Nets, two prominent branches of concurrency theory. Added synergistic benefit is derived from combining their respective advantages. Petri nets are treated as composable objects, and as such they are embedded in a general process algebra. On the other hand, a generic process algebra is given an automatic Petri net semantics so that net-based verification techniques, based on structural invariants and causal partial orders, can be applied to the process algebra. Finally, the theory is applied to a realistic concurrent programming language. The book contains full proofs, carefully chosen examples and several possible directions for further research. It is self-contained and supposes only acquaintance with basic discrete mathematics. A unique aspect is that the development of the Petri net algebra is handled so as to allow for further application-oriented extensions and modifications.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.