Bisimulation equivalence is decidable for one-counter processes

DOI10.1007/3-540-63165-8_210zbMATH Open1401.68229OpenAlexW1525520647MaRDI QIDQ4571985FDOQ4571985

Authors: 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

Recommendations

• Decidability of bisimilarity for one-counter processes.
• Bisimulation equivalence is decidable for all context-free processes
• scientific article; zbMATH DE number 2038739
• scientific article; zbMATH DE number 1500527
• The complexity of bisimilarity-checking for one-counter processes.
• Bisimilarity of one-counter processes is PSPACE-complete
• Decidability of bisimulation equivalence for process generating context-free languages
• scientific article; zbMATH DE number 4035115
• Computable processes and bisimulation equivalence
• Deciding bisimulation-like equivalences with finite-state processes

Mathematics Subject Classification ID

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

Cites Work

• Semigroups, Presburger formulas, and languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation collapse and the process taxonomy
• Undecidability of bisimilarity for Petri nets and some related problems
• Bisimulation equivalence is decidable for all context-free processes
• Title not available (Why is that?)
• Decidability of bisimulation equivalence for normed pushdown processes
• Petri nets, commutative context-free grammars, and basic parallel processes

Cited In (9)

• Title not available (Why is that?)
• Decidability of bisimilarity for one-counter processes.
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Regularity of normed PA processes
• Complete formal systems for equivalence problems
• Basic process algebra with deadlocking states
• Deciding bisimulation and trace equivalences for systems with many identical processes
• Deciding bisimulation and trace equivalences for systems with many identical processes
• Bisimilarity of one-counter processes is PSPACE-complete

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571985)