000 | 04688nam a22004815i 4500 | ||
---|---|---|---|
001 | 978-3-642-33278-4 | ||
003 | DE-He213 | ||
005 | 20200421112544.0 | ||
007 | cr nn 008mamaa | ||
008 | 130703s2013 gw | s |||| 0|eng d | ||
020 |
_a9783642332784 _9978-3-642-33278-4 |
||
024 | 7 |
_a10.1007/978-3-642-33278-4 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
100 | 1 |
_aReisig, Wolfgang. _eauthor. |
|
245 | 1 | 0 |
_aUnderstanding Petri Nets _h[electronic resource] : _bModeling Techniques, Analysis Methods, Case Studies / _cby Wolfgang Reisig. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
300 |
_aXXVII, 230 p. 145 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _aPart I Modeling Techniques -- Chap. 1 An Example -- Chap. 2 The Basic Concepts -- Chap. 3 Common Special Case: Elementary System Nets -- Chap. 4 Sequential and Distributed Runs -- Chap. 5 Scenarios -- Chap. 6 Further Notation for Elementary System Nets -- Chap. 7 The Synthesis Problem -- Chap. 8 Composition of Nets -- Part II Analysis Methods -- Chap. 9 State Properties -- Chap. 10 Traps and Co-traps of Elementary System Nets -- Chap. 11 Place Invariants of Elementary System Nets -- Chap. 12 Combining Traps and Place Invariants of Elementary System Nets -- Chap. 13 Traps and Place Invariants of Generic System Nets -- Chap. 14 Marking and Covering Graphs -- Chap. 15 Reachability in Elementary System Nets -- Chap. 16 Run Properties -- Chap. 17 Free-Choice Nets -- Chap. 18 Marked Graphs -- Chap. 19 Well-Formed System Nets -- Part III Case Studies -- Chap. 20 Mutual Exclusion -- Chap. 21 Asynchronous Hardware. | |
520 | _aWith their intuitive graphical approach and expressive analysis techniques, Petri nets are suitable for a wide range of applications and teaching scenarios, and they have gained wide acceptance as a modeling technique in areas such as software design and control engineering. The core theoretical principles have been studied for many decades and there is now a comprehensive research literature that complements the extensive implementation experience. In this book the author presents a clear, thorough introduction to the essentials of Petri nets. He explains the core modeling techniques and analysis methods and he illustrates their usefulness with examples and case studies. Part I describes how to use Petri nets for modeling; all concepts are explained with the help of examples, starting with a generic, powerful model which is also intuitive and realistic. Part II covers the essential analysis methods that are specific to Petri nets, introducing techniques used to formulate key properties of system nets and algorithms for proving their validity. Part III presents case studies, each introducing new concepts, properties and analysis techniques required for very different modeling tasks. The author offers different paths among the chapters and sections: the elementary strand for readers who wish to study only elementary nets; the modeling strand for those who wish to study the modeling but not the analysis of systems; and finally the elementary models of the modeling strand for those interested in technically simple, but challenging examples and case studies. The author achieves an excellent balance between consistency, comprehensibility and correctness in a book of distinctive design. Among its characteristics, formal arguments are reduced to a minimum in the main text with many of the theoretical formalisms moved to an appendix, the explanations are supported throughout with fully integrated graphical illustrations, and each chapter ends with exercises and recommendations for further reading. The book is suitable for students of computer science and related subjects such as engineering, and for a broad range of researchers and practitioners. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputers. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aSoftware Engineering/Programming and Operating Systems. |
650 | 2 | 4 | _aComputing Methodologies. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642332777 |
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-33278-4 |
912 | _aZDB-2-SCS | ||
942 | _cEBK | ||
999 |
_c58459 _d58459 |