Deriving Discrete Behavior of Hybrid Systems under Incomplete Knowledge

Kunihiko HIRAISHI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E87-A   No.11   pp.2913-2918
Publication Date: 2004/11/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Concurrent Systems and Hybrid Systems)
Category: Hybrid Systems
hybrid systems,  incomplete knowledge,  approximation,  constraint logic programming,  

Full Text: PDF>>
Buy this Article

We study analysis of hybrid systems under incomplete knowledge. The class of hybrid systems to be considered is assumed to have the form of a rectangular hybrid automaton such that each constant in invariants and guards is given as a parameter. We develop a method based on symbolic computation that computes an approximation of the discrete behavior of the automaton. We also show an implementation on a constraint logic programming language.