The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
A Discipline of Programming
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
HYTECH: The Cornell HYbrid TECHnology Tool
Hybrid Systems II
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
An Action System Approach to the Steam Boiler Problem
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Decentralization of process nets with centralized control
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Theoretical Computer Science
Relating Hybrid Chi to Other Formalisms
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Action Systems is a predicate transformer based formalism. It supports the development of provably correct reactive and distributed systems by refinement. Recently, Action Systems were extended with a differential action. It is used for modelling continuous behaviour, thus, allowing the use of refinement in the development of provably correct hybrid systems, i.e, a discrete controller interacting with some continuously evolving environment. However, refinement as a method is concerned with correctness issues only. It offers very little guidance in what details one should consider during the refinement steps to make the system more robust. That information is revealed by robustness analysis. Other formalisms not supporting refinement do have tool support for automating the robustness analysis, e.g., HyTech for linear hybrid automata. Consequently, we study in this paper the non-trivial translation problem between Action Systems and linear hybrid automata. As the main contribution, we give and prove correct an algorithm that translates a linear hybrid action system to a linear hybrid automaton. With this algorithm we combine the strengths of the two formalisms: we may use HyTech for the robustness analysis to guide the development by refinement.