FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325MaRDI QIDQ5465872zbMATH OpenOpenAlexFDO

Authors Christof Löding, Parthasarathy Madhusudan, Olivier Serre

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Descriptive set theory (03E15) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Recommendations

• Visibly pushdown languages
• Good-for-games \(\omega \)-pushdown automata
• Pushdown processes: Games and model-checking
• Visibly pushdown modular games
• Visibly pushdown modular games

Cited in

(26)

• Visibly linear dynamic logic
• P-hardness of the emptiness problem for visibly pushdown languages
• On the determinization of event-clock input-driven pushdown automata
• Input-driven pushdown automata on well-nested infinite strings
• Visibly rational expressions
• Propositional dynamic logic with recursive programs
• On the Membership Problem for Visibly Pushdown Languages
• Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
• Visibly pushdown languages
• An automata-theoretic approach to infinite-state systems
• Games with Opacity Condition
• Branching-time logics with path relativisation
• scientific article; zbMATH DE number 7471692 (Why is no real title available?)
• VLDL satisfiability and model checking via tree automata
• Visibly pushdown modular games
• Ramsey-based inclusion checking for visibly pushdown automata
• On winning conditions of high Borel complexity in pushdown games
• Temporal Logic with Recursion.
• scientific article; zbMATH DE number 7770056 (Why is no real title available?)
• Extending Wagner's hierarchy to deterministic visibly pushdown automata
• Regular languages of nested words: fixed points, automata, and synchronization
• Separating the expressive power of propositional dynamic and modal fixpoint logics
• Module checking of pushdown multi-agent systems
• Probabilistic input-driven pushdown automata
• A proof theory of ( -)context-free languages, via non-wellfounded proofs
• Pushdown module checking

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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