Approximated Symbolic Computations over Hybrid Automata

Alberto Casagrande
(University of Trieste)
Tommaso Dreossi
(University of Udine)
Carla Piazza
(University of Udine)

Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the real systems and infinite precision measurements. Such assumptions are not only unrealistic, but often lead to the construction of misleading models. For these reasons we believe that it is necessary to introduce more flexible semantics able to manage with noise, partial information, and finite precision instruments. In particular, in this paper we integrate in a single framework based on approximated semantics different over and under-approximation techniques for hybrid automata. Our framework allows to both compare, mix, and generalize such techniques obtaining different approximated reachability algorithms.

In Luca Bortolussi, Manuela L. Bujorianu and Giordano Pola: Proceedings Third International Workshop on Hybrid Autonomous Systems (HAS 2013), Rome, 17th March 2013, Electronic Proceedings in Theoretical Computer Science 124, pp. 43–57.
Published: 22nd August 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.124.6 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org