The following pages link to (Q4736869):
Displayed 13 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)
- Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
- Decidability of performance equivalence for basic parallel processes (Q2503324) (← links)
- Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes (Q3090854) (← links)
- Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems (Q3449627) (← links)
- Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)
- (Q5111633) (← links)