2010 17th International Symposium on Temporal Representation and Reasoning 2010
DOI: 10.1109/time.2010.21
|View full text |Cite
|
Sign up to set email alerts
|

Bounded Reachability for Temporal Logic over Constraint Systems

Abstract: This paper defines CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. The paper introduces suitable restrictions and assumptions that make the satisfiability problem decidable in many cases, although the problem is undecidable in the general case. Decidability is shown for a large class of constraint systems, and an encoding into Boolean logic is defined. This paves the way for applying existing SMT-solvers for checking th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 21 publications
(23 citation statements)
references
References 21 publications
0
23
0
Order By: Relevance
“…Undecidability of the existential model-checking problem for CLTL(QFP) can be shown using the undecidability of the halting problem for Minsky machines. SMT solvers can be used for checking bounded reachability problems, see e.g., [5].…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…Undecidability of the existential model-checking problem for CLTL(QFP) can be shown using the undecidability of the halting problem for Minsky machines. SMT solvers can be used for checking bounded reachability problems, see e.g., [5].…”
Section: Preliminariesmentioning
confidence: 99%
“…Moreover, our results on the computational complexity guarantee that we are optimal. Another approach arises from Corollary 7 which takes advantage of the method for checking bounded reachability problems as developed in [5]. Since an instance of RBMC can be transformed into an instance of RB-REACH(QFP) and by Theorem 2, one could solve the reversal-bounded model checking problem by looking for finite runs of length at most doubly exponential.…”
Section: ])mentioning
confidence: 99%
See 1 more Smart Citation
“…Zot encodes satisfiability (and validity) problems for discrete-time TRIO formulae as propositional satisfiability (SAT) problems, which are then checked with off-the-shelf SAT solvers. More recently, we developed a more efficient encoding that exploits the features of Satisfiability Modulo Theories (SMT) solvers [2]. Through Zot one can verify whether stated properties hold for the system being analyzed (or parts thereof) or not; if a property does not hold, Zot produces a counterexample that violates it.…”
Section: Trio and Zotmentioning
confidence: 99%
“…5 All tests have been performed with a time bound of 50 time units (see [16] for the role of time bounds in Bounded Model/Satisfiabliity Checking), using the Common Lisp compiler SBCL 1.0.29.11 on a 2.80GHz Core2 Duo laptop with Linux and 4 GB RAM. The verification engine used was the SMT-based Zot plugin introduced in [2], with Microsoft Z3 2.8 (http://research.microsoft.com/enus/um/redmond/projects/z3/) as the SMT solver.…”
Section: Propertiesmentioning
confidence: 99%