Model-Checking of Ordered Multi-Pushdown Automata
We address the verification problem of ordered multi-pushdown automata: A multi-stack extension of pushdown automata that comes with a constraint on stack transitions such that a pop can only be performed on the first non-empty stack. First, we show that the emptiness problem for ordered multi-pushd...
| Autor principal: | |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
Logical Methods in Computer Science e.V.
2012-09-01
|
| Colección: | Logical Methods in Computer Science |
| Materias: | |
| Acceso en línea: | https://lmcs.episciences.org/871/pdf |