Approximating Weak Bisimilarity of Basic Parallel Processes

Approximating Weak Bisimilarity of Basic Parallel Processes

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 to prove weak bisimilarity decidable for certain subclasses. We also show their limitations for the general case. In particul...

Full description

Bibliographic Details
Main Authors: Piotr Hofman, Patrick Totzke
Format: Article
Language:English
Published: Open Publishing Association 2012-08-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1208.2751v1
id doaj-d5bc656b02d54674b9ee21396fca8643
record_format Article
spelling doaj-d5bc656b02d54674b9ee21396fca86432020-11-24T21:22:53ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-08-0189Proc. EXPRESS/SOS 20129911310.4204/EPTCS.89.8Approximating Weak Bisimilarity of Basic Parallel ProcessesPiotr HofmanPatrick TotzkeThis 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 to 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čar and Hirshfeld. http://arxiv.org/pdf/1208.2751v1
collection DOAJ
language English
format Article
sources DOAJ
author Piotr Hofman
Patrick Totzke
spellingShingle Piotr Hofman
Patrick Totzke
Approximating Weak Bisimilarity of Basic Parallel Processes
Electronic Proceedings in Theoretical Computer Science
author_facet Piotr Hofman
Patrick Totzke
author_sort Piotr Hofman
title Approximating Weak Bisimilarity of Basic Parallel Processes
title_short Approximating Weak Bisimilarity of Basic Parallel Processes
title_full Approximating Weak Bisimilarity of Basic Parallel Processes
title_fullStr Approximating Weak Bisimilarity of Basic Parallel Processes
title_full_unstemmed Approximating Weak Bisimilarity of Basic Parallel Processes
title_sort approximating weak bisimilarity of basic parallel processes
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-08-01
description 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 to 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čar and Hirshfeld.
url http://arxiv.org/pdf/1208.2751v1
work_keys_str_mv AT piotrhofman approximatingweakbisimilarityofbasicparallelprocesses
AT patricktotzke approximatingweakbisimilarityofbasicparallelprocesses
_version_ 1725994351075524608

Similar Items