scientific article; zbMATH DE number 3850481

zbMATH Open0535.68029MaRDI QIDQ3319781FDOQ3319781

Authors: Hans-Dieter Burkhard 

Publication date: 1981

Title of this publication is not available (Why is that?)

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

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)

Cited In (11)

• Firing partial orders in a Petri net
• Time-based expressivity of time Petri nets for system specification
• A heuristic algorithm FSDC based on avoidance of deadlock components in finding legal firing sequences of Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Catalytic and communicating Petri nets are Turing complete
• On priority in COSY
• 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
• Concurrent and maximally concurrent evolution of nonsequential systems
• P systems working in maximal variants of the set derivation mode

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)