From interaction overview diagrams to temporal logic
MODELS'10 Proceedings of the 2010 international conference on Models in software engineering
Completeness of the bounded satisfiability problem for constraint LTL
RP'11 Proceedings of the 5th international conference on Reachability problems
The complexity of reversal-bounded model-checking
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Towards the UML-based formal verification of timed systems
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
A logic-based semantics for the verification of multi-diagram UML models
ACM SIGSOFT Software Engineering Notes
Satisfying requirements for pervasive service compositions
Proceedings of the 7th Workshop on Models@run.time
| Hi-index | 0.00 |
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 the Bounded Reachability problem, as shown by various experimental results.