Observability of hybrid automata by abstraction

被引：0

作者：

D'Innocenzo, A. ^{[1
]}

Di Benedetto, M. D. ^{[1
]}

Di Gennaro, S. ^{[1
]}

机构：

[1] Univ Aquila, Dept Elect Engn & Comp Sci, I-67100 Laquila, Italy

来源：

HYBRID SYSTEMS: COMPUTATION AND CONTROL, PROCEEDINGS | 2006年 / 3927卷

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we deal with the observability problem of a class of Hybrid Systems whose output is a timed string on a finite alphabet. We determine under which conditions it is always possible to immediately detect, using the observed output, when the system enters a given discrete state. We illustrate how to construct a Timed Automaton that is an abstraction of the given Hybrid System, and that preserves its observability properties. Moreover, we propose a verification algorithm with polynomial complexity for checking the observability of the Timed Automaton, and a constructive procedure for an observer of the discrete state.

引用

页码：169 / +

页数：3

共 19 条

[1] Discrete abstractions of hybrid systems [J].

Alur, R ;

Henzinger, TA ;

Lafferriere, G ;

Pappas, GJ .

PROCEEDINGS OF THE IEEE, 2000, 88 (07) :971-984

[2]

ANAI H, 2001, LNCS, V2034, P63, DOI DOI 10.1007/3-540-45351-2_9

[3]

Babaali M, 2005, LECT NOTES COMPUT SC, V3414, P103

[4]

Balluchi A, 2002, LECT NOTES COMPUT SC, V2289, P76

[5]

Chutinan A, 1998, IEEE DECIS CONTR P, P2089, DOI 10.1109/CDC.1998.758642

[6]

CHUTINAN A, 1998, LECT NOTES COMPUTER, P16

[7]

CLARKE EM, 2002, MODEL CHECKING

[8]

De Santis E, 2003, 42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, P5777

[9]

Di Benedetto MD, 2005, IEEE DECIS CONTR P, P7472

[10]

DIBENEDETTO MD, 2005, 13 MED C CONTR AUT L

← 1 2 →