Informace o publikaci

Modal Process Rewrite Systems

Autoři

BENEŠ Nikola KŘETÍNSKÝ Jan

Rok publikování 2012
Druh Článek ve sborníku
Konference Theoretical Aspects of Computing - ICTAC 2012
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Doi http://dx.doi.org/10.1007/978-3-642-32943-2_9
Obor Informatika
Klíčová slova modal transition systems; rewriting; infinite state systems
Přiložené soubory
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info