scientific article

zbMath0535.68029MaRDI QIDQ3319781

Hans-Dieter Burkhard

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

boundednessreachabilitylivenessPetri netcounter machinescomputational 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)

Related Items (7)

Concurrent and maximally concurrent evolution of nonsequential systems ⋮ 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 ⋮ Catalytic and communicating Petri nets are Turing complete ⋮ Time-based expressivity of time Petri nets for system specification ⋮ An investigation of controls for concurrent systems based on abstract control languages

This page was built for publication: