The following pages link to (Q4525284):
Displaying 14 items.
- 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)
- On reachability equivalence for BPP-nets (Q1391745) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Undecidable equivalences for basic parallel processes (Q2389334) (← links)
- Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems (Q3449627) (← links)
- On the Expressive Power of Restriction and Priorities in CCS with Replication (Q3617733) (← links)
- Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
- Behavioural equivalence for infinite systems — Partially decidable! (Q4633177) (← links)
- Petri nets, commutative context-free grammars, and basic parallel processes (Q5055893) (← links)
- High undecidability of weak bisimilarity for Petri nets (Q5096742) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
