The following pages link to (Q4222868):
Displaying 11 items.
- An algebra of behavioural types (Q418153) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- (Q4270070) (← links)
- (Q4449536) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement (Q5738963) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
