Publication:3957954
From MaRDI portal
zbMath0494.68065MaRDI QIDQ3957954
Publication date: 1981
Petri net languages; infinite reachability set; Petri net coverability trees; pumping lemma for markings
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
The residue of vector sets with applications to decidability problems in Petri nets, An investigation of controls for concurrent systems based on abstract control languages