Summary: Membership Questions for Timed and Hybrid Automata
R. Alur \Lambda
University of Pennsylvania & Bell Labs
alur@cis.upenn.edu
R.P. Kurshan
Bell Labs
k@research.bell­labs.com
M. Viswanathan y
University of Pennsylvania
maheshv@cis.upenn.edu
Abstract
Timed and hybrid automata are extensions of finite­state
machines for formal modeling of embedded systems with
both discrete and continuous components. Reachability
problems for these automata are well studied and have been
implemented in verification tools. In this paper, for the
purpose of effective error reporting and testing, we con­
sider the membership problems for such automata. We con­
sider different types of membership problems depending on
whether the path (i.e. edge­sequence), or the trace (i.e.

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

Collections: Computer Technologies and Information Sciences