Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Modal logics for communicating systems
Theoretical Computer Science
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Fundamenta Informaticae - Special issue: logics for artificial intelligence
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On the Synthesis of an Asynchronous Reactive Module
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Model Checking Modal Transition Systems Using Kripke Structures
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Efficient Multiple-Valued Model-Checking Using Lattice Representations
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
chi-Chek: A Multi-valued Model-Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Validating Personal Requirements by Assisted Symbolic Behavior Browsing
Proceedings of the 19th IEEE international conference on Automated software engineering
Parameterized Interfaces for Open System Verification of Product Lines
Proceedings of the 19th IEEE international conference on Automated software engineering
A local approach for temporal model checking of Java bytecode
Journal of Computer and System Sciences
Support for Managing Design-Time Decisions
IEEE Transactions on Software Engineering
Temporal Logics for Representing Agent Communication Protocols
Agent Communication II
Bounded Model Checking for Partial Kripke Structures
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
LTL Generalized Model Checking Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Mixed Transition Systems Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
Policy auditing over incomplete logs: theory, implementation and applications
Proceedings of the 18th ACM conference on Computer and communications security
Modal transition systems: composition and LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Robust Vacuity for Branching Temporal Logic
ACM Transactions on Computational Logic (TOCL)
Deductive multi-valued model checking
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Weak Alphabet Merging of Partial Behavior Models
ACM Transactions on Software Engineering and Methodology (TOSEM)
Reasoning about inconsistent concurrent systems: a non-classical temporal logic
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Abstraction for shape analysis with fast and precise transformers
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
How thorough is thorough enough?
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Understanding and protecting privacy: formal semantics and principled audit mechanisms
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
On Designated Values in Multi-valued CTL^* Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
We discuss the problem of model checking temporal properties on partial Kripke structures, which were used in [BG99] to represent incomplete state spaces. We first extend the results of [BG99] by showing that the model-checking problem for any 3-valued temporal logic can be reduced to two model-checking problems for the corresponding 2-valued temporal logic. We then introduce a new semantics for 3-valued temporal logics that can give more definite answers than the previous one. With this semantics, the evaluation of a formula Φ on a partial Kripke structure M returns the third truth value ⊥ (read "unknown") only if there exist Kripke structures M1 and M2 that both complete M and such that M1 satisfies Φ while M2 violates Φ, hence making the value of Φ on M truly unknown. The partial Kripke structure M can thus be viewed as a partial solution to the satisfiability problem which reduces the solution space to complete Kripke structures that are more complete than M with respect to a completeness preorder. This generalized model-checking problem is thus a generalization of both satisfiability (all Kripke structures are potential solutions) and model checking (a single Kripke structure needs to be checked). We present algorithms and complexity bounds for the generalized model-checking problem for various temporal logics.