The following pages link to (Q3761680):
Displaying 14 items.
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Theory of interaction (Q896903) (← links)
- The compression structure of a process (Q1044743) (← links)
- On the consistency of Koomen's fair abstraction rule (Q1090103) (← links)
- Global renaming operators in concrete process algebra (Q1106660) (← links)
- \(\tau\)-bisimulations and full abstraction for refinement of actions (Q1183474) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Rooted branching bisimulation as a congruence (Q1975965) (← links)
- Bisimulation maps in presheaf categories (Q2133160) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Decision procedures and graph reductions for bisimulation equivalences part 1 (Q4203808) (← links)
- Non-regular iterators in process algebra (Q5958616) (← links)
