Learn More
We present a general framework for the formal speciication and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamical laws. For veriication purposes, we restrict ourselves to(More)
We describe nite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as nite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time speciication (given in an extension of CTL with clock variables). We d e v elop an algorithm(More)
This paper presents algorithms for the automatic synthesis of real-time controllers by nding a winning strategy for certain games deened by the timed-automata of Alur and Dill. In such games, the outcome depends on the players' actions as well as on their timing. W e believe that these results will pave t h e w ay for the application of program synthesis(More)
We present a methodology for modeling heterogeneous real-time components. Components are obtained as the superposition of three layers: behavior, specified as a set of transitions; Interactions between transitions of the behavior; Priorities, used to choose amongst possible interactions. A parameterized binary composition operator is used to compose(More)
We propose a framework for component-based modeling using an abstract layered model for components. A component is the superposition of two models: a behavior model and an interaction model. Interaction models describe architectural constraints induced by connectors between components. We propose and analyze general requirements for component composition(More)