scientific article; zbMATH DE number 1479629
From MaRDI portal
Publication:4490743
zbMath0942.68635MaRDI QIDQ4490743
Publication date: 20 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Undecidable equivalences for basic parallel processes ⋮ Nested semantics over finite trees are equationally hard ⋮ High undecidability of weak bisimilarity for Petri nets ⋮ On reachability equivalence for BPP-nets ⋮ Petri nets and regular processes ⋮ Behavioural equivalence for infinite systems — Partially decidable! ⋮ 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 ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Decidability of bisimulation equivalence for normed pushdown processes
