Bounded Analysis and Decomposition for Behavioural Descriptions of Components.pdfVIP

Bounded Analysis and Decomposition for Behavioural Descriptions of Components Pascal Poizat , Jean-Claude Royer , and Gwen Sala¨un 1 IBISC - FRE 2873 CNRS ´ ´ Tour Evry 2, 523 place des terrasses de l’Agora, F-91000 Evry Cedex Pascal.Poizat@ibisc.univ-evry.fr 2 OBASCO Group, EMN - INRIA, LINA 4 rue Alfred Kastler, BP 20722, F-44307 Nantes Cedex 3 Jean-Claude.Royer@emn.fr 3 VASY Project, INRIA Rhˆone-Alpes 655 Avenue de l’Europe, F-38330 Montbonnot Saint-Martin Gwen.Salaun@inrialpes.fr Abstract. Explicit behavioural interfaces are now accepted as a manda- tory feature of components to address architectural analysis. Behavioural interface description languages should be able to deal with data types and with rich communication means. Symbolic Transition Systems (STS) support the definition of component models which take into account control, concurrency, communication and data types. However, verifica- tion of components described with protocol modelled by STS, especially model-checking, is difficult since they possibly involve different sources of infinity. In this paper, we propose the notions of bounded analysis and bounded decomposition. They can be used to test boundedness of systems and to generate finite simulations for them so that standard model-checking techniques may be applied for verification purposes. 1 Introduction Behavioural interface description languages and protocol descriptions are needed in component models to address architectural analysis and verification