Product Interval Automata: A Subclass of Timed Automata

  title={Product Interval Automata: A Subclass of Timed Automata},
  author={Deepak D'Souza and P. S. Thiagarajan},
We identify a subclass of timed automata and develop its theory. These automata, called product interval automata, consist of a network of timed agents. The key restriction is that there is just one clock for each agent and the way the clocks are read and reset is determined by the distribution of shared actions across the agents. We show that the resulting automata admit a clean theory in both logical and language-theoretic terms. It turns out that the study of these timed automata can exploit… 
Product interval automata
This work identifies a subclass of timed automata called product interval automata and develops its theory, and shows that the resulting automata are expressive enough to model the timed behaviour of asynchronous digital circuits.
Synchronous Composition of Finite Interval Automata
This work studies the class of real-time discrete-event systems modeled by finite interval automata, i.e., a finite state automaton where each transition is labeled by an event and an interval and distinguishes preempting transitions from non-preempting transitions.
On Continuous Timed Automata with Input-Determined Guards
A monadic second order logic characterization of the class of timed languages accepted by the corresponding class of automata parameterized by a set of input-determined operators, in a continuous time setting is shown.
On Timed Automata with Input-Determined Guards
This framework is used to show that the real-time logic MITL of Alur et al [2] is expressively complete with respect to an MSO corresponding to an appropriate set of input-determined operators.
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
This work shows an equivalence between ECMPA and a timed extension of monadic second-order (MSO) logic, and obtains such a constructive equivalence in two different ways: by restricting the semantics by bounding the set of timed partial orders; and by limiting the timed MSO logic to its existential fragment.
A Nonarchimedian Discretization for Timed Languages
  • C. Dima
  • Computer Science
    Fundam. Informaticae
  • 2003
It is shown that discretizations of timed automata are, in general, context- sensitive languages over context-sensitive languages over Σ ∪ {1,δ + ,δ −, and give a class of automata that equals the class of languages that are discretization of timed Automata, and show that their emptiness problem is decidable.
Survey A survey of timed automata for the development of real-time systems
This survey attempts to introduce a massive and complicated theoretical research area to a reader in an easy and compact manner about the theoretical properties and capabilities of timed automata which are (or might be) useful for real-time model driven development.
Supervisory Control of (max,+) automata: Timing aspects
(max,+) automata are used as a model of a class of timed discrete event systems and their supervisory control is developped and the concept of supervised product is introduced to control (max,+ automata) and its properties are studied.
Automata and Logics for Timed Message Sequence Charts
It is proved that, for (existentially) bounded channels, emptiness and satisfiability are decidable for the automata and logic of this timed model of communicating finite-state machines.


A Theory of Timed Automata
A Determinizable Class of Timed Automata
A translation from timed Transition systems to event-recording automata is presented, which leads to an algorithm for checking if two timed transition systems have the same set of timed behaviors.
Partial Order Reduction for Model Checking of Timed Automata
It is shown how this model can be used to perform model checking for an extension of linear temporal logic, which can express timing relations between events, based on a local-time semantics for networks of timed automata defined by Bengtsson et al.
State Clock Logic: A Decidable Real-Time Logic
The main contribution of this paper is to complete the framework of this class of determinizable automata with a temporal logic and to introduce the notion of event clock in the domain of temporal logic.
Automata on Infinite Objects
  • W. Thomas
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes
The problem of timed trace-inclusion is decidable for a large and natural class of processes in Reed and Roscoe's Timed CSP [RR86].
Timing analysis of asynchronous circuits using timed automata
These results, combined with recent results concerning the analysis and synthesis of timed automata, provide for the systematic Treatment of a large class of problems that could be treated by conventional simulation methods only in an ad-hoc fashion.
Partial Order Reductions for Timed Systems
This paper presents a partial-order reduction method for timed systems based on a local-time semantics for networks of timed automata, and presents a variant of DBM representation of symbolic states in the local time semantics for efficient implementation.
An Efficient Algorithm for Minimizing Real-time Transition Systems
We address the problem of performing simultaneously reachability analysis and minimization of real-time transition systems represented by timed automata, i.e., automata extended with a finite set of