Bisimulation equivalence is decidable for one-counter processes

DOI10.1007/3-540-63165-8_210zbMath1401.68229OpenAlexW1525520647MaRDI QIDQ4571985

Petr Jančar

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_210

Mathematics Subject Classification ID

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

Related Items (4)

Regularity of normed PA processes ⋮ Basic process algebra with deadlocking states ⋮ Complete formal systems for equivalence problems ⋮ \(L(A)=L(B)\)? decidability results from complete formal systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Undecidability of bisimilarity for Petri nets and some related problems
• Bisimulation equivalence is decidable for all context-free processes
• Semigroups, Presburger formulas, and languages
• Petri nets, commutative context-free grammars, and basic parallel processes
• Decidability of bisimulation equivalence for normed pushdown processes
• Bisimulation collapse and the process taxonomy

This page was built for publication: Bisimulation equivalence is decidable for one-counter processes