A note on an extension of PDL |
| |
| Affiliation: | 1. Institute for Computer Science, University of Leipzig, Germany;2. Institute for Formal Methods in Computer Science (FMI), University of Stuttgart, Germany |
| |
| Abstract: | Recently visibly pushdown automata have been extended to so-called k-phase multi-stack visibly pushdown automata (k-MVPAs). On the occasion of introducing k-MVPAs, it has been asked whether the extension of Propositional Dynamic Logic with k-MVPAs still leads to a decidable logic. This question is answered negatively here. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
