Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F02%3A00004665" target="_blank" >RIV/00216224:14330/02:00004665 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time
Original language description
We prove that weak bisimilarity is decidable in polynomial time between finite-state systems and several classes of infinite-state systems: context-free processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, theseare the first polynomial algorithms for weak bisimilarity problems involving infinite-state systems.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
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
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
270
Issue of the periodical within the volume
1-2
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
24
Pages from-to
677
UT code for WoS article
—
EID of the result in the Scopus database
—