• Publications
  • Influence
State/Event-Based Software Model Checking
TLDR
We present a framework for model checking concurrent software systems which incorporates both states and events. Expand
  • 175
  • 26
  • PDF
On the decidability of metric temporal logic
  • J. Ouaknine, J. Worrell
  • Mathematics, Computer Science
  • 20th Annual IEEE Symposium on Logic in Computer…
  • 26 June 2005
TLDR
We show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. Expand
  • 183
  • 18
  • PDF
Nets with Tokens which Carry Data
TLDR
We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets and transfers are possible. Expand
  • 125
  • 17
  • PDF
Some Recent Results in Metric Temporal Logic
TLDR
We show that the most commonly occurring real-time properties, such as invariance and bounded response, can be expressed in fragments of MTL for which model checking can be decided in polynomial or exponential space. Expand
  • 150
  • 15
  • PDF
Completeness and Complexity of Bounded Model Checking
TLDR
We describe how to compute an over-approximation to \(\mathcal{CT\) for a general LTL property using Buchi automata, following the Vardi-Wolper LTL model checking framework. Expand
  • 124
  • 15
  • PDF
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
TLDR
This paper presents a new procedure to perform this refinement operation for abstractions of hybrid systems. Expand
  • 210
  • 12
  • PDF
Sudoku as a SAT Problem
TLDR
This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form, and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. Expand
  • 122
  • 11
  • PDF
On the decidability and complexity of Metric Temporal Logic over finite words
TLDR
In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. Expand
  • 111
  • 9
  • PDF
Deciding Bit-Vector Arithmetic with Abstraction
TLDR
We present a new decision procedure for finite-precision bitvector arithmetic with arbitrary bit-vector operations that uses automatic abstraction-refinement. Expand
  • 135
  • 9
  • PDF
On the language inclusion problem for timed automata: closing a decidability gap
TLDR
We solve the timed automaton language inclusion problem L(B) ⊆ L(A), in which A is assumed to have at most one clock, by converting it to a reachability problem on an infinite graph. Expand
  • 90
  • 9
  • PDF