Alternating automata on infinite trees
Theoretical Computer Science
Journal of the ACM (JACM)
Information and Computation - Special issue on EXPRESS 1997
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
The regular viewpoint on PA-processes
Theoretical Computer Science
Dynamic Logic
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Model Checking CTL Properties of Pushdown Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model Checking Linear Properties of Prefix-Recognizable Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
On the Decidability of Model Checking for Several µ-calculi and Petri Nets
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Propositional dynamic logic with recursive programs
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Some perspectives of infinite-state verification
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
PDL with intersection and converse is 2EXP-complete
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Connectivity games over dynamic networks
Theoretical Computer Science
| Hi-index | 0.00 |
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL∩ (which includes the intersection operator on programs) over various classes of infinite state systems (BPP, BPA, pushdown systems, prefix-recognizable systems) are studied. Precise upper and lower bounds are shown for the data/expression/combined complexity of these model-checking problems.