TY - GEN

T1 - Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata

AU - Kim, Kyoung Dae

AU - Mitra, Sayan

AU - Kumar, P. R.

PY - 2011/5/20

Y1 - 2011/5/20

N2 - In a previous paper [7] we have identified a special class of linear hybrid automata, called Deterministic Transversal Linear Hybrid Automata, and shown that an ε-reach set up to a finite time, called a bounded ε-reach set, can be computed using infinite precision calculations. However, given the linearity of the system and the consequent presence of matrix exponentials, numerical errors are inevitable in this computation. In this paper we address the problem of determining a bounded ε-reach set using variable finite precision numerical approximations. We present an algorithm for computing it that uses only such numerical approximations. We further develop an architecture for such bounded ε-reach set computation which decouples the basic algorithm for an ε-reach set with given parameter values from the choice of several runtime adaptation needed by several parameters in the variable precision approximations.

AB - In a previous paper [7] we have identified a special class of linear hybrid automata, called Deterministic Transversal Linear Hybrid Automata, and shown that an ε-reach set up to a finite time, called a bounded ε-reach set, can be computed using infinite precision calculations. However, given the linearity of the system and the consequent presence of matrix exponentials, numerical errors are inevitable in this computation. In this paper we address the problem of determining a bounded ε-reach set using variable finite precision numerical approximations. We present an algorithm for computing it that uses only such numerical approximations. We further develop an architecture for such bounded ε-reach set computation which decouples the basic algorithm for an ε-reach set with given parameter values from the choice of several runtime adaptation needed by several parameters in the variable precision approximations.

KW - Deterministic discrete transition

KW - Linear hybrid automata

KW - Reachability

KW - Transversal discrete transition

UR - http://www.scopus.com/inward/record.url?scp=79956053288&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79956053288&partnerID=8YFLogxK

U2 - 10.1145/1967701.1967719

DO - 10.1145/1967701.1967719

M3 - Conference contribution

AN - SCOPUS:79956053288

SN - 9781450306294

T3 - HSCC'11 - Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control

SP - 113

EP - 122

BT - HSCC'11 - Proceedings of the 2011 ACM/SIGBED Hybrid Systems

T2 - 14th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2011

Y2 - 12 April 2011 through 14 April 2011

ER -