This work presents a framework for model checking concurrent software systems which incorporates both states and events, and shows how standard automata-theoretic LTL model checking algorithms can be ported to this framework at no extra cost, enabling it to directly benefit from the large body of research on efficient LTL verification.Expand

It is shown that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity, and that model checking the safety fragment of MTL-which includes invariance and time-bounded response properties-is also decidable.Expand

The main result of the paper is that, even for unordered data domains, each of the three verification problems for data nets without whole-place operations has non-elementary complexity.Expand

It is proved that the complexity of standard SAT-based BMC is doubly exponential, and that consequently there is a complexity gap of an exponent between this procedure and standard LTL model checking.Expand

This paper surveys results about the complexity of the satisfiability and model checking problems for fragments of MTL with respect to different semantic models and shows that the most commonly occurring real-time properties can be expressed in fragments ofMTL for which model checking can be decided in polynomial or exponential space.Expand

This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques, and introduces two straightforward SAT encodings for Sudoku: the minimal encoding and the extended encoding.Expand

This paper presents a new procedure to perform this refinement operation for abstractions of hybrid systems, and shows how reachability computations with varying degrees of complexity can be used to refine hybrid system abstractions efficiently.Expand

It is shown that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity, and model checking the safety fragment of MTL--which includes invariance and time-bounded response properties--is also decidable.Expand

The problem of entailment in separation logic formulae is shown to be solved in polynomial time and it is shown that every satisfiable formula is equivalent to one whose graph is in a particular normal form.Expand

Experimental results suggest that this abstraction-based approach can be considerably more efficient than directly invoking the SAT solver on the original formula as well as other competing decision procedures.Expand