A computable and compositional semantics for hybrid systems

被引:0
作者
Bresolin, Davide [1 ]
Collins, Pieter [2 ]
Geretti, Luca [3 ]
Segala, Roberto [3 ]
Villa, Tiziano [3 ]
Gonzalez, Sanja Zivanovic [4 ]
机构
[1] Univ Padua, Padua, Italy
[2] Maastricht Univ, Maastricht, Netherlands
[3] Univ Verona, Verona, Italy
[4] AlphaStaff, Sunrise, FL USA
关键词
Hybrid automata; Composition; Computability; Computable analysis; REACHABILITY ANALYSIS; TEMPORAL LOGIC; VERIFICATION;
D O I
10.1016/j.ic.2024.105189
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Hybrid Systems are systems having a mixed discrete and continuous behaviour that cannot be characterised faithfully using either discrete or continuous models only. Due to the intrinsic complexity of hybrid systems, it is highly desirable to describe them compositionally, where large systems are seen as the composition of several simpler subparts that are studied independently. Furthermore, since several problems, including reachability, are undecidable for hybrid systems, the availability of approximate decision procedures is another important feature. In this paper, we propose a purely behavioural formalism for hybrid systems that is compositional and supports approximate decision procedures. The formalism is abstract and sufficiently general to subsume or be a semantic framework for most of the concrete formalisms or languages proposed in the literature. (c) 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页数:38
相关论文
共 50 条
  • [41] Compositional Analysis of Probabilistic Timed Graph Transformation Systems
    Maximova, Maria
    Schneider, Sven
    Giese, Holger
    FORMAL ASPECTS OF COMPUTING, 2023, 35 (03)
  • [42] On the Semantics and Verification of Normative Multi-Agent Systems
    Astefanoaei, Lacramioara
    Dastani, Mehdi
    Meyer, John-Jules
    de Boer, Frank S.
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2009, 15 (13) : 2629 - 2652
  • [43] Comparing Semantics of Logics for Multi-Agent Systems
    Valentin Goranko
    Wojciech Jamroga
    Synthese, 2004, 139 : 241 - 280
  • [44] Automated verification and synthesis of stochastic hybrid systems: A survey
    Lavaei, Abolfazl
    Soudjani, Sadegh
    Abate, Alessandro
    Zamani, Majid
    AUTOMATICA, 2022, 146
  • [45] Deadness and how to disprove liveness in hybrid dynamical systems
    Navarro-Lopez, Eva M.
    Carter, Rebekah
    THEORETICAL COMPUTER SCIENCE, 2016, 642 : 1 - 23
  • [46] Quantifier-free encoding of invariants for hybrid systems
    Cimatti, Alessandro
    Mover, Sergio
    Tonetta, Stefano
    FORMAL METHODS IN SYSTEM DESIGN, 2014, 45 (02) : 165 - 188
  • [47] From modelling control systems using grafcet to analyzing systems using hybrid automata
    Frensel, G
    Bruijn, PM
    PROCEEDINGS OF THE 1998 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 1998, : 704 - 705
  • [48] Compositional construction of infinite abstractions for networks of stochastic control systems
    Lavaei, Abolfaz
    Soudjani, Sadegh
    Zamani, Majid
    AUTOMATICA, 2019, 107 : 125 - 137
  • [49] Compositional Modeling and Control for Safety-Critical Manufacturing Systems
    Uygur, Guerkan
    Sattler, Sebastian M.
    2012 2ND INTERNATIONAL ELECTRIC DRIVES PRODUCTION CONFERENCE (EDPC), 2012,
  • [50] Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees
    Zikelic, Dorde
    Lechner, Mathias
    Verma, Abhinav
    Chatterjee, Krishnendu
    Henzinger, Thomas A.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,