Approximate Abstraction of Stochastic Hybrid Automata

  • A. Agung Julius
Conference paper

DOI: 10.1007/11730637_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3927)
Cite this paper as:
Julius A.A. (2006) Approximate Abstraction of Stochastic Hybrid Automata. In: Hespanha J.P., Tiwari A. (eds) Hybrid Systems: Computation and Control. HSCC 2006. Lecture Notes in Computer Science, vol 3927. Springer, Berlin, Heidelberg


This paper discusses a notion of approximate abstraction for linear stochastic hybrid automata (LSHA). The idea is based on the construction of the so called stochastic bisimulation function. Such function can be used to quantify the distance between a system and its approximate abstraction. The work in this paper generalizes our earlier work for jump linear stochastic systems (JLSS). In this paper we demonstrate that linear stochastic hybrid automata can be cast as a modified JLSS and modify the procedure for constructing the stochastic bisimulation function accordingly. The construction of quadratic stochastic bisimulation functions is essentially a linear matrix inequality problem. In this paper, we also discuss possible extensions of the framework to handle nonlinear dynamics and variable rate Poisson processes. As an example, we apply the framework to a chain-like stochastic hybrid automaton.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • A. Agung Julius
    • 1
  1. 1.Dept. Electrical and Systems EngineeringUniversity of PennsylvaniaPhiladelphiaUSA

Personalised recommendations