For the most recent entries see the Petri Nets Newsletter.

Subclasses of Minmal Based Object Nets with Decidable Reachability Problem.

Dietze, R.; Kudlek, M.

In: 06: Bericht 267, Tagungsband des 13. Workshops Algorithmen und Werkzeuge für Petri-Netze, AWPN'06, FBI-HH-B-267, pages 32-36. September 06.

Abstract: It is shown that subclasses of minimal based object nets (MOBs), analogous to monotonous and context-free string grammars, have a decidable reachability problem.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography