PETRI NETS AND STEP TRANSITION SYSTEMS
From MaRDI portal
Publication:4032923
DOI10.1142/S0129054192000231zbMath0774.68086OpenAlexW1978994556MaRDI QIDQ4032923
Publication date: 16 May 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054192000231
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
The synthesis of Petri nets from path-automatic specifications ⋮ Clustering for Petri nets ⋮ Tissue Systems and Petri Net Synthesis ⋮ Stratified petri nets ⋮ Synthesis of Petri Nets with Whole-Place Operations and Localities ⋮ The synthesis problem of Petri nets ⋮ Trace nets and process automata ⋮ The synthesis problem for elementary net systems is NP-complete ⋮ Synthesis of nets with inhibitor arcs ⋮ Projection approaches to process mining using region-based techniques ⋮ Comparing transition systems with independence and asynchronous transition systems ⋮ On the Synthesis of Zero-Safe Nets ⋮ A Symbolic Algorithm for the Synthesis of Bounded Petri Nets ⋮ An event structure semantics for general Petri nets ⋮ Process versus unfolding semantics for Place/Transition Petri nets ⋮ Petri nets and bisimulation ⋮ Formal Relationships Between Geometrical and Classical Models for Concurrency ⋮ On the Petri net realization of context-free graphs ⋮ Regions of Petri nets with a/sync connections ⋮ Applying regions ⋮ Pomset Languages of Finite Step Transition Systems ⋮ Synthesis of Nets with Step Firing Policies ⋮ Process discovery and Petri nets ⋮ Synthesising elementary net systems with localities ⋮ Functorial models for Petri nets
