Decidability problems of a basic class of object nets

MaRDI QIDQ5422278zbMATH OpenFDO

Authors Roxana Dietze, Manfred Kudlek, Olaf Kummer

Publication date 17 October 2007

zbMATH Keywords

Dickson's lemmaKarp Miller algorithmmultiset rewritingobject Petri nets

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The reachability problem for object nets
• Applications and Theory of Petri Nets 2004
• A survey of decidability results for elementary object systems
• Conservative elementary object systems
• scientific article; zbMATH DE number 1405652

Cited in

(6)

• Declarative operations on nets
• Boundedness of adaptive nets is decidable
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 4115984 (Why is no real title available?)
• Decidability and complexity of Petri nets with unordered data
• Applications and Theory of Petri Nets 2004

This page was built for publication: Decidability problems of a basic class of object nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422278)