scientific article
From MaRDI portal
Publication:3820016
zbMath0667.68070MaRDI QIDQ3820016
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petri netsdecidability of reachabilityPetri net languagemarked Petri netperfect marked graph-transition sequencesprecovering graphs
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Petri net algorithms in the theory of matrix grammars ⋮ The complexity of problems involving structurally bounded and conservative Petri nets
