Semi-algebraic constant reset hybrid automata - SACoRe

Alberto Casagrande, Carla Piazza, Bhubaneswar Mishra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we introduce and study a special class of hybrid automata, Semi-Algebraic Constant Reset hybrid automata (SACoRe). SACoRe automata are an extension of O-minimal semi-algebraic automata over the reals in the case of flows obtained from non-autonomous systems of differential inclusions. Even though SACoRe automata do not have the finite bisimulation property, they do admit decision procedures for reachability and model checking for a limited fragment of CTL, by combining Tarski's decidability result over the reals and Michael's selection theorem.

Original languageEnglish (US)
Title of host publicationProceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05
Pages678-683
Number of pages6
Volume2005
DOIs
Publication statusPublished - 2005
Event44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05 - Seville, Spain
Duration: Dec 12 2005Dec 15 2005

Other

Other44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05
CountrySpain
CitySeville
Period12/12/0512/15/05

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Casagrande, A., Piazza, C., & Mishra, B. (2005). Semi-algebraic constant reset hybrid automata - SACoRe. In Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05 (Vol. 2005, pp. 678-683). [1582234] https://doi.org/10.1109/CDC.2005.1582234