scientific article; zbMATH DE number 1479629
From MaRDI portal
Recommendations
Cited in
(21)- Non-interleaving bisimulation equivalences on basic parallel processes
- Decidability of bisimulation equivalence for normed pushdown processes
- Undecidable equivalences for basic process algebra
- On reachability equivalence for BPP-nets
- Petri nets and regular processes
- Bisimilarity on basic parallel processes
- Undecidable equivalences for basic parallel processes
- Decidability of performance equivalence for basic parallel processes
- scientific article; zbMATH DE number 1701362 (Why is no real title available?)
- scientific article; zbMATH DE number 1051237 (Why is no real title available?)
- scientific article; zbMATH DE number 1927586 (Why is no real title available?)
- Behavioural equivalence for infinite systems -- partially decidable!
- High undecidability of weak bisimilarity for Petri nets
- Analysis of probabilistic basic parallel processes
- Pushdown automata, multiset automata, and Petri nets
- Nested semantics over finite trees are equationally hard
- Weak bisimulation and model checking for basic parallel processes
- Deciding bisimulation and trace equivalences for systems with many identical processes
- Undecidability of bisimilarity for Petri nets and some related problems
- Weighted basic parallel processes and combinatorial enumeration
- On the computational complexity of bisimulation, redux
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490743)
