Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages

DOI10.1007/978-3-540-74407-8_32zbMATH Open1151.68458OpenAlexW1810796502MaRDI QIDQ3525656FDOQ3525656

Authors: Laura Bozzelli 

Publication date: 18 September 2008

Published in: CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74407-8_32

Recommendations

• Visibly pushdown languages
• Visibly linear temporal logic
• 2-Visibly Pushdown Automata
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Visibly linear dynamic logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (14)

• Visibly linear temporal logic
• A grammatical characterization of alternating pushdown automata
• Visibly linear dynamic logic
• Temporal logics with language parameters
• Visibly rational expressions
• Hybrid and first-order complete extensions of CaRet
• VLDL satisfiability and model checking via tree automata
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
• Regular languages of nested words: fixed points, automata, and synchronization
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Stack-aware hyperproperties
• Temporal logics with language parameters
• Games for active XML revisited
• CaRet with forgettable past

Uses Software

• Bebop

This page was built for publication: Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages

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