Model Checking LTL Using Constraint Programming
نویسندگان
چکیده
The model-checking problem for 1-safe Petri nets and linear-time temporal logic (LTL) consists of deciding, given a 1-safe Petri net and a formula of LTL, whether the Petri net satisses the property encoded by the formula. This paper introduces a semidecision test for this problem. By a semidecision test we understand a procedure which may answer`yes', in which case the Petri net satisses the property, or`don't know'. The test is based on a variant of the so called automata-theoretic approach to model-checking and on the notion of T-invariant. We analyse the computational complexity of the test, implement it using 2lp { a constraint programming tool, and apply it to two case studies.
منابع مشابه
S . Demri and R . Gascon Verification of qualitative Z constraints Research Report LSV - 05 - 07 June 2005
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparison constraints of the form x = y and x < y, it is closed under Boolean operations and it admits a restricted form of existential quantification. This is the largest set of qualitative constraints over Z known so far, ...
متن کاملModel Checking Timed LTL: A Logic Programming-based Approach
In this paper, first, we introduce a temporal logic for specification of real-time systems. Our logic, called RTLTL, is an extension of linear temporal logic (LTL) with clocks and clock operations adopted from timed automata. RTLTL is a natural and simple language for specifying properties of real time systems. Second, we develop a model checker for RTLTL based on logic programming. We show how...
متن کاملTowards a Notion of Unsatisfiable Cores for LTL
Unsatisfiable cores, i.e., parts of an unsatisfiable formula that are themselves unsatisfiable, have important uses in debugging specifications, speeding up search in model checking or SMT, and generating certificates of unsatisfiability. While unsatisfiable cores have been well investigated for Boolean SAT and constraint programming, the notion of unsatisfiable cores for temporal logics such a...
متن کاملVerification of Qualitative Constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparison constraints of the form x = y and x < y, it is closed under Boolean operations and it admits a restricted form of existential quantification. This is the largest set of qualitative constraints over Z known so far, ...
متن کاملS . Demri LTL over Integer Periodicity Constraints
Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. Although th...
متن کامل