We investigate the relationship between timed c/e systems 4] and timed automata 2]. We provide an eeective function that associates to each timed c/e system an \equivalent" timed automaton. Equivalence has to be understood here as describing essentially the same real{time behaviors. A beneet from providing such a function is that analysis tools developed for timed automata can now be applied to...

Interrupt Timed Automata (ITA ) form a subclass of stopwatch automata where reachability and some variants timed model checking are decidable even in presence parameters. They well suited to analyze real-time operating systems. Here we extend ITA with polynomial guards updates, leading the class (PolITA ). We prove that is 2EXPTIME on PolITA, using an adaptation cylindrical algebraic decomposit...

During the last years, weighted timed automata (WTA) have received much interest in the real-time community. Weighted timed automata form an extension of timed automata and allow us to assign weights (costs) to both locations and edges. This model, introduced by Alur et al. (2001) and Behrmann et al. (2001), permits the treatment of continuous consumption of resources and has led to much resear...

Abstract We present algorithms for model checking and controller synthesis of timed automata, seeing a automaton as parallel composition large finite-state machine relatively smaller automaton, using compositional reasoning on this composition. use automata learning to learn finite approximations the component, in order reduce problem at hand or synthesis. an experimental evaluation our approach.

Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equivalence. Thus we propose an extension of timed Petri nets with read-arcs (RA-TdPN), whose coverability problem is decidable. We also show that this model unifies timed Petri nets and timed automata. Then, we establish nu...

In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. Following the example of timed simulation between timed automata, we define timed alternating simulation as a preorder between timed game automata, which preserves controllability. We define a method to reduce the timed alternating simulation prob...

There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, we study models of timed finite state machines (TFSMs), i.e., FSMs enriched with time, which accept timed input words and generate timed output words. Here we discuss some models of TFSMs with a single clock: TFSMs wit...

Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterministic and probabilistic aspects of real-time systems, and is amenable to model checking against probabilistic timed temporal logic properties. In the case of classical (non-probabilistic) timed automata, it has been show...

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. In previous work, a probabilistic notion of time divergence for probabilistic timed automata has been considered, which requires the divergence of time with probability 1. We show that this notion can lead to cases in which the probabilistic timed automaton satisfies a correctness requiremen...