Communicating sequential processes
Communicating sequential processes
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Alternating automata on infinite trees
Theoretical Computer Science
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
On the development of reactive systems
Logics and models of concurrent systems
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Information and Computation - Special issue on FLOC '96
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
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)
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Enriched µ-calculi module checking
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Formal Methods in System Design
Enriched µ-calculus pushdown module checking
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
An automata-theoretic approach to infinite-state systems
Time for verification
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A saturation method for the modal μ-calculus over pushdown systems
Information and Computation
Effcient CTL model-checking for pushdown systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Improved model checking of hierarchical systems
Information and Computation
The complexity of enriched µ-calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
ACM Transactions on Computational Logic (TOCL)
Pushdown module checking with imperfect information
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Automata-theoretic decision of timed games
Theoretical Computer Science
Synthesis of hierarchical systems
Science of Computer Programming
On the Boundary of Behavioral Strategies
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imperfect information about the system. Recently, the perfect information case has been extended to infinite-state systems (pushdown module checking). In this paper, we extend pushdown module checking to the imperfect information setting; i.e., to the case where the environment has only a partial view of the system@?s control states and pushdown store content. We study the complexity of this problem with respect to the branching-time temporal logics CTL, CTL^@? and the propositional @m-calculus. We show that pushdown module checking, which is by itself harder than pushdown model checking, becomes undecidable when the environment has imperfect information. We also show that undecidability relies on hiding information about the pushdown store. Indeed, we prove that with imperfect information about the control states, but a visible pushdown store, the problem is decidable and its complexity is 2Exptime-complete for CTL and the propositional @m-calculus, and 3Exptime-complete for CTL^@?.