Transition systems, event structures, and unfoldings
DOI10.1006/INCO.1995.1062zbMATH Open0826.68086OpenAlexW1994522884MaRDI QIDQ1892885FDOQ1892885
Authors: P. S. Thiagarajan, Mogens Nielsen, Grzegorz Rozenberg 
Publication date: 10 July 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6f49efb78772c04d83d500f7ce28868c3cb4eed7
Recommendations
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)
Cited In (14)
- Relating conflict-free stable transition and event models via redex families
- Comparing transition systems with independence and asynchronous transition systems
- Folk Theorems on the Correspondence between State-Based and Event-Based Systems
- Attributed transition systems with hidden transitions
- Configuration- and residual-based transition systems for event structures with asymmetric conflict
- Analysis of the structure of attributed transition systems without hidden transitions
- Title not available (Why is that?)
- From event-oriented models to transition systems
- Elementary transition systems
- Statecharts, transition structures and transformations
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Stability of regional orthomodular posets under synchronisation and refinement
- On the origin of events: branching cells as stubborn sets
- A counterexample to Thiagarajan's conjecture on regular event structures
This page was built for publication: Transition systems, event structures, and unfoldings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892885)
