A Logical Characterization for Dense-Time Visibly Pushdown Automata

DOI10.1007/978-3-319-30000-9_7zbMath1435.68144OpenAlexW2403063447MaRDI QIDQ2798712

Vrunda Dave, Ramchandra Phawade, Devendra Bhave, Ashutosh Trivedi, Shankara Narayanan Krishna

Publication date: 13 April 2016

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-319-30000-9_7

zbMATH Keywords

visibly pushdown automatalogical characterizationevent-clock

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Unnamed Item ⋮ Reachability relations of timed pushdown automata ⋮ A Perfect Class of Context-Sensitive Timed Languages ⋮ On the determinization of event-clock input-driven pushdown automata ⋮ Context-free timed formalisms: robust automata and linear temporal logics

This page was built for publication: A Logical Characterization for Dense-Time Visibly Pushdown Automata