Visibly Pushdown Automata: Universality and Inclusion via Antichains - Archive ouverte HAL Access content directly
Conference Papers Lecture Notes in Computer Science Year : 2013

Visibly Pushdown Automata: Universality and Inclusion via Antichains

Abstract

Visibly pushdown automata (VPAs), introduced by Alur and Madhusudan in 2004, are a useful formalism in various contexts, such as expressing and checking properties on control flows of programs, or on XML documents. In this context, we propose efficient antichain-based algorithms to check universality and inclusion of VPAs. Whereas the computation complexity is known to be ExpTime-complete for both problems, we show how antichains can avoid explicit determinization and save computations. The approach is extended to hedge automata. We implement the proposed algorithms in a prototype tool and conduct experiments on randomly generated VPAs. We show that, on numerous instances, our algorithms outperform other VPA tools.
Fichier principal
Vignette du fichier
LATA13-long.pdf (272.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00821218 , version 1 (07-05-2013)

Identifiers

Cite

Véronique Bruyère, Marc Ducobu, Olivier Gauwin. Visibly Pushdown Automata: Universality and Inclusion via Antichains. 7th International Conference on Language and Automata Theory and Applications, 2013, Bilbao, Spain. pp.190-201, ⟨10.1007/978-3-642-37064-9_18⟩. ⟨hal-00821218⟩

Collections

CNRS
94 View
358 Download

Altmetric

Share

Gmail Facebook X LinkedIn More