Visibly pushdown modular games

DOI10.1016/J.IC.2016.07.007MaRDI QIDQ515657zbMATH OpenOpenAlexFDO

Authors I. De Crescenzo, Salvatore La Torre, Yaron Velner

Publication date 16 March 2017

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2016.07.007

zbMATH Keywords

pushdown automatamodular games

Mathematics Subject Classification ID

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

Recommendations

• Visibly pushdown modular games
• Computer Aided Verification
• Modular strategies for recursive game graphs
• scientific article; zbMATH DE number 1956593
• Mean-payoff pushdown games

Cites work

• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1956593 (Why is no real title available?)
• scientific article; zbMATH DE number 2038754 (Why is no real title available?)
• scientific article; zbMATH DE number 1903345 (Why is no real title available?)
• A Temporal Logic for Multi-threaded Programs
• A general modular synthesis problem for pushdown systems
• A unifying approach for multistack pushdown automata
• Adding nesting structure to words
• Computer Aided Verification
• Computer Aided Verification
• Dense-timed pushdown automata
• Deterministic generators and games for LTL fragments
• Evaluation is MSOL-compatible
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Facets of Synthesis: Revisiting Church’s Problem
• First-Order and Temporal Logics for Nested Words
• Games on Multi-stack Pushdown Systems
• Modular strategies for recursive game graphs
• Modular synthesis with open components
• On the Complexity of Ltl Model-Checking of Recursive State Machines
• Playing games with boxes and diamonds.
• Pushdown processes: Games and model-checking
• Reducing concurrent analysis under a context bound to sequential analysis
• Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
• Scope-bounded pushdown languages
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Synthesis from Component Libraries
• Synthesis from recursive-components libraries
• Synthesizing reactive programs
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification of scope-dependent hierarchical state machines
• Visibly pushdown modular games

Cited in

(7)

• The complexity of mean-payoff pushdown games
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1956593 (Why is no real title available?)
• Visibly pushdown modular games
• A general modular synthesis problem for pushdown systems
• Modular strategies for recursive game graphs
• Visibly pushdown modular games

This page was built for publication: Visibly pushdown modular games

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