Strong Bisimilarity and Regularity of Basic Parallel Processes is PSPACE-Hard
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F02%3A00005680" target="_blank" >RIV/00216224:14330/02:00005680 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Strong Bisimilarity and Regularity of Basic Parallel Processes is PSPACE-Hard
Original language description
We show that the problem of checking whether two processes definable in the syntax of Basic Parallel Processes (BPP) are strongly bisimilar is PSPACE-hard. We also demonstrate that there is a polynomial time reduction from the strong bisimilarity checking problem of regular BPP to the strong regularity (finiteness) checking of BPP. This implies that strong regularity of BPP is also PSPACE-hard.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F00%2F0400" target="_blank" >GA201/00/0400: Infinite state concurrent systems - models and verification</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of 19th International Symposium on Theoretical Aspects of Computer Science (STACS'02)
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
535
Publisher name
Springer-Verlag
Place of publication
Holland
Event location
14-16 March, 2002, Juan les Pins, France
Event date
Jan 1, 2002
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—