Petri Net Algebra: Monographs in Theoretical Computer Science. An EATCS Series
Autor Eike Best, Raymond Devillers, Maciej Koutnyen Limba Engleză Paperback – dec 2010
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 899.03 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – dec 2010 | 899.03 lei 6-8 săpt. | |
Hardback (1) | 903.84 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 26 ian 2001 | 903.84 lei 6-8 săpt. |
Din seria Monographs in Theoretical Computer Science. An EATCS Series
- 20% Preț: 632.50 lei
- 20% Preț: 624.06 lei
- 20% Preț: 317.46 lei
- 20% Preț: 609.53 lei
- 20% Preț: 611.88 lei
- 20% Preț: 320.60 lei
- 20% Preț: 896.93 lei
- 20% Preț: 583.40 lei
- 20% Preț: 510.62 lei
- 20% Preț: 614.04 lei
- 20% Preț: 624.19 lei
- 20% Preț: 612.68 lei
- 20% Preț: 1381.43 lei
- 20% Preț: 627.95 lei
- 20% Preț: 312.29 lei
- 20% Preț: 327.37 lei
- 20% Preț: 730.44 lei
- 20% Preț: 782.92 lei
- 20% Preț: 961.81 lei
- 20% Preț: 941.66 lei
- 15% Preț: 610.80 lei
- 20% Preț: 609.36 lei
- 20% Preț: 940.86 lei
- 20% Preț: 609.22 lei
- 20% Preț: 612.50 lei
- 20% Preț: 611.08 lei
- 20% Preț: 603.13 lei
- 20% Preț: 511.90 lei
- 20% Preț: 605.80 lei
Preț: 899.03 lei
Preț vechi: 1096.38 lei
-18% Nou
Puncte Express: 1349
Preț estimativ în valută:
172.12€ • 186.48$ • 143.73£
172.12€ • 186.48$ • 143.73£
Carte tipărită la comandă
Livrare economică 12-26 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642086779
ISBN-10: 3642086772
Pagini: 396
Ilustrații: XI, 378 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.55 kg
Ediția:Softcover reprint of hardcover 1st ed. 2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642086772
Pagini: 396
Ilustrații: XI, 378 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.55 kg
Ediția:Softcover reprint of hardcover 1st ed. 2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
1. Introduction.- 2. The Petri Box Calculus.- 3. Syntax and Operational Semantics.- 4. Petri Net Semantics.- 5. Adding Recursion.- 6. S-invariants.- 7. The Box Algebra.- 8. PBC and Other Process Algebras.- 9. A Concurrent Programming Language.- 10. Conclusion.- Appendix: Solutions of Selected Exercises.- References.
Recenzii
From the reviews:
"The monograph presents a step-by step development of rigorous framework for the specification and verification of concurrent systems. … The book contains full proofs, carefully chosen examples and several possible directions for further research. The development of the Petri net algebra is handled in such a way that it allows for further application-oriented extensions and modifications. The book is self-contained in the sense that no previous knowledge of Petri nets and process algebras is required." (Ryszard Janicki, Mathematical Reviews, Issue 2003 g)
"This monograph combines two theories of concurrency: process algebras and Petri nets. … The book can serve researches and practitioners working in concurrency theory or in formalization of parallel and distributed systems. It can also be used in an advanced graduate course as a textbook or as a reference. The book contains numerous examples and exercises included in the text immediately following the relevant material. … it is well organized and coherent both in structure and content." (Boleslaw Mikolajczak, SIGACT News, Vol. 33 (2), 2002)
"The monograph presents a step-by step development of rigorous framework for the specification and verification of concurrent systems. … The book contains full proofs, carefully chosen examples and several possible directions for further research. The development of the Petri net algebra is handled in such a way that it allows for further application-oriented extensions and modifications. The book is self-contained in the sense that no previous knowledge of Petri nets and process algebras is required." (Ryszard Janicki, Mathematical Reviews, Issue 2003 g)
"This monograph combines two theories of concurrency: process algebras and Petri nets. … The book can serve researches and practitioners working in concurrency theory or in formalization of parallel and distributed systems. It can also be used in an advanced graduate course as a textbook or as a reference. The book contains numerous examples and exercises included in the text immediately following the relevant material. … it is well organized and coherent both in structure and content." (Boleslaw Mikolajczak, SIGACT News, Vol. 33 (2), 2002)
Textul de pe ultima copertă
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.
Caracteristici
A study of the relationship between Petri nets and process algebras A detailed development of a formal model combining these two approaches Self-contained and with full proofs and carefully chosen examples Includes supplementary material: sn.pub/extras