Computing Approximating Automata for a Class of Hybrid Systems
Alongkrit Chutinan and
Bruce H. Krogh
Mathematical and Computer Modelling of Dynamical Systems, 2000, vol. 6, issue 1, 30-50
Abstract:
This paper presents a new algorithm for generating finite-state automata models of hybrid systems in which the continuous-state dynamics can be switched when the continuous-state trajectory generates threshold events. The automata state transitions correspond to threshold events and the automata states correspond to portions of the threshold surfaces in the continuous state space. The hybrid system dynamics are approximated by the automata models in the sense that the languages of threshold event sequences generated by the automata contain the threshold event language for the hybrid system. Properties of the algorithm for constructing and refining the approximating automata are demonstrated and the application of approximating automata for system verification is illustrated for a switching controller for an inverted pendulum. Relationships to other approaches to hybrid system synthesis and verification are also discussed.
Date: 2000
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1076/1387-3954(200003)6:1;1-Q;FT030 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:nmcmxx:v:6:y:2000:i:1:p:30-50
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/NMCM20
DOI: 10.1076/1387-3954(200003)6:1;1-Q;FT030
Access Statistics for this article
Mathematical and Computer Modelling of Dynamical Systems is currently edited by I. Troch
More articles in Mathematical and Computer Modelling of Dynamical Systems from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().