Timed Automata with Action Durations – From Theory to Implementation

Guellati, Souad; Kitouni, Ilham; Matmat, Riadh; Saïdouni, Djamel Eddine

doi:10.1007/978-3-319-11958-8_8

Cited by 5 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The daTA model (durational actions timed automata) (Guellati et al, 2014) is a timed model defined by a timed transition system over an alphabet representing actions to be executed. This model takes into account in the specification, the duration of actions based on an intuitive idea: temporal and structural non-atomicity of actions.…”

Section: The Modelmentioning

confidence: 99%

“…In this paper we are interested by a subclass of timed automata model, named timed automata with durational actions (daTA). The daTA model (Belala et al, 2013;Guellati et al, 2014) are a form of timed automata that admit a more natural representation of action durations and advocates carrying true concurrency, which are realistic assumptions for specifying real-time systems. It's based on maximality semantics.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Towards an Optimal Generation of Zones Graph Relating Timed Bisimulation Relation and Distribution

Matmat

Kitouni

Eddine

2016

International Journal of Distributed Systems and Technologies

View full text Add to dashboard Cite

The timed automata are extensively used in different fields of formal validation in particular the model checking one. In this paper the authors are interested by a class of TA called durational actions timed automata (daTA) and the zones graph which represents an exact finite state abstraction based on what called Zones. The authors present a novel approach to construct a zone graph, based on the maximality semantics called maximality-based zone graph (MZG) by a local construction approach and they define timed maximality bisimulation relation for real-time model based on the maximality semantics. The authors propose a new method for distributed state space generation of maximality-based zone graph based on DHT structure. They also describe an implementation of this construction (DTaMaZG tool). The experiments given at the end of this article has shown good results especially when comparing with other works that have already proceed in the distributed generation of MLTS (Maximality based Labeled Transition Systems).

show abstract

Section: The Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Towards an Optimal Generation of Zones Graph Relating Timed Bisimulation Relation and Distribution

Matmat

Kitouni

Eddine

2016

International Journal of Distributed Systems and Technologies

View full text Add to dashboard Cite

show abstract

“…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.…”

Section: Introductionmentioning

confidence: 99%