scientific article; zbMATH DE number 2102771

zbMath1046.68622MaRDI QIDQ4818859

Javier Esparza, Petr Jančar

Publication date: 24 September 2004

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

Regularity of normed PA processes ⋮ Bisimulation equivalence is decidable for one-counter processes ⋮ Bisimulation collapse and the process taxonomy ⋮ Petri nets and regular processes ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ Basic process algebra with deadlocking states ⋮ Model checking of systems with many identical timed processes ⋮ Decidability of bisimilarity for one-counter processes.