Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Handbook of theoretical computer science (vol. B)
Fundamenta Informaticae - Special issue: logics for artificial intelligence
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Binary decision diagrams and beyond: enabling technologies for formal verification
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Formal Methods in System Design - Special issue on symmetry in automatic verification
Partial order reduction: linear and branching temporal logics and process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
A partial order approach to branching time logic model checking
Information and Computation
Model checking
Improving partial order reductions for universal branching time properties
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
A framework for multi-valued reasoning over inconsistent viewpoints
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Bounded model checking for the universal fragment of CTL
Fundamenta Informaticae
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Implementing a Multi-valued Symbolic Model Checker
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Efficient Multiple-Valued Model-Checking Using Lattice Representations
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Model-Checking over Multi-valued Logics
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Stubborn sets for reduced state space generation
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Exploiting Symmetry In Temporal Logic Model Checking
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Model Checking Using Adaptive State and Data Abstraction
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Compositional model checking of partially ordered state spaces
Compositional model checking of partially ordered state spaces
Bounded Model Checking for the Universal Fragment of CTL
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
On Designated Values in Multi-valued CTL^* Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Bounded Model Checking for Partial Kripke Structures
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Finding state solutions to temporal logic queries
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Deductive multi-valued model checking
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Multi-valued model checking games
Journal of Computer and System Sciences
Multi-valued model checking in dense-time
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On Designated Values in Multi-valued CTL^* Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Hi-index | 0.00 |
A multi-valued version of CTL* (mv-CTL*), where both the propositions and the accessibility relation are multi-valued taking values in a finite quasi-boolean algebra, is considered. A general translation from mv-CTL* to CTL* model checking is defined. An application of the translation is shown for the most commonly used quasi-boolean algebras.