Event-B Refinement for Continuous Behaviours Approximation

被引:1
作者
Dupont, Guillaume [1 ]
Ait-Ameur, Yamine [1 ]
Pantel, Marc [1 ]
Singh, Neeraj K. [1 ]
机构
[1] Univ Toulouse, INPT ENSEEIHT IRIT, Toulouse, France
来源
AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2021 | 2021年 / 12971卷
关键词
Hybrid systems; Approximation; Event-B; Refinement; Proof;
D O I
10.1007/978-3-030-88885-5_21
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hybrid systems are systems that integrate both discrete and continuous behaviours. The hybrid nature of such systems renders them difficult to model and verify in a single formal method. One of the key point when modelling these continuous features is the richness of the behaviours they may exhibit. In practice, continuous dynamics are expressed using complex differential equations, and are often difficult to handle during the implementation and validation process. To overcome this issue, controller designers use approximation allowing to substitute dynamics that have a close behaviour. Despite that it is based on sound, exact mathematics, this operation is rarely rigorous, and is performed prior to controller design, making it implicit in the resulting system. In this paper, we propose a general formalised approach to approximation. It relies on the definition of a Galois connection, and refinement is used to embed it, explicitly, into a high-level development operation, associated to particular correctness constraints and useful properties. Two types of usage for approximation are presented and discussed in the light of existing cases studies, as to showcase their particularities on the modelling and proving sides.
引用
收藏
页码:320 / 336
页数:17
相关论文
共 14 条
  • [1] Abrial J.-R., 2010, Modeling in Event-B: System and Software Engineering
  • [2] THE ALGORITHMIC ANALYSIS OF HYBRID SYSTEMS
    ALUR, R
    COURCOUBETIS, C
    HALBWACHS, N
    HENZINGER, TA
    HO, PH
    NICOLLIN, X
    OLIVERO, A
    SIFAKIS, J
    YOVINE, S
    [J]. THEORETICAL COMPUTER SCIENCE, 1995, 138 (01) : 3 - 34
  • [3] Asarin E., 2002, Computer Aided Verification. 14th International Conference, CAV 2002. Proceedings (Lecture Notes in Computer Science Vol.2404), P365
  • [4] Trusting computations: A mechanized proof from partial differential equations to actual program
    Boldo, Sylvie
    Clement, Francois
    Filliatre, Jean-Christophe
    Mayero, Micaela
    Melquiond, Guillaume
    Weis, Pierre
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2014, 68 (03) : 325 - 352
  • [5] Butler Michael, 2013, Theories of Programming and Formal Methods. Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday. LNCS 8051, P67, DOI 10.1007/978-3-642-39698-4_5
  • [6] Dupont Guillaume, 2020, Formal Methods and Software Engineering. 22nd International Conference on Formal Engineering Methods, ICFEM 2020. Proceedings. Lecture Notes in Computer Science (LNCS 12531), P251, DOI 10.1007/978-3-030-63406-3_15
  • [7] Event-B Hybridation: A Proof and Refinement-based Framework for Modelling Hybrid Systems
    Dupont, Guillaume
    Ait-Ameur, Yamine
    Singh, Neeraj Kumar
    Pantel, Marc
    [J]. ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2021, 20 (04)
  • [8] An Event-B Based Generic Framework for Hybrid Systems Formal Modelling
    Dupont, Guillaume
    Ait-Ameur, Yamine
    Pantel, Marc
    Singh, Neeraj K.
    [J]. INTEGRATED FORMAL METHODS, IFM 2020, 2020, 12546 : 82 - 102
  • [9] Frehse Goran, 2011, Gopalakrishnan and Qadeer, P379, DOI DOI 10.1007/978-3-642-22110-1
  • [10] Approximate simulation relations for hybrid systems
    Girard, Antoine
    Julius, A. Agung
    Pappas, George J.
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2008, 18 (02): : 163 - 179