×

zbMATH — the first resource for mathematics

Boundedness of reset P/T nets. (English) Zbl 0943.68122
Wiedermann, Jiří (ed.) et al., Automata, languages and programming. 26th international colloquium, ICALP ‘99. Prague, Czech Republic, July 11-15, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1644, 301-310 (1999).
Summary: P/T nets with reset and transfer arcs can be seen as counter-machines with some restricted set of operations. Surprisingly, several problems related to boundedness are harder for Reset nets than for the more expressive Transfer nets. Our main result is that boundedness is undecidable for nets with three reset arcs, while it is decidable for nets with two resetable places.
For the entire collection see [Zbl 0917.00014].

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