Checking equality and regularity for normed BPA with silent moves

Authors:
Yuxi Fu
Affiliations:
BASICS, Department of Computer Science, MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems, Shanghai Jiao Tong University, China
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Year:
2013

Citing 15
Cited 0

Decidability of bisimulation equivalence for processes generating context-free languages

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Deciding bisimilarity of normed context-free processes is in &Sgr; p2

Theoretical Computer Science
Deciding branching bisimilarity of normed context-free processes is in &Sgr;2p

Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes

Theoretical Computer Science
Process rewrite systems

Information and Computation - Special issue on EXPRESS 1997
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Deciding Finiteness of Petri Nets Up To Bisimulation

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for all Context-Free Processes

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes

CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time

SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Complexity of weak bisimilarity and regularity for BPA and BPP

Mathematical Structures in Computer Science
Decidability of branching bisimulation on normed commutative context-free processes

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
BPA bisimilarity is EXPTIME-hard

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The decidability of weak bisimilarity on normed BPA is a long standing open problem. It is proved in this paper that branching bisimilarity, a standard refinement of weak bisimilarity, is decidable for normed BPA and that the associated regularity problem is also decidable.