The following pages link to (Q4736869):
Displaying 5 items.
- Undecidability of performance equivalence of Petri nets (Q507373) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
