P- and T-systems in the nets-within-nets-formalism

DOI10.1007/978-3-642-31131-4_20MaRDI QIDQ2908217zbMATH OpenOpenAlexFDO

Authors Frank Heitmann, Michael Köhler-Bußmeier

Publication date 4 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31131-4_20

zbMATH Keywords

reachability problemnets-within-netshigher-level net models

Mathematics Subject Classification ID

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

Recommendations

• Applications and Theory of Petri Nets 2004
• scientific article; zbMATH DE number 4043256
• Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
• scientific article; zbMATH DE number 4128407
• Reachability in cyclic extended free-choice systems

Cited in

(1)

• A survey of decidability results for elementary object systems

This page was built for publication: P- and T-systems in the nets-within-nets-formalism

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