Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets
Wolfgang Reisig "Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets"
Springer | English | 1998 | ISBN: 3540627529 | 302 pages | PDF | 1,5 MB
Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control. Processor clusters, local and wide area networks, and the information highway evolved a new kind of problems which can be solved with distributed algorithms. 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.
Particular preliminary knowledge is not assumed in this text, besides basics in formal concepts and a general intuitive understanding of computer science. The text provides a basis for university courses and can help the practitioner to design distributed algorithms.
Download
Mirror
Mirror
mirror
Wolfgang Reisig "Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets"
Springer | English | 1998 | ISBN: 3540627529 | 302 pages | PDF | 1,5 MB
Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control. Processor clusters, local and wide area networks, and the information highway evolved a new kind of problems which can be solved with distributed algorithms. 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.
Particular preliminary knowledge is not assumed in this text, besides basics in formal concepts and a general intuitive understanding of computer science. The text provides a basis for university courses and can help the practitioner to design distributed algorithms.
Download
Mirror
Mirror
mirror
