On Model Checking for Visibly Pushdown Automata

DOI10.1007/978-3-642-28332-1_35MaRDI QIDQ2890214zbMATH OpenOpenAlexFDO

Authors Tang van Nguyen, Hitoshi Ohsaki

Publication date 8 June 2012

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28332-1_35

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Reachability analysis of pushdown automata: Application to model-checking
• Model-checking of ordered multi-pushdown automata
• Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
• Ramsey-based inclusion checking for visibly pushdown automata
• Automata-Theoretic Model Checking Revisited
• Beyond Language Equivalence on Visibly Pushdown Automata
• Efficient determinization of visibly and height-deterministic pushdown automata
• Visibly pushdown automata and transducers with counters

Cited in

(11)

• Efficient determinization of visibly and height-deterministic pushdown automata
• Trimming visibly pushdown automata
• Minimization of visibly pushdown automata using partial Max-SAT
• Minimizing Variants of Visibly Pushdown Automata
• A Grammatical Representation of Visibly Pushdown Languages
• Beyond Language Equivalence on Visibly Pushdown Automata
• Visibly pushdown automata: universality and inclusion via antichains
• Ramsey-based inclusion checking for visibly pushdown automata
• Ramsey goes visibly pushdown
• Trimming visibly pushdown automata
• Antichains algorithms for the inclusion problem between \(\omega\)-VPL

This page was built for publication: On Model Checking for Visibly Pushdown Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890214)