Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-32943-2_9 | ICTAC |
Keywords | Field | DocType |
pushdown automaton,decidable case,modal transition system,modal process,basic parallel process,infinite state space,non-modal case,refining process,modal setting,finite set,modal refinement relation | Discrete mathematics,Finite set,Computer science,Theoretical computer science,Decidability,Pushdown automaton,Bisimulation,Rewriting,State space,Modal,Undecidable problem | Conference |
Citations | PageRank | References |
2 | 0.37 | 54 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikola Beneš | 1 | 94 | 12.24 |
| Jan Křetínský | 2 | 190 | 12.05 |