A CSP model for hybrid automata

Authors:
Peter Amthor
Affiliations:
Bremen Institute for Safe Systems, Bremen
Venue:
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
Year:
1998

Citing 9
Cited 0

Communicating sequential processes

Communicating sequential processes
Algebraic theory of processes

Algebraic theory of processes
Specification and proof in real-time CSP

Specification and proof in real-time CSP
A formal description of hybrid systems

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Hybrid Systems I

Hybrid Systems I
Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A User Guide to HyTech

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This contribution aims to combine hybrid automata with CSP establishing a connection between the elements of hybrid automata and CSP processes using an approach for the decomposition of hybrid systems. As a result we obtain a transformation from hybrid automata into CSP processes, written in Hoare-CSP in the untimed parts and in real-time CSP or HCSP in the timed parts. These processes provide a basis to build up analysis mechanisms like animation and testing, converging in tool support for the specification, transformation, animation, implementation and test of hybrid systems.