A computable and compositional semantics for hybrid systems

DOI10.1016/J.IC.2024.105189MaRDI QIDQ6614877zbMATH OpenFDO

Authors Davide Bresolin, Pieter Collins, Luca Geretti, Roberto Segala, Tiziano Villa, Sanja Živanović Gonzalez

Publication date 8 October 2024

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2024.105189

zbMATH Keywords

compositioncomputabilitycomputable analysishybrid automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A computable and compositional semantics for hybrid automata
• A higher order method for input-affine uncertain systems
• A modular formal semantics for Ptolemy
• Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
• Compositional modeling and refinement for hierarchical hybrid systems
• Computable analysis with applications to dynamic systems
• Continuity and computability of reachable sets
• Handbook of metric fixed point theory
• HRELTL: a temporal logic for hybrid systems
• scientific article; zbMATH DE number 1969324 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1794375 (Why is no real title available?)
• scientific article; zbMATH DE number 1444339 (Why is no real title available?)
• scientific article; zbMATH DE number 1444343 (Why is no real title available?)
• scientific article; zbMATH DE number 1444348 (Why is no real title available?)
• scientific article; zbMATH DE number 1444352 (Why is no real title available?)
• scientific article; zbMATH DE number 3395042 (Why is no real title available?)
• Hybrid I/O automata.
• Hybrid Systems: Computation and Control
• JuliaReach
• Modularity for timed and hybrid systems
• Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
• Robust satisfaction of temporal logic over real-valued signals
• Robustness of temporal logic specifications for continuous-time signals
• Semantics and computability of the evolution of hybrid systems
• Simulation-equivalent reachability of large linear systems with inputs
• Syntax and semantics of the compositional interchange format for hybrid systems
• The algorithmic analysis of hybrid systems
• The theory of Reich's fixed point theorem for multivalued operators
• What's decidable about hybrid automata?

This page was built for publication: A computable and compositional semantics for hybrid systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614877)