Stepwise refinement of parallel algorithms
Science of Computer Programming
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
General hybrid dynamical systems: modeling, analysis, and control
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Formal Development of Reactive Systems - Case Study Production Cell
Formal Development of Reactive Systems - Case Study Production Cell
From Action Systems to Modular Systems
FME '94 Proceedings of the Second International Symposium of Formal Methods Europe on Industrial Benefit of Formal Methods
Verification of Clocked and Hybrid Systems
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
Decentralization of process nets with centralized control
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Modular Design of Reactive Systems
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Towards reasoning about teleo-reactive programs for robust real-time systems
Proceedings of the 2008 RISE/EFTS Joint International Workshop on Software Engineering for Resilient Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Pliant modalities in hybrid event-B
Theories of Programming and Formal Methods
| Hi-index | 0.00 |
Action systems have been used successfully to describe discrete systems, i.e., systems with discrete control acting upon a discrete state space. In this paper we define continuous action systems that extend the action system approach to also model hybrid systems, i.e., systems with discrete control over a continuously evolving state. The semantics of continuous action systems is defined in terms of traditional action systems and their properties are proved using standard action systems proof techniques. We describe the essential features of continuous action systems, show that they can be used to describe a diverse range of hybrid systems and illustrate the framework by a collection of examples.