Partial (set) 2-structures. I: Basic notions and the representation problems
From MaRDI portal
Publication:911307
DOI10.1007/BF00264611zbMath0696.68082OpenAlexW2017906621MaRDI QIDQ911307
Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00264611
Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Related Items (39)
Clans and regions in 2-structures ⋮ The synthesis of Petri nets from path-automatic specifications ⋮ Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Tissue Systems and Petri Net Synthesis ⋮ Step semantics of Boolean nets ⋮ Some complexity results on transition systems and elementary net systems ⋮ Stratified petri nets ⋮ Dualities between nets and automata induced by schizophrenic objects ⋮ Discovering workflow nets using integer linear programming ⋮ Synthesis of Petri Nets with Whole-Place Operations and Localities ⋮ Polynomial algorithms for the synthesis of bounded nets ⋮ Signal set tissue systems and overlapping localities ⋮ Synthesis of nets with inhibitor arcs ⋮ Projection approaches to process mining using region-based techniques ⋮ On the Synthesis of Zero-Safe Nets ⋮ A Symbolic Algorithm for the Synthesis of Bounded Petri Nets ⋮ Process Discovery Using Integer Linear Programming ⋮ Discovering directly-follows complete Petri nets from event data ⋮ Partial (set) 2-structures. II: State spaces of concurrent systems ⋮ A characterization of set representable labeled partial 2-structures through decompositions ⋮ Aggregating Causal Runs into Workflow Nets ⋮ Process Model Discovery: A Method Based on Transition System Decomposition ⋮ Synthesis and reengineering of persistent systems ⋮ Preserving correctness during business process model configuration ⋮ On the Petri net realization of context-free graphs ⋮ Transition systems without transitions ⋮ Partial Order Semantics of Types of Nets ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Stability of regional orthomodular posets under synchronisation and refinement ⋮ Does My Service Have Partners? ⋮ The Power of Prime Cycles ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ Synthesis of Nets with Step Firing Policies ⋮ Process discovery and Petri nets ⋮ k-Bounded Petri Net Synthesis from Modal Transition Systems. ⋮ Structure of weakly 2-dependent siphons ⋮ Fault model identification and synthesis in Petri nets ⋮ Topics in region theory and synthesis problems ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized
Cites Work
This page was built for publication: Partial (set) 2-structures. I: Basic notions and the representation problems
