More on weak bisimilarity of normed basic parallel processes

Authors:
Haiyan Chen
Affiliations:
State Key Laboratory Computer Science of Institute of Software, Chinese Academy of Sciences and Graduate School of the Chinese Academy of Sciences
Venue:
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Year:
2008

Citing 8
Cited 0

Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Infinite Results

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Weak Bisimulation and Model Checking for Basic Parallel Processes

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deciding strong and weak bisimilarity of BPP 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. In this paper, we present a tableau method to decide weak bisimilarity of totally normed BPP. Compared with Hirshfeld's bisimulation tree method, our method is more intuitive and more direct. Moreover from the decidability proof we can derive a complete axiomatisation for the weak bisimulation of totally normed BPP.