Readings in nonmonotonic reasoning
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
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated consistency checking of requirements specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using predicate abstraction to reduce object-oriented programs for model checking
FMSP '00 Proceedings of the third workshop on Formal methods in software practice
Automata, Languages, and Machines
Automata, Languages, and Machines
Verification of Switch-Level Designs with Many-Valued Logic
LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Validity Checking for Combinations of Theories with Equality
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
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
Efficient Multiple-Valued Model-Checking Using Lattice Representations
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Static determination of dynamic properties of generalized type unions
Proceedings of an ACM conference on Language design for reliable software
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
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Beyond vacuity: towards the strongest passing formula
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
Don't Know for Multi-valued Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Recognizable tree series with discounting
Acta Cybernetica
Latticed simulation relations and games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
DLT'10 Proceedings of the 14th international conference on Developments in language theory
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
Runtime Verification for LTL and TLTL
ACM Transactions on Software Engineering and Methodology (TOSEM)
Deductive multi-valued model checking
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Monitoring of real-time properties
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
Multi-valued model checking games
Journal of Computer and System Sciences
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
Approximating deterministic lattice automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Beyond vacuity: towards the strongest passing formula
Formal Methods in System Design
| Hi-index | 0.00 |
In analyzing infinite-state systems, it is often useful to define multiple-valued predicates. Such predicates can determine the (finite) levels of desirability of the current system state and transitions between them. We can capture multiple-valued predicates as elements of a logic defined over finite total orders (FTOs). In this paper we extend automata-theoretic LTL model-checking to reasoning about a class of multiple-valued logics. We also show that model-checking over FTOs is reducible to classical model-checking, and thus can be implemented in SPIN.