Publication:3967058
From MaRDI portal
zbMath0501.68027MaRDI QIDQ3967058
Publication date: 1983
decomposition; boundedness; incidence matrix; liveness; reduction; applications; Petri nets; examples; rooted tree; structural properties; traps; marked graphs; deadlock; associated graph; firing sequences; reachable marking; linear algebra techniques; free-choice nets; associated language; net complexity; state-machine graphs
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture, Une nouvelle transformation des réseaux de Petri généralisés : L'abstraction généralisée, Proving nonreachability by modulo-invariants, Structure theory of equal conflict systems, Testing for unboundedness of fifo channels, A taxonomy of fairness and temporal logic problems for Petri nets, An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets, A logical approach of Petri net languages, Problems concerning fairness and temporal logic for conflict-free Petri nets, Reduction and covering of infinite reachability trees, Petri nets for modeling of dynamic systems -- a survey, Petri nets for the design and operation of manufacturing systems, Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems, Normalization of place/transition-systems preserves net behaviour
