Other formats:
BibTeX
LaTeX
RIS
@inproceedings{574584,
author = {Křetínský, Mojmír and Řehák, Vojtěch and Strejček, Jan},
address = {Berlin, Heidelberg},
booktitle = {FSTTCS 2005: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, 25th International Conference},
keywords = {process rewrite systems; state extension; infinite-state; (un)decidability; HM logic; reachability},
language = {eng},
location = {Berlin, Heidelberg},
isbn = {3-540-30495-9},
pages = {213-224},
publisher = {Springer-Verlag},
title = {Reachability of Hennessy - Milner properties for weakly extended PRS},
year = {2005}
}
TY - JOUR
ID - 574584
AU - Křetínský, Mojmír - Řehák, Vojtěch - Strejček, Jan
PY - 2005
TI - Reachability of Hennessy - Milner properties for weakly extended PRS
PB - Springer-Verlag
CY - Berlin, Heidelberg
SN - 3540304959
KW - process rewrite systems
KW - state extension
KW - infinite-state
KW - (un)decidability
KW - HM logic
KW - reachability
N2 - We examine the problem whether a given weakly extended process rewrite system (wPRS) contains a reachable state satisfying a given formula of Hennessy-Milner logic. We show that this problem is decidable. As a corollary we observe that the problem of strong bisimilarity between wPRS and finite-state systems is decidable. Decidability of the same problem for wPRS subclasses, namely PAN and PRS, has been formulated as an open question, see e.g. [Srb02]. We also strengthen some related undecidability results on some PRS subclasses.
ER -
KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. Reachability of Hennessy - Milner properties for weakly extended PRS. In \textit{FSTTCS 2005: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, 25th International Conference}. Berlin, Heidelberg: Springer-Verlag, 2005, p.~213-224. ISBN~3-540-30495-9.
|
