Relative time rates in dynamic timed automata

被引：0
作者：
Layadi S. [1 ]
Kitouni I. [1 ]
Belala N. [1 ]
Saïdouni D.-E. [1 ]
机构：
[1] MISC Laboratory, Constantine 2 University, Constantine
来源：
Layadi, Saïd (layadi@misc-umc.org) | 1600年 / Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland卷 / 17期
关键词：
Decidability; Distributed real-time systems; Dynamic timed automata; MANETs; Mobile ad hoc networks; Relative clock speeds;
D O I：
10.1504/IJCNDS.2016.10001615
中图分类号：
学科分类号：
摘要：
The verification of dynamic real-time systems, such as ad-hoc networks and ambient systems needs formal approaches and frameworks enabling tool construction. In this paper, the decidability question is addressed on a class of timed automata, the dynamic timed automata with relative time rates model (rd-TA). We introduce rd-TA as a simple extension of standard timed automata in which any process may spawn new processes. In this model, the distributed timed systems are formed by a set of dynamic timed automata. Each automaton is characterised by a set of local clocks that evolve at different but relative rate of the clocks of the other components. The main contribution is the consideration of slope parameter (which is the ratio of clock rates). This parameter helps us to explore the semantics based on region abstraction for decidability assessment and proof.
引用
收藏
页码：412 / 432
页数：20
相关论文
共 52 条
  • [1] Ahola J., Ambient intelligence: Plenty of challenges by 2010, Advances in Database Technology -EDBT 2002, (2002)
  • [2] Akshay S., Bollig B., Gastin P., Mukund M., Kumar K.N., Distributed timed automata with independently evolving clocks, CONCUR 2008-Concurrency Theory, pp. 82-97, (2008)
  • [3] Akshay S., Bollig B., Gastin P., Mukund M., Kumar K.N., Distributed timed automata with independently evolving clocks, Fundamenta Informaticae, 130, 4, pp. 377-407, (2014)
  • [4] Alur R., Dill D.L., A theory of timed automata, Theoretical Computer Science, 126, 2, pp. 183-235, (1994)
  • [5] Baier C., Katoen J.-P., Principles of Model Checking, (2008)
  • [6] Basagni S., Chlamtac I., Syrotiuk V., Location aware one-to-many communication in mobile multi-hop wireless networks, Proceedings of the 51st IEEE Semi-Annual Vehicular Technology Conference, VTC 2000, Spring, pp. 288-292, (2000)
  • [7] Bollig B., Helouet L., Realizability of dynamic MSC languages, Computer Science-Theory and Applications, pp. 48-59, (2010)
  • [8] Bollig B., Cyriac A., Helouet L., Kara A., Schwentick T., Dynamic communicating automata and branching high-level MSCs, Language and Automata Theory and Applications, pp. 177-189, (2013)
  • [9] Bouyer P., Haddad S., Reynier P.-A., Timed unfoldings for networks of timed automata, Automated Technology for Verification and Analysis, pp. 292-306, (2006)
  • [10] Chaouche A.C., Seghrouchni A.E.F., Ilie J.M., Saidouni D.E., A higher-order agent model with contextual planning management for ambient systems, Transactions on Computational Collective Intelligence XVI, pp. 146-169, (2014)
123456