Další formáty:
BibTeX
LaTeX
RIS
@article{372633, author = {Srba, Jiří}, article_number = {266(1-2)}, language = {eng}, issn = {0304-3975}, journal = {Theoretical Computer Science}, title = {Basic Process Algebra with Deadlocking States}, volume = {2001}, year = {2001} }
TY - JOUR ID - 372633 AU - Srba, Jiří PY - 2001 TI - Basic Process Algebra with Deadlocking States JF - Theoretical Computer Science VL - 2001 IS - 266(1-2) SP - 605 EP - 605 SN - 03043975 N2 - 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. ER -
SRBA, Jiří. Basic Process Algebra with Deadlocking States. Online. \textit{Theoretical Computer Science}. 2001, roč.~2001, 266(1-2), s.~605-1234. ISSN~0304-3975. [citováno 2024-04-24]
|