A simple approach for reducing timed automata

Kitouni, Ilham; Hachichi, Hiba; Eddine, Saidouni Djamel

doi:10.1109/icites.2012.6216600

Cited by 4 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They are widely studied as model in which the control of real time systems is finite. In fact timed automata are construction of both finite set of locations and finite set of clock variables (Kitouni et al, 2012). Each edge is specified by a label name which is an action (that is going to be executed) and clocks formula.…”

Section: Timed Automata (Alur and Dill 1994)mentioning

confidence: 99%

Two-Level Data Collection for an Energy-Efficient Solution in Wireless Sensor Networks

Benaziz

Kazar

Kahloul

et al. 2016

International Journal of Agricultural and Environmental Information Systems

View full text Add to dashboard Cite

Density in sensor networks often causes data redundancy, which is often the origin of high energy consumption. Data collection techniques are proposed to avoid retransmission of the same data by several sensors. In this paper, the authors propose a new data collection strategy based on static agents and clustering nodes in wireless sensor network (WSN) for an efficient energy consumption called: Two-Level Data Collection Strategy (TLDC). It consists in two-level hierarchy of nodes grouping. The technique is based on an experience building to perform a reorganization of the groups. Cooperation between agents can be used to reduce the communication cost significantly, by managing the data collection smartly. In order to validate the proposed scheme, the authors use the timed automata (TA) model and UPPAAL engine to validate the proposed strategy; the results after and before reorganization are compared. They establish that the proposed approach reduces the cost of communication in the group and thus minimizes the consumed energy.

show abstract

Section: Timed Automata (Alur and Dill 1994)mentioning

confidence: 99%

Two-Level Data Collection for an Energy-Efficient Solution in Wireless Sensor Networks

Benaziz

Kazar

Kahloul

et al. 2016

International Journal of Agricultural and Environmental Information Systems

View full text Add to dashboard Cite

show abstract

“…Concurrent actions have different representation by transitions systems from choice on actions [7]. This model seems interesting and funneling more and more research because it coated model of Timed Automata by maximality semantics [10,13,18,20,14].…”

Section: Durational Actions Timed Automatamentioning

confidence: 99%

Verification of Durational Action Timed Automata using UPPAAL

Guellati¹,

Kitouni²,

Saïdouni³

2012

IJCA

View full text Add to dashboard Cite

The increasing complexity of software is incessant, this phenomenon is even more accentuated when temporal aspects are introduced, hence the need for rigorous verification methods.The main purpose of this paper is to propose a quantitative verification approach based on model checking. Their properties are expressed in TCTL (Timed Computation Tree Logic) on real-time systems. The system behavior is expressed by temporal labeled systems; namely Durational Action Timed Automata model (DATA* model). This model supports the expression of the parallel behavior, the temporal and structural non-atomicity of actions and urgency.Our approach is to interpret the behavior described by DATA* to Timed Safety Automata. The environment UPPAAL allows us verifying quantitative temporal properties, especially the bounded liveliness.

show abstract

“…With this simple technique, the true concurrency is finely captured without heavy artefact. The model is interesting and attracting increasing research efforts because of how it extends timed automata with maximality semantics[7][9][13][14][25].…”

mentioning

confidence: 99%

Durational Actions Timed Automata: Determinization and Expressiveness

Kitouni¹,

Hachichi²,

Bouarroudj³

et al. 2012

IJAIS

View full text Add to dashboard Cite

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.

show abstract

A simple approach for reducing timed automata

Cited by 4 publications

References 15 publications

Two-Level Data Collection for an Energy-Efficient Solution in Wireless Sensor Networks

Two-Level Data Collection for an Energy-Efficient Solution in Wireless Sensor Networks

Verification of Durational Action Timed Automata using UPPAAL

Durational Actions Timed Automata: Determinization and Expressiveness

Contact Info

Product

Resources

About