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

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

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

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

We present a new decision procedure for finite-precision bitvector arithmetic with arbitrary bit-vector operations that uses automatic abstraction-refinement.Expand

Proceedings of the 19th Annual IEEE Symposium onâ€¦

2004

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