Infinite Games and Verification: Extended Abstract of a Tutorial
W Thomas - … Aided Verification: 14th International Conference, CAV …, 2002 - Springer
Infinite Games and Verification (Extended Abstract of a Tutorial) Page 1 Infinite Games and
Verification (Extended Abstract of a Tutorial) Wolfgang Thomas Lehrstuhl für Informatik VII …
Verification (Extended Abstract of a Tutorial) Wolfgang Thomas Lehrstuhl für Informatik VII …
Synthesis of reactive (1) designs
We address the problem of automatically synthesizing digital designs from linear-time
specifications. We consider various classes of specifications that can be synthesized with …
specifications. We consider various classes of specifications that can be synthesized with …
Breach, a toolbox for verification and parameter synthesis of hybrid systems
A Donzé - … Aided Verification: 22nd International Conference, CAV …, 2010 - Springer
Abstract We describe Breach, a Matlab/C++ toolbox providing a coherent set of simulation-
based techniques aimed at the analysis of deterministic models of hybrid dynamical …
based techniques aimed at the analysis of deterministic models of hybrid dynamical …
Synthesis of reactive (1) designs
N Piterman, A Pnueli, Y Sa'ar - … 2006, Charleston, SC, USA, January 8-10 …, 2006 - Springer
We consider the problem of synthesizing digital designs from their ltl specification. In spite of
the theoretical double exponential lower bound for the general case, we show that for many …
the theoretical double exponential lower bound for the general case, we show that for many …
UPPAAL-Tiga: Time for Playing Games! (Tool Paper)
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed
game automata with respect to reachability and safety properties. The first prototype …
game automata with respect to reachability and safety properties. The first prototype …
Efficient on-the-fly algorithms for the analysis of timed games
In this paper, we propose the first efficient on-the-fly algorithm for solving games based on
timed game automata with respect to reachability and safety properties The algorithm we …
timed game automata with respect to reachability and safety properties The algorithm we …
Fault diagnosis for timed automata
S Tripakis - Formal Techniques in Real-Time and Fault-Tolerant …, 2002 - Springer
We study the problem of fault-diagnosis in the context of dense-time automata. The problem
is, given the model of a plant as a timed automaton with a set of observable events and a set …
is, given the model of a plant as a timed automaton with a set of observable events and a set …
Moving horizon estimation for hybrid systems
G Ferrari-Trecate, D Mignone… - IEEE transactions on …, 2002 - ieeexplore.ieee.org
We propose a state-smoothing algorithm for hybrid systems based on moving-horizon
estimation (MHE) by exploiting the equivalence between hybrid systems modeled in the …
estimation (MHE) by exploiting the equivalence between hybrid systems modeled in the …
Scheduling with timed automata
In this work, we present timed automata as a natural tool for posing and solving scheduling
problems. We show how efficient shortest path algorithms for timed automata can find …
problems. We show how efficient shortest path algorithms for timed automata can find …
Effective synthesis of switching controllers for linear systems
In this paper, we suggest a novel methodology for synthesizing switching controllers for
continuous and hybrid systems whose dynamics are defined by linear differential equations …
continuous and hybrid systems whose dynamics are defined by linear differential equations …