×

zbMATH — the first resource for mathematics

Decidability and complexity of Petri net problems. An introduction. (English) Zbl 0926.68087
Reisig, Wolfgang (ed.) et al., Lectures on Petri nets. 1: Basic models. Advances in Petri nets. Berlin: Springer. Lect. Notes Comput. Sci. 1491, 374-428 (1998).
Summary: A collection of 10 “rules of thumb” is presented that helps to determine the decidability and complexity of a large number of Petri net problems.
For the entire collection see [Zbl 0903.00072].

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Keywords:
Petri net
PDF BibTeX XML Cite