Petri Net Primer A Compendium on the Core Model, Analysis, and Synthesis /
Petri nets model concurrent and distributed systems where active components communicate through the production and absorption of various kinds of resources. Although the dynamic properties of such systems may be very complex, they may sometimes be connected to the static structure of a Petri net. Ma...
Збережено в:
| Автори: | , |
|---|---|
| Співавтор: | |
| Формат: | Електронний ресурс eКнига |
| Мова: | Англійська |
| Опубліковано: |
Cham :
Springer Nature Switzerland : Imprint: Birkhäuser,
2024.
|
| Редагування: | 1st ed. 2024. |
| Серія: | Computer Science Foundations and Applied Logic,
|
| Предмети: | |
| Онлайн доступ: | https://doi.org/10.1007/978-3-031-48278-6 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Зміст:
- Preface
- 1 First Steps in Petri Nets
- 2 Languages of Petri Nets
- 3 Reachability and Coverability
- 4 Linear-algebraic Structure of Petri Nets
- 5 Graph-theoretical Structure of Petri Nets
- 6 More Structure Theory
- 7 Program Verification Using Traps
- 8 Fairness, Simulations, and Inhibitor Arcs
- 9 Unfoldings and Reachability Checking
- 10 Petri Net Computers
- 11 Synthesis of Petri Nets from Labelled Transition Systems
- 12 Persistent Transition Systems and Choice-free Petri Nets
- 13 Divide-and-Conquer Methods for Synthesis
- 14 Marked Graph Synthesis
- 15 Bounded Choice-free Net Synthesis
- 16 Model Checking Safe, Strongly Persistent Petri Nets
- 17 Semilinearity
- 18 Decidability of the reachability problem
- 19 The Box Algebra 1/2: Refinement and Recursion
- 20 The Box Algebra 2/2: Iteration and Data
- 21 High-level Petri Nets
- Biblyography
- Index.