Publication:4490743
From MaRDI portal
zbMath0942.68635MaRDI QIDQ4490743
Publication date: 20 July 2000
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Behavioural equivalence for infinite systems — Partially decidable!, High undecidability of weak bisimilarity for Petri nets, Pushdown automata, multiset automata, and Petri nets, Nested semantics over finite trees are equationally hard, Deciding bisimulation and trace equivalences for systems with many identical processes, Undecidability of bisimilarity for Petri nets and some related problems, On the computational complexity of bisimulation, redux, Decidability of bisimulation equivalence for normed pushdown processes, On reachability equivalence for BPP-nets, Petri nets and regular processes, Undecidable equivalences for basic parallel processes