Closed-loop learning of visual control policies
In this paper we present a general, flexible framework for learning map**s from images to
actions by interacting with the environment. The basic idea is to introduce a feature-based …
actions by interacting with the environment. The basic idea is to introduce a feature-based …
Omega-regular model checking
Abstract “Regular model checking” is the name of a family of techniques for analyzing infinite-
state systems in which states are represented by words or trees, sets of states by finite …
state systems in which states are represented by words or trees, sets of states by finite …
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
In this work we are concerned with the formal verification of two-dimensional non-
deterministic hybrid systems, namely polygonal differential inclusion systems (SPDIs). SPDIs …
deterministic hybrid systems, namely polygonal differential inclusion systems (SPDIs). SPDIs …
Verification of analog and mixed-signal circuits using timed hybrid petri nets
Embedded systems are composed of a heterogeneous collection of digital, analog, and
mixed-signal hardware components. This paper presents a method for the verification of …
mixed-signal hardware components. This paper presents a method for the verification of …
The power of hybrid acceleration
This paper addresses the problem of computing symbolically the set of reachable
configurations of a linear hybrid automaton. A solution proposed in earlier work consists in …
configurations of a linear hybrid automaton. A solution proposed in earlier work consists in …
Applying abstract acceleration to (co-) reachability analysis of reactive programs
P Schrammel, B Jeannet - Journal of Symbolic Computation, 2012 - Elsevier
Acceleration methods are commonly used for computing precisely the effects of loops in the
reachability analysis of counter machine models. Applying these methods on synchronous …
reachability analysis of counter machine models. Applying these methods on synchronous …
Don't care words with an application to the automata-based approach for real addition
J Eisinger, F Klaedtke - International Conference on Computer Aided …, 2006 - Springer
Abstract Automata are a useful tool in infinite-state model checking, since they can represent
infinite sets of integers and reals. However, analogous to the use of bdd s to represent finite …
infinite sets of integers and reals. However, analogous to the use of bdd s to represent finite …
Domain-specific regular acceleration
B Boigelot - International Journal on Software Tools for Technology …, 2012 - Springer
The regular model-checking approach is a set of techniques aimed at exploring symbolically
infinite state spaces. These techniques proceed by representing sets of configurations of the …
infinite state spaces. These techniques proceed by representing sets of configurations of the …
Extrapolating (omega-) regular model checking
A Legay - International Journal on Software Tools for Technology …, 2012 - Springer
Abstract (Omega-) Regular model checking is the name of a family of techniques in which
states are represented by words, sets of states by finite automata on these objects, and …
states are represented by words, sets of states by finite automata on these objects, and …
Don't care words with an application to the automata-based approach for real addition
J Eisinger, F Klaedtke - Formal Methods in System Design, 2008 - Springer
Abstract Automata have proved to be a useful tool in infinite-state model checking, since
they can represent infinite sets of integers and reals. However, analogous to the use of …
they can represent infinite sets of integers and reals. However, analogous to the use of …