ENGLISH

Petri Net Algebra

By Eike Best , Raymond Devillers , Maciej Koutny

Book information

Publisher
Springer
Year
2001
ISBN
978-3-642-08677-9, 978-3-662-04457-5
DOI
10.1007/978-3-662-04457-5
Language
english
Format
PDF
Filesize
11 MB (11194364 bytes)
Series
Monographs in Theoretical Computer Science. An EATCS Series
Pages
388\388
Orientation
portrait
Paginated
no
Scanned
no
Time added
2013-08-01 04:00:00
Logics and Meanings of Programs; Computation by Ab

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.

Similar books