scientific article; zbMATH DE number 1555184

zbMath0953.68571MaRDI QIDQ4525284

Joram Hirschfeld

Publication date: 22 January 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, Petri nets, commutative context-free grammars, and basic parallel processes, Undecidable equivalences for basic parallel processes, Bisimulation equivalence is decidable for one-counter processes, High undecidability of weak bisimilarity for Petri nets, On reachability equivalence for BPP-nets, Infinite results, 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, On the Expressive Power of Restriction and Priorities in CCS with Replication, Decidability of bisimilarity for one-counter processes.