Modal Process Rewrite Systems


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.

DOI: 10.1007/978-3-642-32943-2_9

5 Figures and Tables

Cite this paper

@inproceedings{Benes2012ModalPR, title={Modal Process Rewrite Systems}, author={Nikola Benes and Jan Kret{\'i}nsk{\'y}}, booktitle={ICTAC}, year={2012} }