Other formats:
BibTeX
LaTeX
RIS
@inproceedings{991086,
author = {Beneš, Nikola and Křetínský, Jan},
address = {Berlin Heidelberg},
booktitle = {Theoretical Aspects of Computing - ICTAC 2012},
doi = {http://dx.doi.org/10.1007/978-3-642-32943-2_9},
keywords = {modal transition systems; rewriting; infinite state systems},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin Heidelberg},
isbn = {978-3-642-32942-5},
pages = {120-135},
publisher = {Springer},
title = {Modal Process Rewrite Systems},
year = {2012}
}
TY - JOUR
ID - 991086
AU - Beneš, Nikola - Křetínský, Jan
PY - 2012
TI - Modal Process Rewrite Systems
PB - Springer
CY - Berlin Heidelberg
SN - 9783642329425
KW - modal transition systems
KW - rewriting
KW - infinite state systems
N2 - We consider modal transition systems with infinite state space generated by finite sets of rules. In particular, we extend process rewrite systems to the modal setting and investigate decidability of the modal refinement relation between systems from various subclasses. Since already simulation is undecidable for most of the cases, we focus on the case where either the refined or the refining process is finite. Namely, we show decidability for pushdown automata extending the non-modal case and surprising undecidability for basic parallel processes. Further, we prove decidability when both systems are visibly pushdown automata. For the decidable cases, we also provide complexities. Finally, we discuss a notion of bisimulation over MTS.
ER -
BENEŠ, Nikola and Jan KŘETÍNSKÝ. Modal Process Rewrite Systems. In \textit{Theoretical Aspects of Computing - ICTAC 2012}. Berlin Heidelberg: Springer, 2012, p.~120-135. ISBN~978-3-642-32942-5. Available from: https://dx.doi.org/10.1007/978-3-642-32943-2\_{}9.
|
