Durational Actions Timed Automata: Determinization and Expressiveness

Abstract

In this paper we present durational actions timed automata, DATA*, as a sub class of timed automata. In the contrast of T.A, the underling semantic of DATA* is the maximality semantics which claim that actions have durations and true concurrency is captured differently from choice. DATA* model is in one hand useful for modeling and validating reel aspects of systems. In the other hand, it is determinizable and closed under all Boolean operations. As result, the language inclusion problem is decidable. Then, we compare a durational actions timed automata to event recording automata, which is a determinizable sub class of the classical timed automata. Next, we propose a simple framework to aggregate region of DATA* for reducing its space state. This study is based on an aggregation region automata procedure to reduce the combinatorial explosion of regions. Finally, we discuss equivalence and validation of systems.

True Concurrency Semantics

“…In the literature, the durational actions Timed Automata model (daTA) was proposed in the respect of those requirements, (Saidouni & Belala, 2006;Kitouni et al, 2012;Belala et al, 2013) they are a form of timed automata that admit a more natural representation of action durations and advocates carrying true concurrency. It's based on maximality semantics (Saidouni et al, 2008).…”

“…In (Saidouni & Courtiat, 2003) a realtime process language D-LOTOS is proposed supporting maximality semantics and daTA model has been defined (Saidouni & Belala, 2006). A nice characterization of the model was presented in (Kitouni et al, 2012) concerning determinizability and decidability of the model. More recently, daTA is defined as a semantic support of temporally timed Petri nets (Belala et al, 2013).…”

Relative Timed Model for Coordinated Multi Agent Systems

“…Maximality semantics has been proved necessary and sufficient for carrying both the refinement process and action durations. The daTA model has been defined and a nice characterization of the model was presented in [2] and [7]. So the concurrency aspect of MAS is modeled by the timed automata with action durations.…”

“…For this aim, timed models are suitable. The durational actions timed automata (daTA) [2] are a form of timed automata [1], that admits a more natural representation of action durations and advocates carrying true concurrency (which are realistic assumptions for specifying in natural way MAS). It's based on the Maximality semantics [4].…”