We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are “more concurrent”, in the sense that they always allow all the agents to act on the system, independently of the delay they want to elapse before their action. Timed CGSs weaken the “element of surprise” of timed game automata...

In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be d...

Background: Presynchronization could enhance fertility in timed breeding programs. The best presynchronization method has to justify biological requirements and to provide practical and economic advantages. OBJECTIVES: Present study investigated the effectiveness of presynchronization with equine chorionic gonadotropin (eCG) before ovsynch (eCG-ovsynch) compared to conventional presynch-ovsynch...

We study two questions in the theory of timed automata concerning timed language inclusion of real-time programs modeled as timed pushdown automata in real-time specifications with just one clock. We show that if the specification B is modeled as a timed automaton with one clock, then the language inclusion problem L(A) ⊆ L(B) for a timed pushdown automaton A is decidable. On the other hand, we...

This paper investigates the relations between timed event graphs and timed automata that describe discrete–event systems subject to faults. An algorithm is presented for transforming a timed event graph into an equivalent timed automaton. The relations among the models of the faulty systems provides the basis for comparing diagnostic methods that have been developed in the past for these two ti...

We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real-valued variables called clocks. Recursive timed automata are finite collections of timed automata extended with special states that correspond to (potentially recursive) invocations of other timed automata from their...

A timed extension to DILL (DIgital Logic in LOTOS) is discussed. The extension is based on ETLOTOS (Enhanced Timed LOTOS) and is used to specify timed digital logic. The approach places timing properties in two categories: timing constraints and delays. A parallel-serial model is used to form a timed specification by composing the functionality of a digital component with timing constraints and...

We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we introduce quasilinear equations over timed languages with regular coefficients. We prove that the minimal solution of such an equation is regular and give an algorithm to calculate this solution. This result is used to ob...

This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state space by considering partially ordered sets of events rather than linear sequences. This approach avoids the explosion of timed states typical of highly concurrent systems by dramatically reducing the ratio of timed sta...