Asynchronous correspondences between hybrid trajectory semantics

DOI10.1007/978-3-031-22337-2_7zbMath1528.68180arXiv2209.14945OpenAlexW4312991606MaRDI QIDQ6113973

Patrick Cousot

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.14945

zbMATH Keywords

verificationdiscretizationhybrid systemsGalois connectionhomomorphismsimulationssemanticsbisimulationsrefinementabstractionabstract interpretationlogical relationGalois relationpreservations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites Work

• Approximate bisimulation: a bridge between computer science and control theory
• Approximate simulation relations for hybrid systems
• A theory of timed automata
• A syntactic approach to type soundness
• Switching in systems and control
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
• Hybrid action systems
• The structure of Galois connections
• A lattice-theoretical fixpoint theorem and its applications
• Introduction to Bisimulation and Coinduction
• On Timed Simulation Relations for Hybrid Systems and Compositionality
• Continuous Action System Refinement
• Formal Methods for the Design of Real-Time Systems
• Formal Modeling and Analysis of Timed Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asynchronous correspondences between hybrid trajectory semantics