Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
From MaRDI portal
Publication:3525656
DOI10.1007/978-3-540-74407-8_32zbMath1151.68458OpenAlexW1810796502MaRDI QIDQ3525656
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
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)
Related Items (12)
Games for active XML revisited ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Regular languages of nested words: fixed points, automata, and synchronization ⋮ The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity ⋮ Visibly rational expressions ⋮ Temporal logics with language parameters ⋮ Hybrid and First-Order Complete Extensions of CaRet ⋮ Visibly linear temporal logic ⋮ Temporal logics with language parameters ⋮ Visibly linear dynamic logic ⋮ CaRet With Forgettable Past ⋮ Unnamed Item
Uses Software
This page was built for publication: Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
