@InProceedings{KMK:CDC2010,
  Title                    = {Bounded epsilon-Reachability of Linear Hybrid Automata with a Deterministic and Transversal Discrete Transition Condition},
  Author                   = {Kyoung-Dae Kim and Sayan Mitra and P. R. Kumar},
  Booktitle                = {Proceedings of The 49th IEEE Conference on Decision and Control (CDC)},
  Year                     = {2010},
  Publisher                = {IEEE},

  Abstract                 = {An epsilon-reach set of a hybrid automaton is a set of states such that every state in it is within epsilon-distance of some reachable state. We propose an algorithm to compute an epsilon-reach set from a given initial state of a class of deterministic linear hybrid automata that satisfy a certain transversality condition. The proposed algorithm is based on time-sampling. It over-approximates the reachable states at each sampled time instant using polyhedra, and subsequently computes an epsilon-reach set using these over-approximations, while reducing the sampling period on-the-fly.},
  Biburl                   = {http://users.crhc.illinois.edu/mitras/research.html},
  Keywords                 = {Hybrid systems, Verification},
  Owner                    = {mitras},
  Timestamp                = {2010.08.03},
  Url                      = {http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=05717209}
}