Approximating Weak Bisimilarity of Basic Parallel Processes

Piotr Hofman, Patrick Totzke

Research output: Chapter in Book/Report/Conference proceedingConference contribution


This paper explores the well known approximantion approach to decide weak bisimilarity of Basic Parallel Processes by refinement. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses and 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.
Original languageEnglish
Title of host publicationProceedings of Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structural Operational Semantics
EditorsBas Luttik, Michel A. Reniers
PublisherOpen Publishing Association
Number of pages15
Publication statusPublished - 2012

Publication series

NameElectronic Proceedings in Theoretical Computer Science
PublisherOpen Publishing Association

Cite this