A CSP Model for Hybrid Automata

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.

Contributors

Peter Amthor

Conference

Publication date: September 1998

Publication date (Print): September 1998

Pages: 1-15

Affiliations

Bremen Institute for Safe Systems, PO 330440, D-28334 Bremen http://www.informatik.uni-bremen.de/~amthor/

Article

DOI: 10.14236/ewic/NFM1998.2

Copyright statement: © Peter Amthor. Published by BCS Learning and Development Ltd. 3rd BCS-FACS Northern Formal Methods Workshop, Ilkley, UK

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: 3rd BCS-FACS Northern Formal Methods Workshop

Conference acronym: NFM

Conference number: 3

Conference location: Ilkley, UK

Conference date: 14-15 September 1998

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: BCS-FACS Northern Formal Methods Workshop

Product

Product Information: 1477-9358BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/NFM1998.2

Self URI (journal page): https://ewic.bcs.org/

Categories

Series title: Electronic Workshops in Computing