Overview
- Distributed Computing is becoming more and more important for the application and organization of computing systems
- This book uses a Petri net and temporal logic approach to present a variety of distributed algorithms and prove their correctness in the simplest possible way
- The author is one of the world's leading authorities on Petri nets
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (14 chapters)
-
Introduction
-
Elementary System Models
-
Advanced System Models
-
Analysis of Elementary System Models
-
Analysis of Advanced System Models
Keywords
About this book
In this textbook a variety of distributed algorithms are presented independently of particular programming languages or hardware, using the graphically suggestive technique of Petri nets which is both easy to comprehend intuitively and formally rigorous. By means of temporal logic the author provides surprisingly simple yet powerful correctness proofs for the algorithms.
The scope of the book ranges from distributed control and synchronization of two sites up to algorithms on any kind of networks. Numerous examples show that description and analysis of distributed algorithms in this framework are intuitive and technically transparent.
Authors and Affiliations
Bibliographic Information
Book Title: Elements of Distributed Algorithms
Book Subtitle: Modeling and Analysis with Petri Nets
Authors: Wolfgang Reisig
DOI: https://doi.org/10.1007/978-3-662-03687-7
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1998
Hardcover ISBN: 978-3-540-62752-4Published: 20 August 1998
Softcover ISBN: 978-3-642-08303-7Published: 09 December 2010
eBook ISBN: 978-3-662-03687-7Published: 17 April 2013
Edition Number: 1
Number of Pages: XII, 302
Topics: Theory of Computation, Software Engineering/Programming and Operating Systems, Mathematical Modeling and Industrial Mathematics, Software Engineering, Programming Techniques, Algorithm Analysis and Problem Complexity