Ebook: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies

With 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.

---

With 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.

---

With 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.

Content:
Front Matter....Pages I-XXVII
Front Matter....Pages 1-1
An Example....Pages 3-12
The Basic Concepts....Pages 13-24
Common Special Case: Elementary System Nets....Pages 25-33
Sequential and Distributed Runs....Pages 35-49
Scenarios....Pages 51-56
Further Notations for Elementary System Nets....Pages 57-63
The Synthesis Problem....Pages 65-73
Composition of Nets....Pages 75-80
Front Matter....Pages 81-82
State Properties....Pages 83-96
Traps and Cotraps of Elementary System Nets....Pages 97-101
Place Invariants of Elementary System Nets....Pages 103-109
Combining Traps and Place Invariants of Elementary System Nets....Pages 111-117
Traps and Place Invariants of Generic System Nets....Pages 119-129
Marking and Covering Graphs....Pages 131-139
Reachability in Elementary System Nets....Pages 141-145
Run Properties....Pages 147-156
Free-Choice Nets....Pages 157-161
Marked Graphs....Pages 163-167
Well-Formed System Nets....Pages 169-172
Front Matter....Pages 173-173
Mutual Exclusion....Pages 175-184
Front Matter....Pages 173-173
Asynchronous Hardware....Pages 185-191
Network Algorithms....Pages 193-204
Front Matter....Pages 205-205
Closing Remarks....Pages 207-211
Back Matter....Pages 213-230

---

With 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.

Content:
Front Matter....Pages I-XXVII
Front Matter....Pages 1-1
An Example....Pages 3-12
The Basic Concepts....Pages 13-24
Common Special Case: Elementary System Nets....Pages 25-33
Sequential and Distributed Runs....Pages 35-49
Scenarios....Pages 51-56
Further Notations for Elementary System Nets....Pages 57-63
The Synthesis Problem....Pages 65-73
Composition of Nets....Pages 75-80
Front Matter....Pages 81-82
State Properties....Pages 83-96
Traps and Cotraps of Elementary System Nets....Pages 97-101
Place Invariants of Elementary System Nets....Pages 103-109
Combining Traps and Place Invariants of Elementary System Nets....Pages 111-117
Traps and Place Invariants of Generic System Nets....Pages 119-129
Marking and Covering Graphs....Pages 131-139
Reachability in Elementary System Nets....Pages 141-145
Run Properties....Pages 147-156
Free-Choice Nets....Pages 157-161
Marked Graphs....Pages 163-167
Well-Formed System Nets....Pages 169-172
Front Matter....Pages 173-173
Mutual Exclusion....Pages 175-184
Front Matter....Pages 173-173
Asynchronous Hardware....Pages 185-191
Network Algorithms....Pages 193-204
Front Matter....Pages 205-205
Closing Remarks....Pages 207-211
Back Matter....Pages 213-230
....