Partial (set) 2-structures. I: Basic notions and the representation problems
DOI10.1007/BF00264611zbMATH Open0696.68082OpenAlexW2017906621MaRDI QIDQ911307FDOQ911307
Authors: 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
Recommendations
- Partial (set) 2-structures. II: State spaces of concurrent systems
- A characterization of set representable labeled partial 2-structures through decompositions
- Characterization and complexity of uniformly nonprimitive labeled 2-structures
- Transition systems without transitions
- Theory of 2-structures. II: Representation through labeled tree families
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)
Cites Work
Cited In (44)
- k-Bounded Petri Net Synthesis from Modal Transition Systems.
- Aggregating causal runs into workflow nets
- Fault model identification and synthesis in Petri nets
- Projection approaches to process mining using region-based techniques
- Preserving correctness during business process model configuration
- Topics in region theory and synthesis problems
- The synthesis of Petri nets from path-automatic specifications
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Theory of 2-structures. II: Representation through labeled tree families
- Distinguished representatives for equivalent labelled stratified graphs and applications
- Transition systems without transitions
- On the Petri net realization of context-free graphs
- Synthesis of nets with inhibitor arcs
- Discovering directly-follows complete Petri nets from event data
- Synthesis and reengineering of persistent systems
- Discovering workflow nets using integer linear programming
- Petri Net Synthesis for Restricted Classes of Nets
- Stability of regional orthomodular posets under synchronisation and refinement
- Polynomial algorithms for the synthesis of bounded nets
- Bounded choice-free Petri net synthesis: algorithmic issues
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- A characterization of set representable labeled partial 2-structures through decompositions
- Process Model Discovery: A Method Based on Transition System Decomposition
- The Power of Prime Cycles
- Synthesis of Nets with Step Firing Policies
- Clans and regions in 2-structures
- Signal set tissue systems and overlapping localities
- Synthesis of Petri Nets with Whole-Place Operations and Localities
- Does My Service Have Partners?
- The subset relation and 2‐stratified sentences in set theory and class theory
- Some complexity results on transition systems and elementary net systems
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Stratified petri nets
- Dualities between nets and automata induced by schizophrenic objects
- Partial Order Semantics of Types of Nets
- On the Synthesis of Zero-Safe Nets
- Process Discovery Using Integer Linear Programming
- Title not available (Why is that?)
- Step semantics of Boolean nets
- Process discovery and Petri nets
- Structure of weakly 2-dependent siphons
- Tissue Systems and Petri Net Synthesis
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
This page was built for publication: Partial (set) 2-structures. I: Basic notions and the representation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911307)
