scientific article; zbMATH DE number 3850481

MaRDI QIDQ3319781zbMATH OpenFDO

Authors Hans-Dieter Burkhard

Publication date 1981

zbMATH Keywords

boundednessreachabilitycounter machinesPetri netlivenesscomputational power of Petri netsfiring of transitions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 512938
• Linear time analysis of properties of conflict-free and general Petri nets
• On the regularity of Petri net languages
• scientific article; zbMATH DE number 3843142
• Firing sequences and processes of Petri nets

Cited in

(11)

• Firing partial orders in a Petri net
• An investigation of controls for concurrent systems based on abstract control languages
• Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem
• On priority in COSY
• P systems working in maximal variants of the set derivation mode
• scientific article; zbMATH DE number 522857 (Why is no real title available?)
• Time-based expressivity of time Petri nets for system specification
• Concurrent and maximally concurrent evolution of nonsequential systems
• A heuristic algorithm FSDC based on avoidance of deadlock components in finding legal firing sequences of Petri nets
• Catalytic and communicating Petri nets are Turing complete
• scientific article; zbMATH DE number 3978396 (Why is no real title available?)

This page was built for publication:

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