From synchronous programs to symbolic representations of hybrid systems
From MaRDI portal
Publication:2985863
DOI10.1145/1755952.1755960zbMath1361.68057OpenAlexW2149007581MaRDI QIDQ2985863
Klaus Schneider, Kerstin Bauer
Publication date: 10 May 2017
Published in: Proceedings of the 13th ACM international conference on Hybrid systems: computation and control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1755952.1755960
Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (3)
A type-based analysis of causality loops in hybrid systems modelers ⋮ A Formal Model for a Hybrid Programming Language ⋮ Towards a Modeling Language for Cyber-Physical Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- What's decidable about hybrid automata?
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Discrete-time control for rectangular hybrid automata
- Unfoldings: A partial-order approach to model checking.
- Marked directed graphs
- Stability Analysis of Networked Control Systems Using a Switched Linear Systems Approach
- Decentralized Control of Discrete-Event Systems With Bounded or Unbounded Delay Communication
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
This page was built for publication: From synchronous programs to symbolic representations of hybrid systems