Compositional Verification of Asynchronously Communicating Systems

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8997)

Abstract

Within a network of asynchronously communicating systems, the complete network is often not known, or even available at run-time. Consequently, verifying whether the network of communicating systems behaves correctly, i.e., the network does not contain any deadlock or livelock, is impracticable. As such systems are highly concurrent by nature, Petri nets form a natural choice to model these systems and their communication.

This paper presents a formal framework based on a generic communication condition to verify correctness of the system by pairwise checking whether these systems communicate correctly and fulfill some condition, then the whole network is guaranteed to behave correctly. As an example, this paper presents the elastic communication condition.

References

  1. 1.
    van der Aalst, W.M.P.: Verification of workflow nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  2. 2.
    van der Aalst, W.M.P.: Inheritance of interorganizational workflows: how to agree to disagree without loosing control? Inf. Technol. Manage. J. 4(4), 345–389 (2003)CrossRefGoogle Scholar
  3. 3.
    van der Aalst, W.M.P., Beisiegel, M., van Hee, K.M., König, D., Stahl, C.: An SOA-based architecture framework. Int. J. Bus. process Integr. Manage. 2(2), 91–101 (2007)CrossRefGoogle Scholar
  4. 4.
    van der Aalst, W.M.P., van Hee, K.M., Massuthe, P., Sidorova, N., van der Werf, J.M.: Compositional service trees. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 283–302. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    van der Aalst, W.M.P., Lohmann, N., Massuthe, P., Stahl, C., Wolf, K.: Multiparty contracts: agreeing and implementing interorganizational processes. Comput. J. 53(1), 90–106 (2010)CrossRefGoogle Scholar
  6. 6.
    de Alfaro, L., Henzinger, T.A.: Interface automata. SIGSOFT Softw. Eng. Notes 26(5), 109–120 (2001)CrossRefGoogle Scholar
  7. 7.
    Basten, T., van der Aalst, W.M.P.: Inheritance of behavior. J. Logic Algebraic Program. 47(2), 47–145 (2001)CrossRefMATHGoogle Scholar
  8. 8.
    Decker, G., Weske, M.: Local enforceability in interaction petri nets. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 305–319. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Fiadeiro, J.L., Lopes, A.: An interface theory for service-oriented design. Theor. Comput. Sci. 503, 1–30 (2013)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    van Glabbeek, R.J.: The linear time - branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66–81. Springer, Heidelberg (1993)Google Scholar
  11. 11.
    Gössler, G., Salaün, G.: Realizability of choreographies for services interacting asynchronously. In: Arbab, F., Ölveczky, P.C. (eds.) FACS 2011. LNCS, vol. 7253, pp. 151–167. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  12. 12.
    van Hee, K.M., Sidorova, N., van der Werf, J.M.: Construction of asynchronous communicating systems: weak termination guaranteed!. In: Baudry, B., Wohlstadter, E. (eds.) SC 2010. LNCS, vol. 6144, pp. 106–121. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  13. 13.
    Lohmann, N., Massuthe, P., Wolf, K.: Operating guidelines for finite-state services. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 321–341. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  14. 14.
    Lynch, N.A., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. In: 6th Annual ACM Symposium on Principles of Distributed Computing (1987)Google Scholar
  15. 15.
    Massuthe, P.: Operating guidelines for services. Ph.D. thesis, Technische Universiteit Eindhoven (2009)Google Scholar
  16. 16.
    Massuthe, P., Serebrenik, A., Sidorova, N., Wolf, K.: Can I find a partner? Undecidability of partner existence for open nets. Inf. Process. Lett. 108(6), 374–378 (2008)CrossRefMathSciNetGoogle Scholar
  17. 17.
    McIlroy, M.D.: Mass produced software components. In: Naur, P., Randell, B. (eds.) Proceedings of NATA Software Engineering Conference, Garmisch Germany, vol. 1, pp. 138–150 (1968)Google Scholar
  18. 18.
    Papazoglou, M.P.: Web Services: Principles and Technology. Pearson/Prentice Hall, Tappan (2007)Google Scholar
  19. 19.
    Reisig, W.: Petri Nets: An Introduction. Monographs in Theoretical Computer Science: An EATCS Series, vol. 4. Springer, Berlin (1985)Google Scholar
  20. 20.
    Stahl, C.: Service substitution. Ph.D. thesis, Technische Universiteit Eindhoven (2009)Google Scholar
  21. 21.
    Stahl, C., Massuthe, P., Bretschneider, J.: Deciding substitutability of services with operating guidelines. In: Jensen, K., van der Aalst, W.M.P. (eds.) Transactions on Petri Nets and Other Models of Concurrency II. LNCS, vol. 5460, pp. 172–191. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  22. 22.
    Szyperski, C.: Component Software - Beyond Object-Oriented Programming. Addison-Wesley/ACM Press, New York (1998)Google Scholar
  23. 23.
    Vogler, W.: Asynchronous communication of petri nets and the refinement of transitions. In: Kuich, W. (ed.) Automata, Languages and Programming. LNCS, vol. 623, pp. 605–616. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  24. 24.
    van der Werf, J.M.E.M.: Compositional design and verification of component-based information systems. Ph.D. thesis, Technische Universiteit Eindhoven (2011)Google Scholar
  25. 25.
    Wolf, K.: Does my service have partners? In: Jensen, K., van der Aalst, W.M.P. (eds.) Transactions on Petri Nets and Other Models of Concurrency II. LNCS, vol. 5460, pp. 152–171. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  26. 26.
    Wolf, K., Stahl, C., Weinberg, D., Ott, J., Danitz, R.: Guaranteeing weak termination in service discovery. Fundam. Inf. 108(1–2), 151–180 (2011)MATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Information and Computing ScienceUtrecht UniversityUtrechtThe Netherlands

Personalised recommendations