IF: An intermediate representation and validation environment for timed asynchronous systems

被引:0
作者
Bozga, M
Fernandez, JC
Ghirvu, L
Graf, S
Krimm, JP
Mounier, L
机构
[1] VERIMAG, Ctr Equat, F-38610 Gieres, France
[2] IMAG, LSR, F-38402 St Martin Dheres, France
来源
FM'99-FORMAL METHODS | 1999年 / 1708卷
关键词
asynchrony; timed systems; timed automata; model-checking; static analysis;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Formal Description Techniques (FDT), such as LOTOS or SDL are at the base of a technology for the specification and the validation of telecommunication systems. Due to the availability of commercial tools, these formalisms are now being widely used in the industrial community. Alternatively, a number of quite efficient verification tools have been developed by the research community. But, most of these tools are based on simple ad hoc formalisms and the gap between them and real FDT restricts their use at industrial scale. This context motivated the development of an intermediate representation called IF which is presented in the paper. IF has a simple syntactic structure, but allows to express in a convenient way most useful concepts needed for the specification of timed asynchronous systems. The benefits of using IF are multiples. First, it is general enough to handle significant subsets of most FDTs, and in particular a translation from SDL to IF is already implemented. Being built upon a mathematically sound model (extended timed automata) it allows to properly evaluate different semantics for FDTs, in particular with respect to time considerations. Finally, IF can serve as a basis for interconnecting various tools into a unified validation framework. Several levels of IF program representations are already available via well defined APIs and allow to connect tools ranging from static analyzers to model-checkers.
引用
收藏
页码:307 / 327
页数:21
相关论文
共 50 条
  • [31] A new method for testing timed systems
    Bonifacio, Adilson Luiz
    Moura, Arnaldo Vieira
    [J]. SOFTWARE TESTING VERIFICATION & RELIABILITY, 2013, 23 (02) : 91 - 117
  • [32] Timed Systems through the Lens of Logic
    Akshay, S.
    Gastin, Paul
    Juge, Vincent
    Krishna, Shankara Narayanan
    [J]. 2019 34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2019,
  • [33] Abstraction of Dynamical Systems by Timed Automata
    Wisniewski, Rafael
    Sloth, Christoffer
    [J]. MODELING IDENTIFICATION AND CONTROL, 2011, 32 (02) : 79 - 90
  • [34] Probabilistic Timed Graph Transformation Systems
    Maximova, Maria
    Giese, Holger
    Krause, Christian
    [J]. GRAPH TRANSFORMATION, ICGT 2017, 2017, 10373 : 159 - 175
  • [35] OPTIMAL CONTROLLER SYNTHESIS FOR TIMED SYSTEMS
    Busatto-Gaston, Damien
    Monmege, Benjamin
    Reynier, Pierre-Alain
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 19 (01) : 20:1 - 20:77
  • [36] Timed behavior trees and their application to verifying real-time systems
    Grunske, Lars
    Winter, Kirsten
    Colvin, Robert
    [J]. 2007 AUSTRALIAN SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS, 2007, : 211 - +
  • [37] Randomized reachability analysis in UPPAAL: fast error detection in timed systems
    Andrej Kiviriga
    Kim Guldstrand Larsen
    Ulrik Nyman
    [J]. International Journal on Software Tools for Technology Transfer, 2022, 24 : 1025 - 1042
  • [38] Randomized reachability analysis in UPPAAL: fast error detection in timed systems
    Kiviriga, Andrej
    Larsen, Kim Guldstrand
    Nyman, Ulrik
    [J]. INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2022, 24 (06) : 1025 - 1042
  • [39] Using Timed Automata for Modeling Distributed Systems with Clocks: Challenges and Solutions
    Rodriguez-Navas, Guillermo
    Proenza, Julian
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2013, 39 (06) : 857 - 868
  • [40] Randomized Reachability Analysis in Uppaal: Fast Error Detection in Timed Systems
    Kiviriga, Andrej
    Larsen, Kim Guldstrand
    Nyman, Ulrik
    [J]. FORMAL METHODS FOR INDUSTRIAL CRITICAL SYSTEMS, FMICS 2021, 2021, 12863 : 149 - 166