Deciding weak bisimilarity of normed context-free processes using tableau

Authors:
Xinxin Liu;Haiyan Chen
Affiliations:
State Key Laboratory Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China;State Key Laboratory Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China and Graduate School of the Chinese Academy of Sciences, Beijing, China
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 10
Cited 1

Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
Bisimulation equivalence is decidable for all context-free processes

Information and Computation
Communication and Concurrency

Communication and Concurrency
A Calculus of Communicating Systems

A Calculus of Communicating Systems
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Decidability of Bisimulation Equivalence for Normed Pushdown Processes

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Infinite Results

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
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Process theory based on bisimulation semantics

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Decidability of Weak Bisimilarity for a Subset of BPA

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deciding strong and weak bisimilarity of context-free processes are challenging because of the infinite nature of the state space of such processes. Deciding weak bisimilarity is harder since the usual decomposition property which holds for strong bisimilarity fails. Hirshfeld proposed the notion of bisimulation tree to prove that weak bisimulation is decidable for totally normed BPA and BPP processes. Suggested by his idea of decomposition, in this paper we present a tableau method for deciding weak bisimilarity of totally normed context-free processes. Compared with Hirshfeld's bisimulation tree method, our method is more intuitive and more direct.