Formal Descriptions of Cyber Physical Systems Using Clock Theory
Cyber Physical Systems are in charge of the control of physical processes characterized by their own dynamics. This control must comply with timing constraints - sometimes stringent ones- imposed by the Cyber Physical Systems. It is crucial to address these timing issues as early as possible in the development process to detect inconsistencies in the requirements or in the constraints and to capture changes in the system. This paper aims to apply the clock theory to the specification of Cyber Physical Systems. To illustrate the concept we develop a well-known case study: the Steam Boiler Control System.
KeywordsCyber Physical Systems continuous discrete clock theory time analysis
Unable to display preview. Download preview PDF.
- 1.Kim, K.H.: Desirable Advances in Cyber-Physical System Software Engineering. In: 2010 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, pp. 2–4 (2010)Google Scholar
- 2.Kim, K.H.: Challenges and Future Directions of Cyber-Physical System Software. In: Proceedings of the 2010 34th Annual IEEE Computer Software and Applications Conference, pp. 10–13 (2010)Google Scholar
- 4.Chen, X., Liu, J., Mallet, F., Jin, Z.: Modeling Timing Requirements in Problem Frames Using CCSL. In: 2011 18th Asia-Pacific Software Engineering Conference, pp. 381–388 (2011)Google Scholar
- 5.He, J.: Link Continuous World with Discrete World. In: The 10th International Colloquium on Theoretical Aspects of Computing, Shanghai, China (unpublished, September 2013) (Keytalk)Google Scholar
- 7.Object Management Group, UML Profile for MARTE, v1.0.formal (2009)Google Scholar
- 8.Object Management Group. UML Profile for schedulability, performance, and time specification. OMG document: formal(v1.1) (2005) Google Scholar
- 9.Mallet, F., DeAntoni, J., André, C., de Simone, R.: The clock constraint specification language for building timed causality models. Innovations in Systems and Software Engineering 6, 99–106 (2010)Google Scholar
- 11.Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? In: Proceedings of the 27th Annual Symposium on Theory of Computing, pp. 373–382. ACM Press (1995)Google Scholar