scientific article

zbMath0633.68055MaRDI QIDQ3771633

Eike Best

Publication date: 1987

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

zbMATH Keywords

Petri netplace/transition netsfree choice nets

Mathematics Subject Classification ID

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

Related Items (17)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems ⋮ PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Toward uniform random generation in 1-safe Petri nets ⋮ Unnamed Item ⋮ On liveness and controlled siphons in Petri nets ⋮ An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Structure theory of equal conflict systems ⋮ A polynomial-time algorithm to decide liveness of bounded free choice nets ⋮ Symmetric and Asymmetric Asynchronous Interaction ⋮ A note on regular Petri nets ⋮ On Synchronous and Asynchronous Interaction in Distributed Systems ⋮ Extensible structural analysis of Petri net product lines ⋮ A Theory of Distributed Markov Chains ⋮ A causal semantic for time Petri nets ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized

This page was built for publication: