On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise interprocedural dataflow analysis via graph reachability
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Solving Pushdown Games with a Sigma3 Winning Condition
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Landscape with Games in the Background
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adding nesting structure to words
Journal of the ACM (JACM)
Symbolic backwards-reachability analysis for higher-order pushdown systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A grammatical representation of visibly pushdown languages
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Formal Methods in System Design
An automata-theoretic approach to infinite-state systems
Time for verification
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Propositional dynamic logic with recursive programs
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Temporal reasoning for procedural programs
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Minimizing variants of visibly pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Regular languages of nested words: fixed points, automata, and synchronization
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Branching-time logics with path relativisation
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is given by a visibly pushdown language. We establish that, unlike pushdown games with pushdown winning conditions, visibly pushdown games are decidable and are 2Exptime-complete. We also show that pushdown games against Ltl specifications and Caret specifications are 3Exptime-complete. Finally, we establish the topological complexity of visibly pushdown languages by showing that they are a subclass of Boolean combinations of Σ3 sets. This leads to an alternative proof that visibly pushdown automata are not determinizable and also shows that visibly pushdown games are determined.