The following pages link to (Q4490743):
Displaying 11 items.
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- On reachability equivalence for BPP-nets (Q1391745) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Undecidable equivalences for basic parallel processes (Q2389334) (← links)
- Behavioural equivalence for infinite systems — Partially decidable! (Q4633177) (← links)
- High undecidability of weak bisimilarity for Petri nets (Q5096742) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
