The following pages link to Bisimulation and action refinement (Q685407):
Displaying 14 items.
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- A reduced maximality labeled transition system generation for recursive Petri nets (Q903505) (← links)
- Maximality preserving bisimulation (Q1193655) (← links)
- Deciding true concurrency equivalences on safe, finite nets (Q1365677) (← links)
- The difference between splitting in \(n\) and \(n+1\) (Q1370654) (← links)
- Towards a unified view of bisimulation: A comparative study (Q1575240) (← links)
- Vertical implementation (Q1854462) (← links)
- Pomset bisimulation and unfolding for reset Petri nets (Q2113378) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- (Q2844828) (← links)
- New Bisimulation Semantics for Distributed Systems (Q3614847) (← links)
- The limit of splitn-language equivalence (Q4645217) (← links)
- Symmetric and Asymmetric Asynchronous Interaction (Q5166614) (← links)
- ENFORCING CONCURRENT TEMPORAL BEHAVIORS (Q5484900) (← links)
