Abstract
This paper presents an extension of the BIP component framework to hierarchical components by considering also port sets of atomic components to be structured (ports may be in conflict or ordered, where a larger port represents an interaction set with larger interactions). A composed component consisting of a set of components connected through BIP connectors and a set of ports representing a subset of the internal connectors and ports, has two semantics: one in terms if interactions as defined by the BIP semantics, and one in terms of the actions represented by external ports where the structure of the port set of the component is derived from the internal structure of the component.
A second extension consists in the addition of implicit interactions which is done through an explicit distinction of conflicting and concurrent ports: interactions involving only non conflicting ports can be executed concurrently without the existence of an explicit connector.
Finally, we define contract-based reasoning for component hierarchies.
This work has been partially financed by the project SPEEDS and the NoE Artist.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Badouel, E., Benveniste, A., Bozga, M., Caillaud, B., Constant, O., Josko, B., Ma, Q., Passerone, R., Skipper, M.: SPEEDS meta-model syntax and draft semantics. Deliverable D2.1c (February 2007)
Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time systems in BIP. In: 4th IEEE International Conference on Software Engineering and Formal Methods (SEFM06), Invited talk, September 11-15, 2006, Pune, pp. 3–12 (2006)
Bozga, M., Constant, O., Skipper, M., Ma, Q.: SPEEDS meta-model syntax and static semantics. Deliverable D2.1b (January 2007)
Bliudze, S., Sifakis, J.: The algebra of connectors structuring interaction in BIP. Techreport, Verimag (February 2007)
de Roever, W.P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. In: Nr 54 in Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge (2001)
Gößler, G., Graf, S., Majster-Cederbaum, M., Martens, M., Sifakis, J.: An approach to modeling and verification of component based systems. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, Springer, Heidelberg (2007)
Gößler, G., Sifakis, J.: Component-based construction of deadlock-free systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 2914, Springer, Heidelberg (2003)
Goessler, G., Sifakis, J.: Composition for component-based modeling. Science of Computer Programming, pp. 161–183 (March 2005)
Graf, S., Lüttgen, G., Steffen, B.: Compositional Minimisation of Finite State Systems using Interface Specifications. In: Formal Aspects of Computation, vol. 8, Appeared as Passauer Informatik Bericht MIP-9505 (1996)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1984)
Winskel, G., Nielsen, M.: Models for concurrency, vol. 4. Oxford Univ. Press, Oxford (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Graf, S., Quinton, S. (2007). Contracts for BIP: Hierarchical Interaction Models for Compositional Verification. In: Derrick, J., Vain, J. (eds) Formal Techniques for Networked and Distributed Systems – FORTE 2007. FORTE 2007. Lecture Notes in Computer Science, vol 4574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73196-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-73196-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73195-5
Online ISBN: 978-3-540-73196-2
eBook Packages: Computer ScienceComputer Science (R0)