Learn More
We present a general framework for the formal speciication and algorithmic analysis of hybrid systems. A h ybrid system consists of a discrete program with an analog environment. We m o d e l h ybrid systems as nite automata equipped with variables that evolve c o n tinuously with time according to dynamical laws. For veriication purposes, we restrict(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)
We study a process algebra ATP for the description and analysis of systems of timed processes. An important feature of the algebra is that its vocabulary of actions contains a distinguished element. An occurrence of is a time event representing progress of time. The algebra has, apart from standard operators of process algebras like CCS or ACP, a primitive(More)
We present a n o verview and synthesis of existing results about process algebras for the speciication and analysis of timed systems. The motivation is double: present a n o verview of some relevant and representative a p p r o a c hes and suggest a unifying framework for them. After presenting fundamental assumptions about timed systems and the nature of(More)
The paper presents results of ongoing work aiming at the unication of some behavioral description formalisms for timed systems. We propose for the algebra of timed processes ATP a very general semantics in terms of a time domain. It is then shown how ATP can be translated into a variant of timed graphs. This result allows the application of existing(More)
We propose a method for the implementation and analysis of real-time systems, based on the compilation of specications into extended automata. Such a method has been already adopted for the so called \synchronous" real-time programming languages. The method is illustrated for a simple specication language that can be viewed as the extension of a language(More)
This paper addresses the problem of automatizing the production of test sequences for reactive systems. We particularly focus on two points: (1) generating relevant inputs, with respect to some knowledge about the environment in which the system is intended to run; (2) checking the correctness of the test results, according to the expected behavior of the(More)
Architecture description languages are used to describe both the hardware and software architecture of an application, at system-level. The basic software components are intended to be developed independently, and then deployed on the described architecture. This separate development of the architecture and of the software raises the problem of early(More)