Distributed Time-Asynchronous Automata

  title={Distributed Time-Asynchronous Automata},
  author={Catalin Dima and Ruggero Lanotte},
We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its related class of stopwatch automata. 
Distributed Event Clock Automata - Extended Abstract
Recursive Distributed Event Clock Automata (DECA) is proposed, a real-time logic with independent time evolutions that can be model-checked by translating a DECTL formula into a DECA automaton.
Timed Automata for the Development of Real-Time Systems
This paper presents a fairly comprehensive survey, comprised of eighty variants of timed automata, of the many dierent kinds of requirements of real-time system.
Automata and Logics for Concurrent Systems: Realizability and Verification
This habilitation thesis surveys several such extensions of classical automata, including pushdown automata with multiple stacks, communicating Automata with fixed, parameterized, or dynamic communication topology, and automata running on words over infinite alphabets.
A study on shuffle, stopwatches and independently evolving clocks
We show that stopwatch automata are equivalent with timed shuffle expressions, an extension of timed regular expressions with the shuffle operation. Since the emptiness problem is undecidable for
Avoiding Shared Clocks in Networks of Timed Automata
This work discusses a formalization of the problem and gives a criterion using the notion of contextual timed transition system, which represents the behavior of A2 when in parallel with A1, which effectively builds A′1∥A′2 when it exists.
Using Timed Automata for Modeling Distributed Systems with Clocks: Challenges and Solutions
This paper discusses how to model with timed automata the different types of relationships that may be found among the computer clocks of a distributed system, namely, ideal clocks, drifting clocks, and synchronized clocks.
Distributed Timed Automata with Independently Evolving Clocks
It is shown that the existential semantics always describes a regular set of behaviors in a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of the other components.
Regular set of representatives for time-constrained MSC graphs
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.


Distributed timed automata
  • P. Krishnan
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 1999
Computing reachability relations in timed automata
  • C. Dima
  • Computer Science
    Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
  • 2002
An algorithmic calculus of the reachability relations on clock values defined by timed automata is given, by computing unions, compositions and reflexive-transitive closure (star) of "atomic" relations.
An algebraic approach to data languages and timed languages
Timed regular expressions
In this article, we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to the timed
The Regular Real-Time Languages
A specification formalism for reactive systems defines a class of Ω-languages that are definable by fully decidable formalisms and has a decidable satisfiability (nonemptiness) problem.
A Theory of Timed Automata
Timed Shuffle Expressions
We show that stopwatch automata are equivalent to timed shuffle expressions, an extension of timed regular expressions with the shuffle operation. This implies that the emptiness problem for timed
Preemptive Job-Shop Scheduling Using Stopwatch Automata
In this paper we show how the problem of job-shop scheduling where the jobs are preemptible can be modeled naturally as a shortest path problem defined on an extension of timed automata, namely
Revisiting digitization, robustness, and decidability for timed automata
  • J. Ouaknine, J. Worrell
  • Computer Science
    18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
  • 2003
The robust semantics yields an undecidable (nonregular) discrete-time theory, in stark contrast with the standard semantics, which makes it virtually impossible to apply digitization techniques together with the robust semantics.
Model Checking Timed Automata
  • S. Yovine
  • Computer Science
    European Educational Forum: School on Embedded Systems
  • 1996
This paper surveys the different algorithms, data-structures and tools that have been proposed in the literature to solve the so-called reachability problem.