We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
A notion of diagnosability for hybrid systems is defined, which generalizes the notion of observability. We verify bility properties on a timed automaton abstraction of the origina...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...
We build on work in designing modeling languages for hybrid systems in the development of CTA, the Cottbus Timed Automata. Our design features a facility to specify a hybrid system...
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpreta...
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...