The following pages link to Bisimulation and action refinement (Q685407):
Displaying 23 items.
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← 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)
- Action refinement applied to late decisions (Q2432235) (← links)
- Taking decisions late: end-based choice combined with action refinement (Q2844828) (← links)
- Superposition: composition vs refinement of non-deterministic, action-based systems (Q2844830) (← links)
- Model Refinement Using Bisimulation Quotients (Q3067468) (← links)
- New Bisimulation Semantics for Distributed Systems (Q3614847) (← links)
- Bisimulation can't be traced (Q4369863) (← links)
- The limit of splitn-language equivalence (Q4645217) (← links)
- Symmetric and Asymmetric Asynchronous Interaction (Q5166614) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479164) (← links)
- ENFORCING CONCURRENT TEMPORAL BEHAVIORS (Q5484900) (← links)
- A bisimulation for dynamic sealing (Q5899331) (← links)
- Refinement of actions and equivalence notions for concurrent systems (Q5925821) (← links)
- Action refinement and property inheritance in systems of sequential agents (Q6162110) (← links)
