Partial (set) 2-structures. II: State spaces of concurrent systems

DOI10.1007/BF00264612zbMATH Open0696.68083OpenAlexW2071923519MaRDI QIDQ911308FDOQ911308

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/bf00264612

Recommendations

• scientific article; zbMATH DE number 3995041
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• An algebraic framework for defining behaviours of concurrent systems. II: The axiomatic presentation
• Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
• scientific article; zbMATH DE number 650875
• Partial (set) 2-structures. I: Basic notions and the representation problems
• An algebraic theory for shared-state concurrency
• scientific article; zbMATH DE number 1490013
• scientific article; zbMATH DE number 4128366

zbMATH Keywords

Petri netsconcurrent systemselementary net systemscondition event systemstheory of 2-structures

Mathematics Subject Classification ID

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

• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• Title not available (Why is that?)
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Theory of 2-structures. II: Representation through labeled tree families
• Title not available (Why is that?)
• Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
• Petri nets: applications and relationships to other models of concurrency. Advances in Petri nets 1986, Part II. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986

Cited In (47)

• A novel method for deadlock prevention of AMS by using resource-oriented Petri nets
• A quadratic construction for Zielonka automata with acyclic communication structure
• Target-oriented Petri net synthesis
• Elementary transition systems and refinement
• Pomset Languages of Finite Step Transition Systems
• Automated synthesis of distributed controllers
• Topics in region theory and synthesis problems
• The synthesis of Petri nets from path-automatic specifications
• Identification of biological transition systems using meta-interpreted logic programs
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Regions of Petri nets with a/sync connections
• Presynthesis of bounded choice-free or fork-attribution nets
• Transition systems without transitions
• On the Petri net realization of context-free graphs
• A trace semantics for Petri Nets
• Synthesis and reengineering of persistent systems
• Applying regions
• Discovering workflow nets using integer linear programming
• The synthesis problem for elementary net systems is NP-complete
• Elementary transition systems
• Petri Net Synthesis for Restricted Classes of Nets
• An event structure semantics for general Petri nets
• Discovering Block-Structured Process Models from Incomplete Event Logs
• The synthesis problem of Petri nets
• Stability of regional orthomodular posets under synchronisation and refinement
• Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
• An algebraic model of observable properties in distributed systems
• A characterization of set representable labeled partial 2-structures through decompositions
• Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
• Synthesis of Nets with Step Firing Policies
• Clans and regions in 2-structures
• Complete edge-colored permutation graphs
• Coupling asynchrony and interrupts: Place Chart Nets
• Generation of synchronizing state machines from a transition system: a region-based approach
• Some complexity results on transition systems and elementary net systems
• Theory of 2-structures
• On the Synthesis of Zero-Safe Nets
• On Distributed Monitoring and Synthesis
• An algebraic characterisation of elementary net system (observable) state space
• Synthesising elementary net systems with localities
• Finding Complex Process-Structures by Exploiting the Token-Game
• Primitive 2-structures with the \((n-2)\)-property
• Characterisation of the state spaces of marked graph Petri nets
• On orthomodular posets generated by transition systems
• Implementable strategies for a two-player asynchronous game on Petri nets
• Strategies for minimising the synthesised ENL-systems
• Tissue Systems and Petri Net Synthesis

This page was built for publication: Partial (set) 2-structures. II: State spaces of concurrent systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911308)