Stavros Tripakis

Learn More
KRONOS [6, 8] is a tool developed with the aim to assist the user to validate complex real-time systems. The tool checks whether a real-tinae system modeled by a t imed automaton [4] satisfies a timing property specified by a formula of the temporal logic TCTL [3]. KRONOS implements the symbolic model-checking algorithm presented in [11], where set of(More)
Kronos [8,10,7,11,20,16,4,3,9] is a software tool aiming at assisting designers of real-time systems to develop projects meeting the specified requirements. One major objective of Kronos is to provide a verification engine to be integrated into design environments for real-time systems in a wide range of application areas. Real-time communication protocols(More)
In this paper we study the problem of fault diagnosis in the context of dense-time automata. Our work is inspired from [SSL95, SSL96], who have studied the problem in the context of discrete event systems (DES) [RW87]. We stick to the terminology used in the above papers, although we find the term fault detection, rather than diagnosis, more appropriate.(More)
The objective of this paper is to show how veriication of dense-time systems modeled as timed automata can be performed using classical (i.e. untimed) veriication techniques. In that way, the existing rich infrastructure in algorithms and tools for the veriication of untimed systems can be exploited. The paper completes the ideas introduced in TY96]. Our(More)
ions for timed systems We de ne a number of di erent abstractions for timed systems and study the properties they preserve: Time-abstracting bisimulations are abstractions where the quantitative aspect of time is hidden away: we know that some time passes, but not how much. Of the three timeabstracting bisimulations de ned, the strong one preserves both(More)
We propose a new framework for black-box conformance testing of real-time systems. The framework is based on the model of partially-observable, non-deterministic timed automata. We argue that partial observability and non-determinism are essential features for ease of modeling, expressiveness and implementability. The framework allows the user to define,(More)
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (absence of deadlocks) and time progress (absence of deadlocks and timelocks) and give static sufficient conditions for a model of TA to be deadlockand timelock-free. We also(More)
We present a layered end-to-end approach for the design and implementation of embedded software on a distributed platform. The approach comprises a high-level modeling and simulation layer (Simulink), a middle-level programming and validation layer (SCADE/Lustre) and a low-level execution layer (TTA). We provide algorithms and tools to pass from one layer(More)