Abstract There has been a growing interest in defining models of automata enriched with time, such as finite extended clocks (timed automata). In this paper, we study deterministic timed state machines (TFSMs), i.e., single clock, guards and timeouts which transduce input words into output words. We solve the problem equivalence checking by bisimulation from FSMs to untimed ones vice versa. Mor...

Condition/Event systems 14] represent a continuous{time modeling framework used in control theory within the eld of discrete event dynamic systems. This model has been extended in 7] to include real{time aspects. Timed automata 2] are a widely accepted model for real{time systems. They have been intensively studied from diierent points of view leading to a variety of tools that analyze real{tim...

This paper is concerned with the universality problem for timed automata: given a timed automatonA, doesA accept all timed words? Alur and Dill have shown that the universality problem is undecidable if A has two clocks, but they left open the status of the problem when A has a single clock. In this paper we close this gap for timed automata over infinite words by showing that the one-clock uni...

We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automaton includes a control state, nitely many clock values and a stack word. Using a pure automata-theoretic approach, we show that the binary reachability (i.e., the set of all pairs of con gurations ( ; ), encoded as st...

We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A connguration of a discrete pushdown timed automaton includes a control state, nitely many clock values and a stack word. Using a pure automata-theoretic approach, we show that the binary reachability (i.e., the set of all pairs of conngurations (;), encoded as stri...

A proof system of timed bisimulation equivalence for timed automata is presented, based on a CCS-style regular language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. The proof...

In this paper we present a timed extension of the AltaRica language, Timed AltaRica, and describe the architecture of a compiler from Timed AltaRica to timed automata. We present the features of the language, namely modularity, hierarchical modeling and reuse of components during the specification phase, on an avionics example. Then, we use the compiler from Timed AltaRica to Timed Automata to ...

The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is translated to timed automata with discrete data, that is timed automata extended with integer variables. The translation enables verification of Promela specifications via tools accepting timed automata as input, such as Ver...