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)
Modal logics for communicating systems
Theoretical Computer Science
Information and Computation
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 on modal logics in knowledge representation
Communication and Concurrency
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Ternary Decision Diagrams: Survey
ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
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
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
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
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
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
Model-Checking Software Using Precise Abstractions
Verified Software: Theories, Tools, Experiments
Modal Abstractions of Concurrent Behaviour
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Bounded Model Checking for Partial Kripke Structures
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Model Checking Recursive Programs with Exact Predicate Abstraction
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
LTL Generalized Model Checking Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Don't Know for Multi-valued Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
On the consistency, expressiveness, and precision of partial modeling formalisms
Information and Computation
Compositional model checking of software product lines using variation point obligations
Automated Software Engineering
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
Minimizing deterministic lattice automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Weak Alphabet Merging of Partial Behavior Models
ACM Transactions on Software Engineering and Methodology (TOSEM)
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A theory of predicate-complete test coverage and generation
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Multi-valued model checking games
Journal of Computer and System Sciences
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Tracing integration analysis in component-based formal specifications
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
CAV'05 Proceedings of the 17th 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
Properties of behavioural model merging
FM'06 Proceedings of the 14th international conference on Formal Methods
Ranked predicate abstraction for branching time: complete, incremental, and precise
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Managing ad-hoc networks through the formal specification of service requirements
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Incremental specification with SCTL/MUS-T: a case study
Journal of Systems and Software
Partial models: towards modeling and reasoning with uncertainty
Proceedings of the 34th International Conference on Software Engineering
On Designated Values in Multi-valued CTL^* Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Compositional verification and 3-valued abstractions join forces
SAS'07 Proceedings of the 14th international conference on Static Analysis
Topology-dependent abstractions of broadcast networks
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Approximating deterministic lattice automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Formal analysis of piecewise affine systems through formula-guided refinement
Automatica (Journal of IFAC)
Context-aware DSPLs: model-based runtime adaptation for resource-constrained systems
Proceedings of the 17th International Software Product Line Conference co-located workshops
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We address the problem of relating the result of model checking a partial state space of a system to the properties actually possessed by the system. We represent incomplete state spaces as partial Kripke structures, and give a 3-valued interpretation to modal logic formulas on these structures. The third truth value ⊥ means "unknown whether true or false". We define a preorder on partial Kripke structures that reflects their degree of completeness. We then provide a logical characterization of this preorder. This characterization thus relates properties of less complete structures to properties of more complete structures. We present similar results for labeled transition systems and show a connection to intuitionistic modal logic. We also present a 3-valued CTL model checking algorithm, which returns ⊥ only when the partial state space lacks information needed for a definite answer about the complete state space.