Elements of Distributed Algorithms
Modeling and Analysis with Petri Nets
Published on 20. August 1998
Book
Hardback
XII, 302 pages
978-3-540-62752-4 (ISBN)
Description
Distributed algorithms, essential to networks of all kinds, are presented using the highly intuitive and technically elegant Petri net technique in this text for students and practitioners. A variety of distributed algorithms are presented, and proven correct using temporal logic.
More details
Edition
1998 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Professional/practitioner
Illustrations
XII, 302 p.
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 23 mm
Weight
653 gr
ISBN-13
978-3-540-62752-4 (9783540627524)
DOI
10.1007/978-3-662-03687-7
Schweitzer Classification
Other editions
Additional editions
E-Book
04/2013
Springer
€39.58
Available for download
Book
12/2010
Springer
€42.75
Shipment within 7-9 days
Content
I. Elementary Concepts.- II. Case Studies.- III. Advanced Concepts.- IV. Case Studies.- V. Case Studies Continued: Acknowledged Messages.- VI. Case Studies Continued: Network Algorithms.- VII. State Properties of Elementary System Nets.- VIII. Interleaved Progress of Elementary System Nets.- IX. Concurrent Progress of Elementary System Nets.- X. State Properties of System Nets.- XI. Interleaved Progress of System Nets.- XII. Concurrent Progress of System Nets.- XIII. Formal Analysis of Case Studies.- References.