Model checking of MARTE/CCSL time behaviors using timed I/O automata

被引:8
|
作者
Chen, Bo [1 ]
Li, Xi [1 ]
Zhou, Xuehai [1 ]
机构
[1] Univ Sci & Technol China, Software Sch Engn, Hefei 230051, Anhui, Peoples R China
基金
中国国家自然科学基金;
关键词
UML/MARTE/CCSL; Timed IO automata; Timing behaviors;
D O I
10.1016/j.sysarc.2018.06.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Modelling and Analysis of Real-time and Embedded systems (MARTE) as a domain-specific language is widely used for designing, analysing, and the building of cyber physical systems (CPS). It also provides CCSL as a purely declarative language for expressing logical and chronometric constraints on clocks. Although MARTE/CCSL is powerful expressively, it lacks formal semantics-based language support for describing and analysing. Semantic support, such as timed Input/Output automata not only provides modelling and analysis of timing behaviors, it also provides modelling of the Input/Output behaviors in a direct sense compared to timed automata. The Input/Output behavior can verify the casual relationship between components, one of the most important behaviors is the fairness between components. Thus, to improve the capacity of modeling and verification of the MARTE/CCSL behavior model, we present a method to use MARTE/CCSL as a high level specification language for modelling, then mapping MARTE/CCSL behavior model to timed Input/Output automata, then using an integrated tool (UPPAAL-TIGA) to verify the safety, liveness, and fairness thereof. Finally, we demonstrate the proposed transformation method using a Telerobot control system of real-time systems.
引用
收藏
页码:120 / 125
页数:6
相关论文
共 50 条
  • [21] Dealing with practical limitations of distributed timed model checking for timed automata
    V. Braberman
    A. Olivero
    F. Schapachnik
    Formal Methods in System Design, 2006, 29 : 197 - 214
  • [22] Partial order reduction for model checking of timed automata
    Minea, M
    CONCUR '99: CONCURRENCY THEORY, 1999, 1664 : 431 - 446
  • [23] Model-checking timed automata with deadlines with Uppaal
    Gomez, Rodolfo
    FORMAL ASPECTS OF COMPUTING, 2013, 25 (02) : 289 - 318
  • [24] Symbolic model checking of finite precision timed automata
    Yan, RJ
    Li, GY
    Tang, ZS
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2005, 2005, 3722 : 272 - 287
  • [25] Methodologies for Specification of Real-Time Systems Using Timed I/O Automata
    David, Alexandre
    Larsen, Kim G.
    Legay, Axel
    Nyman, Ulrik
    Wasowski, Andrzej
    FORMAL METHODS FOR COMPONENTS AND OBJECTS, 2010, 6286 : 290 - +
  • [26] Counterexample generation for probabilistic timed automata model checking
    Department of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
    Jisuanji Yanjiu yu Fazhan, 2008, 10 (1638-1645):
  • [27] Weighted Timed Automata: Model-Checking and Games
    Bouyer, Patricia
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 158 (01) : 3 - 17
  • [28] Bounded Model Checking of an MITL Fragment for Timed Automata
    Kindermann, Roland
    Junttila, Tommi
    Niemela, Ilkka
    2013 13TH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD 2013), 2013, : 216 - 225
  • [29] Model Checking Weighted Integer Reset Timed Automata
    Manasa, Lakshmi
    Krishna, Shankara Narayanan
    Jain, Chinmay
    THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) : 648 - 679
  • [30] Model checking probabilistic timed automata in the presence of uncertainties
    Zhang, Junhua
    Huang, Zhiqiu
    Cao, Zining
    Xiao, Fangxiong
    Journal of Computational Information Systems, 2010, 6 (07): : 2231 - 2243