Skip to main content
SpringerLink
Log in
Book cover

OTM Confederated International Conferences "On the Move to Meaningful Internet Systems"

OTM 2004: On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE pp 1502–1519Cite as

Checking Asynchronously Communicating Components Using Symbolic Transition Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3291))

Abstract

Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reuse, coordination, adaptation and verification issues. Such protocol languages often deal with synchronous communication. However, in the context of distributed systems, components communicating asynchronously through mailboxes are much more relevant. In this paper, we advocate for the use of Symbolic Transition Systems as a protocol language which may deal also with this kind of communication. We then present how this generic formalism, specialized with different mailbox protocols, may be used to address verification issues related to the component mailboxes.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The Fractal Composition Framework (June 2002), www.objectweb.org

  2. Abdulla, P.A., Annichini, A., Bensalem, S., Bouajjani, A., Habermehl, P., Lakhnech, Y.: Verification of infinite-state systems by combining abstraction and reachability analysis. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 146–159. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Aiguier, M., Barbier, F., Poizat, P.: A Logic with Temporal Glue for Mixed Specifications. In: FOCLASA 2003 – Foundations of Coordination Languages and Software Architectures. Electronic Notes in Theoretical Computer Science, vol. 97, pp. 155–174. Springer, Heidelberg (2005)

    Google Scholar 

  4. Aldrich, J., Chambers, C., Notkin, D.: ArchJava: connecting software architecture to implementation. In: Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), pp. 187–197. ACM Press, New York (2002)

    Chapter  Google Scholar 

  5. Allen, R., Douence, R., Garlan, D.: Specifying and Analyzing Dynamic Software Architectures. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol. 1382, pp. 21–37. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Arnold, A., Point, G., Griffault, A., Rauzy, A.: The altarica formalism for describing concurrent systems. FUNDINF: Fundamenta Informatica 34, 109–124 (2000)

    Google Scholar 

  7. Arnold, A.: Finite Transition Systems. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1994)

    MATH  Google Scholar 

  8. Astesiano, E., Krieg-Bruckner, B., Kreowski, H.-J. (eds.): Algebraic Foundations of System Specification. IFIP State-of-the-Art Reports. Springer, Heidelberg (1999) ISBN 3-540- 63772-9

    Google Scholar 

  9. Attiogbé, C., Poizat, P., Salaün, G.: Integration of Formal Datatypes within State Diagrams. In: FASE 2003 - Fundamental Approaches to Software Engineering, LNCS. vol. 2621, pp. 344–355. Springer, Heidelberg (2003)

    Google Scholar 

  10. Baude, F., Caromel, D., Morel, M.: From Distributed Objects to Hierarchical Grid Components. In: Meersman, R., Tari, Z., Schmidt, D.C. (eds.) CoopIS 2003, DOA 2003, and ODBASE 2003. LNCS, vol. 2888, pp. 1226–1242. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier, Amsterdam (2001)

    MATH  Google Scholar 

  12. Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2), 323–342 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  13. Calder, M., Maharaj, S., Shankland, C.: A Modal Logic for Full LOTOS Based on Symbolic Transition Systems. The Computer Journal 45(1), 55–61 (2002)

    Article  MATH  Google Scholar 

  14. Choppy, C., Poizat, P., Royer, J.-C.: A Global Semantics for Views. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 165–180. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Choppy, C., Poizat, P., Royer, J.-C.: Formal Specification of Mixed Components with Korrigan. In: Proceedings of the 8th Asia-Pacific Software Engineering Conference, APSEC 2001, pp. 169–176. IEEE, Los Alamitos (2001)

    Chapter  Google Scholar 

  16. Choppy, C., Poizat, P., Royer, J.-C.: Specification of Mixed Systems in KORRIGAN with the Support of a UML-Inspired Graphical Notation. In: Hussmann, H. (ed.) FASE 2001. LNCS, vol. 2029, pp. 124–139. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Emmerich, W., Kaveh, N.: F2: Component technologies: Java beans, COM, CORBA, RMI, EJB and the CORBA component model. In: Gruhn, V. (ed.) Proceedings of the Joint 8th European Software Engeneering Conference and 9th ACM SIGSOFT Symposium on the Foundation of Software Engeneering (ESEC/FSE 2001). SOFTWARE ENGINEERING NOTES, vol. 26(5), pp. 311–312. ACM Press, New York (2001)

    Google Scholar 

  18. Griffioen, W.O.D., Korver, H.P.: The bakery protocol:A comparative case-study in formal verification. In: van Vliet, J.C. (ed.) CSN 1995 (Computer Science in the Netherlands). Stichting Mathematisch Centrum, pp. 109–121 (1995)

    Google Scholar 

  19. Groote, J.F., Monin, F., van de Pol, J.: Checking Verifications of protocols and Distributed Systems by Computer. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 629–655. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  20. Harel, D.: Statecharts: A visual formulation for complex systems. Science of Computer Programming 8(3), 231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  21. Hennessy, M., Lin, H.: Symbolic Bisimulations. Theoretical Computer Science 138(2), 353–389 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  22. Ingolfsdottir, A., Lin, H.: A Symbolic Approach to Value-passing Processes. chapter Handbook of Process Algebra. Elsevier, Amsterdam (2001)

    Google Scholar 

  23. Jéron, T., Jard, C.: Testing for unboundedness of fifo channels. Theoretical Computer Science 113, 93–117 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  24. Kalibera, T., Tuma, P.: Distributed Component System Based on Architecture Description: The SOFA Experience. In: Meersman, R., Tari, Z., et al. (eds.) CoopIS 2002, DOA 2002, and ODBASE 2002. LNCS, vol. 2519, pp. 981–994. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  25. Leue, S., Mayr, R., Wei, W.: A scalable incomplete test for the boundedness of uml rt models. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 327–341. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  26. Luckham, D.C., Kenney, J.L., Augustin, L.M., Vera, J., Bryan, D., Mann, W.: Specification and analysis of system architecture using rapide. IEEE Transactions on Software Engineering 21(4), 336–355 (1995)

    Article  Google Scholar 

  27. Maréchal, O., Poizat, P., Royer, J.-C.: Checking Asynchronously Communicating Components Using Symbolic Transition Systems. Technical Report 04-06, Ecoles des Mines de Nantes (2004), http://www.emn.fr/x-info/jroyer extended version of the DOA 2004 paper

  28. Medvidovic, N., Taylor, R.N.: A classification and comparison framework for software architecture description languages. IEEE Transactions on Software Engineering 26(1), 70–93 (2000)

    Article  Google Scholar 

  29. Murata, T.: Petri nets: properties, analysis, and applications. Proceedings of the IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  30. Noyé, J., Pavel, S., Royer, J.-C.: A PVS Experiment with Asynchronous Communicating Components. In: 17th Workshop on Algebraic Development Techniques, Barcelona, Spain (2004), www.emn.fr/x-info/jroyer/rrWADT04.pdf.gz

  31. Poizat, P., Royer, J.-C., Salaün, G.: Formal Methods for Component Description, Coordination and Adaptation. In: WCAT 2004 - Int. Workshop on Coordination and Adaptation Techniques for Software Entities (2004)

    Google Scholar 

  32. Romkey, J.: SLIP Protocol Specification. Web document, www.faqs.org/ftp/rfc/pdf/rfc1055.txt.pdf

  33. Royer, J.-C.: The GAT Approach to Specify Mixed Systems. Informatica 27(1), 89–103 (2003)

    MATH  MathSciNet  Google Scholar 

  34. Royer, J.-C.: A framework for the gat temporal logic. In: ISCA (ed.) Proceedings of the 13th IASSE 2004 Conference (2004)

    Google Scholar 

  35. Royer, J.-C., Xu, M.: Analysing Mailboxes of Asynchronous Communicating Components. In: Meersman, R., Tari, Z., Schmidt, D.C. (eds.) CoopIS 2003, DOA 2003, and ODBASE 2003. LNCS, vol. 2888, pp. 1421–1438. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  36. von Bochmann, G.: A General Transition Model for Protocols and Communication Services. IEEE Transactions on Communications 28(4), 643–650 (1980)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. OBASCO Group, École des Mines de Nantes INRIA, 4, rue Alfred Kastler, BP 20722, F-44307, Nantes Cedex 3

    Olivier Maréchal & Jean-Claude Royer

  2. LaMI, UMR 8042 CNRS – Université d’Évry Val d’Essonne, Genopole – Tour Évry 2, 523 place des terrasses de l’Agora, F-91000, Évry Cedex

    Pascal Poizat

Authors
  1. Olivier Maréchal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Poizat
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Claude Royer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. STARLab, Vrije Universiteit Brussel (VUB), Bldg G/10, Pleinlaan 2, 1050, Brussels, Belgium

    Robert Meersman

  2. School of Computer Science and Information Technology, RMIT University, Bld 10.10, 376-392 Swanston Street, VIC 3001, Melbourne, Australia

    Zahir Tari

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maréchal, O., Poizat, P., Royer, JC. (2004). Checking Asynchronously Communicating Components Using Symbolic Transition Systems. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. OTM 2004. Lecture Notes in Computer Science, vol 3291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30469-2_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30469-2_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23662-7

  • Online ISBN: 978-3-540-30469-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation