Pages that link to "Item:Q703845"
From MaRDI portal
The following pages link to On the computational complexity of bisimulation, redux (Q703845):
Displaying 6 items.
- From bisimulation to simulation: Coarsest partition problems (Q1431342) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- (Q4553282) (← links)
- (Q5457693) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897488) (← links)