LEADER 03620nam  22007095  450 
001 9910973788803321
005 20250731082349.0
010   $a3-662-03687-8
024 7 $a10.1007/978-3-662-03687-7
035   $a(CKB)2660000000027074
035   $a(SSID)ssj0000897357
035   $a(PQKBManifestationID)11483671
035   $a(PQKBTitleCode)TC0000897357
035   $a(PQKBWorkID)10903721
035   $a(PQKB)11496165
035   $a(DE-He213)978-3-662-03687-7
035   $a(MiAaPQ)EBC3097118
035   $a(EXLCZ)992660000000027074
100   $a20130321d1998      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aElements of Distributed Algorithms $eModeling and Analysis with Petri Nets /$fby Wolfgang Reisig
205   $a1st ed. 1998.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1998.
215   $a1 online resource (XII, 302 p.) 
300   $a"With 246 Figures"--Title page.
311 08$a3-642-08303-X 
320   $aIncludes bibliographical references.
327   $aI. 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.
330   $aDistributed 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.
606   $aComputer science
606   $aSoftware engineering
606   $aMathematical models
606   $aComputer programming
606   $aAlgorithms
606   $aTheory of Computation
606   $aSoftware Engineering
606   $aMathematical Modeling and Industrial Mathematics
606   $aProgramming Techniques
606   $aAlgorithms
615  0$aComputer science.
615  0$aSoftware engineering.
615  0$aMathematical models.
615  0$aComputer programming.
615  0$aAlgorithms.
615 14$aTheory of Computation.
615 24$aSoftware Engineering.
615 24$aMathematical Modeling and Industrial Mathematics.
615 24$aProgramming Techniques.
615 24$aAlgorithms.
676   $a004.0151
700   $aReisig$b Wolfgang$f1950-$050121
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910973788803321
996   $aElements of distributed algorithms$93921191
997   $aUNINA