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 条
  • [1] Verifying MARTE/CCSL Mode Behaviors Using UPPAAL
    Suryadevara, Jagadish
    Seceleanu, Cristina
    Mallet, Frederic
    Pettersson, Paul
    SOFTWARE ENGINEERING AND FORMAL METHODS, SEFM 2013, 2013, 8137 : 1 - 15
  • [2] Model Checking Coordination of CPS Using Timed Automata
    Jiang, Kaiqiang
    Guan, Chunlin
    Wang, Jiahui
    Du, Dehui
    2018 IEEE 42ND ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1, 2018, : 258 - 263
  • [3] Model checking for probabilistic timed automata
    Norman, Gethin
    Parker, David
    Sproston, Jeremy
    FORMAL METHODS IN SYSTEM DESIGN, 2013, 43 (02) : 164 - 190
  • [4] Model checking for probabilistic timed automata
    Gethin Norman
    David Parker
    Jeremy Sproston
    Formal Methods in System Design, 2013, 43 : 164 - 190
  • [5] Verified Model Checking of Timed Automata
    Wimmer, Simon
    Lammich, Peter
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2018, PT I, 2018, 10805 : 61 - 78
  • [6] Model checking prioritized timed automata
    Lin, SW
    Hsiung, PA
    Huang, CH
    Chen, YR
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2005, 3707 : 370 - 384
  • [7] Checking workflow schemas with time constraints using timed automata
    De Maria, E
    Montanari, A
    Zantoni, M
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2005: OTM 2005 WORKSHOPS, PROCEEDINGS, 2005, 3762 : 1 - 2
  • [8] Model checking timed automata with priorities using DBM subtraction
    David, Alexandre
    Hakansson, John
    Larsen, Kim G.
    Pettersson, Paul
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2006, 4202 : 128 - 142
  • [9] Timed Automata Based Model Checking of Timed Security Protocols
    Kurkowski, Miroslaw
    Penczek, Wojciech
    FUNDAMENTA INFORMATICAE, 2009, 93 (1-3) : 245 - 259
  • [10] Hypervolume approximation in timed automata model checking
    Braberman, Victor
    Obesl, Jorge Lucangeli
    Livero, Alfredo
    Schapachnik, Fernando
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2007, 4763 : 69 - +