1 / 15

Component-Interaction Automata for Specification and Verification of Component Interactions

Component-Interaction Automata for Specification and Verification of Component Interactions. P. Vařeková and B. Zimmerova Masaryk University in Brno Czech Republic IFM, 2005. Content. Motivation slide 3 Specification languages 4 - 5

robyn
Télécharger la présentation

Component-Interaction Automata for Specification and Verification of Component Interactions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Component-Interaction Automata for Specification and Verification of Component Interactions P. Vařeková and B. Zimmerova Masaryk University in Brno Czech Republic IFM, 2005

  2. Content • Motivation slide 3 • Specification languages 4 - 5 • Component-Interaction automata 6 - 8 • Component-Interaction automata • Composition of Component-Interaction automata • Conclusion and future work 9

  3. Motivation • Component-based software systems (CBSs) • Component interactions in CBSs • Verification of interaction properties Specification languages • Architecture description languages (ADLs) • Automata-based languages 3

  4. Specification Languages - ADLs • Wright(R. J. Allen, 1997) • Darwin / Tracta(J. Magee, J. Kramer, • D. Giannakopulou, 1999) • SOFA(F. Plasil, S. Visnovsky, 2002) • + Hierarchical component architecture • + Supported by tools • + User friendly • - Verification of a small fixed set of properties 4

  5. Specification Languages – Automata-based languages • I/O automata(N. A. Lynch, M. R. Tuttle, 1987) • Interface automata(L. de Alfaro, T. A. Henzinger, 2001) • Team automata(C. Ellis, 1997) + General and formal + Verification of temporal properties • Specification of component interactions only • Composition not parameterised by assembly 5

  6. Component-Interaction Automata (CI automata) • Automata based language • Three types of actions • input, output, internal • CCS like synchronization • one input and one output action which becomes internal later on • Flexible composition • can be parameterised by characteristics of the system • Close to architecture description languages • can be semi-automatically transformed into CI automata • Close to Buchi automata • infinite traces 6

  7. Component-Interaction Automaton • Hierarchy • States (initial states) • Labels (structured - input, output, internal) • Labelled transitions • Component: Database Client • Hierarchy • States (initial states) • Labels (structured - input, output, internal) • Labelled transitions Component: Database Client 7

  8. Component-Interaction Automaton • Hierarchy • States (initial states) • Labels (structured - input, output, internal) • Labelled transitions Component: Database Client 7

  9. Component-Interaction Automaton • Hierarchy • States (initial states) • Labels (structured - input, output, internal) • Labelled transitions Component: Database Client 7

  10. Component-Interaction Automaton • Hierarchy • States (initial states) • Labels (structured - input, output, internal) • Labelled transitions Component: Database Client 7

  11. Composition of CI automata • every finite set of • CI automata can be composed • transition set of composed CI automaton complete transition space 8 • In figures, states ijk stands for (i, j, k)

  12. Composition of CI automata • every finite set of • CI automata can be composed • transition set of composed CI automaton complete transition space 8 • In figures, states ijk stands for (i, j, k)

  13. Composition of CI automata • every finite set of • CI automata can be composed • transition set of composed CI automaton complete transition space 8 • In figures, states ijk stands for (i, j, k)

  14. Conclusion and future work • CI automata • language for specification and verification of component interactions • Current work • equivalences and relations among CI automata • temporal logic • Future work • automatic transformation from ADL to CI automata • automatic transformation from CI automata to input language of model checking tools 9

  15. Properties verification • Transition of component-interaction automaton to input language of verification tool • Specification temporal properties G((2, ins, 1)  F(1, done, 2)) • Temporal verification, model checking (Divine) true 9

More Related