Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F04%3A00010337" target="_blank" >RIV/61989100:27240/04:00010337 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time
Original language description
In this paper we consider the problem of deciding bisimulation equivalence of a BPP and a finite-state system. We show that the problem can be solved in polynomial time and we present an algorithm deciding the problem in time O(n^4). The algorithm also constructs for each state of the finite-state system a `symbolic' semilinear representation of the set of all states of the BPP system which are bisimilar with this state.
Czech name
Bisimulation Equivalence of a BPP and a Finite State System can be Decided in Polynomial Time
Czech description
In this paper we consider the problem of deciding bisimulation equivalence of a BPP and a finite-state system.
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F03%2F1161" target="_blank" >GA201/03/1161: Verification of infinite-state systems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
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 Infinity 2004 (A Satellite Workshop of CONCUR 2004)
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
73-81
Publisher name
Springer-Verlag
Place of publication
Londýn
Event location
Londýn
Event date
Sep 28, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—