A hierarchy of reverse bisimulations on stable configuration structures
From MaRDI portal
Publication:2883121
DOI10.1017/S0960129511000429zbMATH Open1238.68102MaRDI QIDQ2883121FDOQ2883121
Authors: Iain Phillips, Irek Ulidowski 
Publication date: 11 May 2012
Published in: MSCS. Mathematical Structures in Computer Science (Search for Journal in Brave)
Recommendations
hereditary history-preserving bisimulationinterleaving bisimulationpomset bisimulationpower of bisimulationsreverse stepsstep bisimulation
Cites Work
- Petri nets, event structures and domains. I
- Undecidability of domino games and hhp-bisimilarity.
- Bisimulation from open maps
- Reversing algebraic process calculi
- The difference between splitting in \(n\) and \(n+1\)
- Refinement of actions and equivalence notions for concurrent systems
- Observation equivalence as a testing equivalence
- Reversibility and models for concurrency
- A completed hierarchy of true concurrent equivalences
Cited In (11)
- Reversible barbed congruence on configuration structures
- Behavioural logics for configuration structures
- Title not available (Why is that?)
- A parametric framework for reversible \(\pi\)-calculi
- Reverse bisimulations on stable configuration structures
- Reversibility and asymmetric conflict in event structures
- Model checking reversible systems: forwardly
- Contextual equivalences in configuration structures and reversibility
- Event identifier logic
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- Forward-reverse observational equivalences in CCSK
This page was built for publication: A hierarchy of reverse bisimulations on stable configuration structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883121)
