Discrete Asymptotic Abstractions of Hybrid Systems. Piovesan, J., Tanner, H., & Abdallah, C. In Proceedings of the 45th IEEE Conference on Decision and Control, volume 88, pages 1–30, 2006. Issue: July ISSN: 01912216doi abstract bibtex In this paper we introduce the notion of finite time mode abstraction to relate a hybrid automaton to a timed automaton that preserves the stability and reachability properties of the former. The abstraction procedure discards the continuous dynamics of each mode in the hybrid automaton completely, keeping only the information about the maximum time in which the continuous state makes a discrete jump. This information is used to construct a timed automaton, based on the original hybrid automaton, and to prove that the stability and reachability properties of the original system are retained in the abstract timed automaton. In the process of abstracting a hybrid to a timed automaton we introduce a new notion of hybrid distance metric, which provides information about both the number of discrete transitions that a system would have to make to go from one hybrid state to another, and the distance between the continuous parts of such hybrid states
@inproceedings{piovesan_discrete_2006,
title = {Discrete {Asymptotic} {Abstractions} of {Hybrid} {Systems}},
volume = {88},
isbn = {1-4244-0171-2},
doi = {10.1109/CDC.2006.377733},
abstract = {In this paper we introduce the notion of finite time mode abstraction to relate a hybrid automaton to a timed automaton that preserves the stability and reachability properties of the former. The abstraction procedure discards the continuous dynamics of each mode in the hybrid automaton completely, keeping only the information about the maximum time in which the continuous state makes a discrete jump. This information is used to construct a timed automaton, based on the original hybrid automaton, and to prove that the stability and reachability properties of the original system are retained in the abstract timed automaton. In the process of abstracting a hybrid to a timed automaton we introduce a new notion of hybrid distance metric, which provides information about both the number of discrete transitions that a system would have to make to go from one hybrid state to another, and the distance between the continuous parts of such hybrid states},
booktitle = {Proceedings of the 45th {IEEE} {Conference} on {Decision} and {Control}},
author = {Piovesan, J.L. and Tanner, H.G. and Abdallah, C.T.},
year = {2006},
note = {Issue: July
ISSN: 01912216},
keywords = {abstraction, continuous, decidability, discrete abstractions, discrete systems, dynamics, hybrid systems, logic, model checking, o-minimal hybrid systems, rectangular hybrid systems, temporal logic, timed hybrid systems},
pages = {1--30}
}
Downloads: 0
{"_id":"iNRed4RFuSWDq8vZC","bibbaseid":"piovesan-tanner-abdallah-discreteasymptoticabstractionsofhybridsystems-2006","authorIDs":[],"author_short":["Piovesan, J.","Tanner, H.","Abdallah, C."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Discrete Asymptotic Abstractions of Hybrid Systems","volume":"88","isbn":"1-4244-0171-2","doi":"10.1109/CDC.2006.377733","abstract":"In this paper we introduce the notion of finite time mode abstraction to relate a hybrid automaton to a timed automaton that preserves the stability and reachability properties of the former. The abstraction procedure discards the continuous dynamics of each mode in the hybrid automaton completely, keeping only the information about the maximum time in which the continuous state makes a discrete jump. This information is used to construct a timed automaton, based on the original hybrid automaton, and to prove that the stability and reachability properties of the original system are retained in the abstract timed automaton. In the process of abstracting a hybrid to a timed automaton we introduce a new notion of hybrid distance metric, which provides information about both the number of discrete transitions that a system would have to make to go from one hybrid state to another, and the distance between the continuous parts of such hybrid states","booktitle":"Proceedings of the 45th IEEE Conference on Decision and Control","author":[{"propositions":[],"lastnames":["Piovesan"],"firstnames":["J.L."],"suffixes":[]},{"propositions":[],"lastnames":["Tanner"],"firstnames":["H.G."],"suffixes":[]},{"propositions":[],"lastnames":["Abdallah"],"firstnames":["C.T."],"suffixes":[]}],"year":"2006","note":"Issue: July ISSN: 01912216","keywords":"abstraction, continuous, decidability, discrete abstractions, discrete systems, dynamics, hybrid systems, logic, model checking, o-minimal hybrid systems, rectangular hybrid systems, temporal logic, timed hybrid systems","pages":"1–30","bibtex":"@inproceedings{piovesan_discrete_2006,\n\ttitle = {Discrete {Asymptotic} {Abstractions} of {Hybrid} {Systems}},\n\tvolume = {88},\n\tisbn = {1-4244-0171-2},\n\tdoi = {10.1109/CDC.2006.377733},\n\tabstract = {In this paper we introduce the notion of finite time mode abstraction to relate a hybrid automaton to a timed automaton that preserves the stability and reachability properties of the former. The abstraction procedure discards the continuous dynamics of each mode in the hybrid automaton completely, keeping only the information about the maximum time in which the continuous state makes a discrete jump. This information is used to construct a timed automaton, based on the original hybrid automaton, and to prove that the stability and reachability properties of the original system are retained in the abstract timed automaton. In the process of abstracting a hybrid to a timed automaton we introduce a new notion of hybrid distance metric, which provides information about both the number of discrete transitions that a system would have to make to go from one hybrid state to another, and the distance between the continuous parts of such hybrid states},\n\tbooktitle = {Proceedings of the 45th {IEEE} {Conference} on {Decision} and {Control}},\n\tauthor = {Piovesan, J.L. and Tanner, H.G. and Abdallah, C.T.},\n\tyear = {2006},\n\tnote = {Issue: July\nISSN: 01912216},\n\tkeywords = {abstraction, continuous, decidability, discrete abstractions, discrete systems, dynamics, hybrid systems, logic, model checking, o-minimal hybrid systems, rectangular hybrid systems, temporal logic, timed hybrid systems},\n\tpages = {1--30}\n}\n\n","author_short":["Piovesan, J.","Tanner, H.","Abdallah, C."],"key":"piovesan_discrete_2006","id":"piovesan_discrete_2006","bibbaseid":"piovesan-tanner-abdallah-discreteasymptoticabstractionsofhybridsystems-2006","role":"author","urls":{},"keyword":["abstraction","continuous","decidability","discrete abstractions","discrete systems","dynamics","hybrid systems","logic","model checking","o-minimal hybrid systems","rectangular hybrid systems","temporal logic","timed hybrid systems"],"downloads":0},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/tillhofmann","creationDate":"2019-12-09T14:42:18.165Z","downloads":0,"keywords":["abstraction","continuous","decidability","discrete abstractions","discrete systems","dynamics","hybrid systems","logic","model checking","o-minimal hybrid systems","rectangular hybrid systems","temporal logic","timed hybrid systems"],"search_terms":["discrete","asymptotic","abstractions","hybrid","systems","piovesan","tanner","abdallah"],"title":"Discrete Asymptotic Abstractions of Hybrid Systems","year":2006,"dataSources":["9pYjFWPBodPyDyb7N"]}