Modal I/O Automata for Interface and Product Line Theories

  • Kim G. Larsen
  • Ulrik Nyman
  • Andrzej Wąsowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4421)

Abstract

Alfaro and Henzinger use alternating simulation in a two player game as a refinement for interface automata [1]. We show that interface automata correspond to a subset of modal transition systems of Larsen and Thomsen [2], on which alternating simulation coincides with modal refinement. As a consequence a more expressive interface theory may be built, by a simple generalization from interface automata to modal automata. We define modal I/O automata, an extension of interface automata with modality. Our interface theory that follows can express liveness properties, disallowing trivial implementations of interfaces, a problem that exists for theories build around simulation preorders. In order to further exemplify the usefulness of modal I/O automata, we construct a behavioral variability theory for product line development.

References

  1. 1.
    Alfaro, L., Henzinger, T.A.: Interface automata. In: Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering (FSE), Vienna, Austria, pp. 109–120. ACM Press, New York (2001)Google Scholar
  2. 2.
    Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS, IEEE Computer Society Press, Los Alamitos (1988)Google Scholar
  3. 3.
    Chakabarti, A., et al.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, Springer, Heidelberg (2003)Google Scholar
  4. 4.
    Alfaro, L., Henzinger, T., Stoelinga, M.I.A.: Timed interfaces. In: Sangiovanni-Vincentelli, A.L., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol. 2491, Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Larsen, K.G., Nyman, U.: Interface input/output automata. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 82–97. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Černá, I., Vařeková, P., Zimmerová, B.: Component substitutability via equivalencies of component-interaction automata. In: FACS’06, pp. 115–130. To be published in ENTCS (2006)Google Scholar
  7. 7.
    Hermanns, H., Rehof, J., Stoelinga, M.I.A. (eds.): Workshop Procedings FIT 2005: Foundations of Interface Technologies. ENTCS. Elsevier Science Publishers, Amsterdam (2005)Google Scholar
  8. 8.
    Alur, R., et al.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 163–178. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. 9.
    Alfaro, L., Henzinger, T.A.: Interface-based design. In: Engineering Theories of Software Intensive Systems, Marktoberdorf Summer School, Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
  10. 10.
    Carrez, C., Fantechi, A., Najm, E.: Assembling components with behavioral contracts. Annales del Télécommunications 60(7–8) (2005)Google Scholar
  11. 11.
    Parnas, D.L.: On the design and development of program families. IEEE Transactions on Software Engineering 2, 1–9 (1976)CrossRefGoogle Scholar
  12. 12.
    Czarnecki, K., Eisenecker, U.W.: Generative Programming: Methods, Tools, and Applications. Addison-Wesley, Reading (2000)Google Scholar
  13. 13.
    Pohl, K., Böckle, G., van der Linden, F.: Software Product Line Engineering—Foundations, Principles, and Techniques. Springer, Heidelberg (2005)MATHGoogle Scholar
  14. 14.
    Larsen, K.G., Larsen, U., Wasowski, A.: Color-Blind Specifications for Transformations of Reactive Synchronous Programs. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 160–174. Springer, Heidelberg (2005)Google Scholar
  15. 15.
    Boudol, G., Larsen, K.G.: Graphical versus logical specifications. In: Arnold, A. (ed.) CAAP 1990. LNCS, vol. 431, pp. 57–71. Springer, Heidelberg (1990)Google Scholar
  16. 16.
    Larsen, K.G.: Modal specifications. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems. LNCS, vol. 407, pp. 232–246. Springer, Heidelberg (1990)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Kim G. Larsen
    • 1
  • Ulrik Nyman
    • 1
  • Andrzej Wąsowski
    • 1
    • 2
  1. 1.Department of Computer Science, Aalborg University 
  2. 2.Computational Logic and Algorithms Group, IT University of Copenhagen 

Personalised recommendations