Transition systems from event structures revisited
From MaRDI portal
Publication:293333
DOI10.1016/S0020-0190(98)00105-7zbMATH Open1339.68190MaRDI QIDQ293333FDOQ293333
Authors: Markus Roggenbach, Mila Majster-Cederbaum 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001057?np=y
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Bisimulation from open maps
- Title not available (Why is that?)
- Title not available (Why is that?)
- A final coalgebra theorem
- A calculus of communicating systems
- The connection between an event structure semantics and an operational semantics for TCSP
- Towards a unified view of bisimulation: A comparative study
- Title not available (Why is that?)
Cited In (13)
- Title not available (Why is that?)
- Relating conflict-free stable transition and event models via redex families
- 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?)
- A Monotonic Formalism for Events and Systems of Events
- Title not available (Why is that?)
- Towards a unified view of bisimulation: A comparative study
- Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures
- Taking decisions late: end-based choice combined with action refinement
- Title not available (Why is that?)
This page was built for publication: Transition systems from event structures revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293333)
