Bisimilarity on Basic Parallel Processes

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F22%3A73615429" target="_blank" >RIV/61989592:15310/22:73615429 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0304397521007027" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0304397521007027</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2021.11.027" target="_blank" >10.1016/j.tcs.2021.11.027</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Bisimilarity on Basic Parallel Processes

Popis výsledku v původním jazyce

The main aim of this paper is to give a simple transparent proof of the result showing that the problem of bisimulation equivalence on the class of Basic Parallel Processes (BPP), denoted by BPP-Bisim, can be decided by a polynomial-space algorithm. This result (by the author) has been previously only presented in a conference version, in a rather technical form that is not easily readable and verifiable. Since the result has clarified the complexity of the problem BPP-Bisim, namely its PSPACE-completeness (using the lower bound by Srba), and the problem deals with a fundamental behavioural equivalence and with one of the simplest models that naturally extend finite-state systems into infinite-state ones, it seems appropriate to have a transparent version of the proof.

Název v anglickém jazyce

Bisimilarity on Basic Parallel Processes

Popis výsledku anglicky

The main aim of this paper is to give a simple transparent proof of the result showing that the problem of bisimulation equivalence on the class of Basic Parallel Processes (BPP), denoted by BPP-Bisim, can be decided by a polynomial-space algorithm. This result (by the author) has been previously only presented in a conference version, in a rather technical form that is not easily readable and verifiable. Since the result has clarified the complexity of the problem BPP-Bisim, namely its PSPACE-completeness (using the lower bound by Srba), and the problem deals with a fundamental behavioural equivalence and with one of the simplest models that naturally extend finite-state systems into infinite-state ones, it seems appropriate to have a transparent version of the proof.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

THEORETICAL COMPUTER SCIENCE

ISSN

0304-3975

e-ISSN

1879-2294

Svazek periodika

903

Číslo periodika v rámci svazku

FEB

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

13

Strana od-do

26-38

Kód UT WoS článku

000755788100002

EID výsledku v databázi Scopus

2-s2.0-85122611418