• DOI:10.4204/EPTCS.89.8
• Corpus ID: 13887295

Approximating Weak Bisimilarity of Basic Parallel Processes

@inproceedings{Hofman2012ApproximatingWB,
  title={Approximating Weak Bisimilarity of Basic Parallel Processes},
  author={Piotr Hofman and Patrick Totzke},
  booktitle={Combined International Workshop Expressiveness Concurrency and Workshop Structural Operational Semantics},
  year={2012}
}

• Piotr Hofman, P. Totzke
• Published in
  Combined International…
  12 August 2012
• Computer Science

This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used t o prove weak bisimilarity decidable for certain subclasses. We also show their limitations for the general case. In particular, we show a lower bound of ω ∗ ω for the approximants which allow weak steps and a lower bound of ω+ ω for the approximants that allow sequences of actions. The former lower bound negatively answers the open question of Janˇ car and Hirshfeld.