Communicating sequential processes
Communicating sequential processes
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Reasoning about networks with many identical finite-state processes
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Alternating automata on infinite trees
Theoretical Computer Science
Reasoning about uncertainty in fault-tolerant distributed systems
Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
On the development of reactive systems
Logics and models of concurrent systems
Handbook of theoretical computer science (vol. B)
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the control-D system
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract)
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
On the Complexity of Verifying Concurrent Transition Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Model Checking and Modular Verification
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
On the Complexity of Branching Modular Model Checking (Extended Abstract)
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
From Pre-historic to Post-modern Symbolic Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th 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
Liveness in Timed and Untimed Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Open Systems in Reactive Environments: Control and Synthesis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
An automata-theoretic approach to infinite-state systems
Time for verification
Automated framework for formal operator task analysis
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Nondeterministic Moore automata and Brzozowski's algorithm
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
Nondeterministic Moore automata and Brzozowski's minimization algorithm
Theoretical Computer Science
From model checking to model measuring
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A constraint-based approach to solving games on infinite graphs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.00 |
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general setting, the environment is another open system. Given an open system M and a property ψ, we say that M robustly satisfies ψ iff for every open system M′, which serves as an environment to M, the composition M||M′ satisfies ψ. The problem of robust model checking is then to decide, given M and ψ, whether M robustly satisfies ψ. In this paper we study the robust-model-checking problem. We consider systems modeled by nondeterministic Moore machines, and properties specified by branching temporal logic (for linear temporal logic, robust satisfaction coincides with usual satisfaction). We show that the complexity of the problem is EXPTIME-complete for CTL and the µ-calculus, and is 2EXPTIME-complete for CTL*. We partition branching temporal logic formulas into three classes: universal, existential, and mixed formulas. We show that each class has different sensitivity to the robustness requirement. In particular, unless the formula is mixed, robust model checking can ignore nondeterministic environments. In addition, we show that the problem of classifying a CTL formula into these classes is EXPTIME-complete.