The hierarchical compositional interchange format

Authors:
Damian Nadales Agut;Bert van Beek;Harsh Beohar;Pieter Cuijpers;Jasper Fonteijn
Affiliations:
Eindhoven University of Technology (TU/e), The Netherlands;Eindhoven University of Technology (TU/e), The Netherlands;Eindhoven University of Technology (TU/e), The Netherlands;Eindhoven University of Technology (TU/e), The Netherlands;Eindhoven University of Technology (TU/e), The Netherlands
Venue:
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Year:
2010

Citing 7
Cited 0

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Theories of programming languages

Theories of programming languages
Hybrid I/O Automata Revisited

HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Modeling Heterogeneous Real-time Components in BIP

SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Notions of bisimulation and congruence formats for SOS with data

Information and Computation
Foundations of a compositional interchange format for hybrid systems

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

In computer science, the development of hierarchical automata / statecharts has lead to stepwise development of complex discrete systems. Such a concept is absent in the Compositional Interchange Format (CIF), which is a modelling language based on hybrid automata. In this article we extend the CIF language with the concept of hierarchy, which results in the Hierarchical Compositional Interchange format (HCIF). Syntactically, hierarchy is introduced by adding three concepts to CIF: a hierarchy function from a location to a HCIF composition, a termination predicate, and disruptive edges. The semantics of HCIF is given by means of Structural Operational Semantics rules. The semantics of a hierarchical automaton is defined in a compositional manner, by referring only to the transition system of the substructures, and not to their syntactic representation. This compositional introduction of hierarchy allows us to keep the semantics of the HCIF operators almost unchanged with respect to their CIF versions. Finally, a case-study called Patient Support System is modelled in HCIF to show its applicability.