Stock Photo: Cover May Be Different
Petri Net Algebra Hardcover - 2001 - 1st Edition
by Best, Eike
- Used
- Good
- Hardcover
Drop Ship Order
Description
NZ$98.54
FREE Shipping to USA
Standard delivery: 7 to 14 days
More Shipping Options
Ships from Bonita (California, United States)
Details
- Title Petri Net Algebra
- Author Best, Eike
- Binding Hardcover
- Edition number 1st
- Edition 1
- Condition Used - Good
- Pages 378
- Volumes 1
- Language ENG
- Publisher Springer
- Date 2001-01-26
- Bookseller's Inventory # 3540673989.G
- ISBN 9783540673989 / 3540673989
- Weight 1.54 lbs (0.70 kg)
- Dimensions 9.53 x 6.43 x 1.05 in (24.21 x 16.33 x 2.67 cm)
- Library of Congress Catalog Number 2001017045
- Dewey Decimal Code 004.015
About Bonita California, United States
Biblio member since 2020
First line
Computing Science is about building systems.
From the rear cover
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.
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.