Variants of LTL Query Checking
نویسندگان
چکیده
Given a model M and a temporal logic formula φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M |= φ[? ← f ]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study the question of whether there is a better solution than simply enumerating all possible formulas (modulo logical equivalence). It turns out that in most cases the answer is no, but there is one particular objective for which the answer – in practice – is definitely yes. The solution is based on a reduction to a Pseudo-Boolean Solving problem.
منابع مشابه
Model checking finite paths and trees
This thesis presents efficient parallel algorithms for checking temporal logic formulas over finite paths and trees. We show that LTL path checking is in AC(logDCFL) and CTL tree checking is in AC(logDCFL). For LTL with pasttime and bounded modalities, which is an exponentially more succinct logic, we show that the path checking problem remains in AC(logDCFL). Our results provide a foundation f...
متن کامل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...
متن کاملCombining Explicit and Symbolic Approaches for Better On-the-Fly LTL Model Checking
We present two new hybrid techniques that replace the synchronized product used in the automata-theoretic approach for LTL model checking. The proposed products are explicit graphs of aggregates (symbolic sets of states) that can be interpreted as Büchi automata. These hybrid approaches allow on the one hand to use classical emptiness-check algorithms and build the graph on-the-fly, and on the ...
متن کاملTest generation from P systems using model checking
This paper presents some testing approaches based on model checking and using different testing criteria. First, test sets are built from different Kripke structure representations. Second, various rule coverage criteria for transitional, non-deterministic, cell-like P systems, are considered in order to generate adequate test sets. Rule based coverage criteria (simple rule coverage, context de...
متن کاملInterval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison
In the last years, model checking with interval temporal logics is emerging as a viable alternative to model checking with standard point-based temporal logics, such as LTL, CTL, CTL∗, and the like. The behavior of the system is modelled by means of (finite) Kripke structures, as usual. However, while temporal logics which are interpreted “point-wise” describe how the system evolves state-by-st...
متن کامل