Basic Process Algebra with Deadlocking States
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F01%3A00004557" target="_blank" >RIV/00216224:14330/01:00004557 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Basic Process Algebra with Deadlocking States
Original language description
Bisimilarity and regularity are decidable properties for the class of BPA (or context--free) processes. We extend BPA with a deadlocking state obtaining BPA delta systems. We show that the BPA delta class is more expressive w.r.t. bisimilarity, but it remains language equivalent to BPA. We prove that bisimilarity and regularity remain decidable for BPAd delta. Finally we give a characterisation of those BPA delta processes that can be equivalently (up to bisimilarity) described within the ``pure'' BPA syntax.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
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
—
Others
Publication year
2001
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
—
e-ISSN
—
Volume of the periodical
2001
Issue of the periodical within the volume
266(1-2)
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
630
Pages from-to
605
UT code for WoS article
—
EID of the result in the Scopus database
—