Advertisement

Extending the Zero-Safe Approach to Coloured, Reconfigurable and Dynamic Nets

  • Roberto Bruni
  • Hernán Melgratti
  • Ugo Montanari
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3098)

Abstract

As web applications become more and more complex, primitives for handling interaction patterns among independent components become essential. In fact, distributed applications require new forms of transactions for orchestrating the progress of their negotiations and agreements. Still we lack foundational models that accurately explain the crucial aspects of the problem. In this work we explore how to model transactions in coloured, reconfigurable and dynamic nets, (i.e., high-level/high-order Petri nets that can express mobility and can extend themselves dynamically during their execution). Starting from zero-safe nets – a well-studied extension of Place/Transition Petri nets with a transactional mechanism based on a distinction between consistent (observable) and transient (hidden) states – we show how the zero-safe approach can be smoothly applied to a hierarchy of nets of increasing expressiveness.

Keywords

Operational Semantic Coloured Version Mailing List Constant Colour Abstract Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Inform. and Comput. 148(1), 1–70 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Asperti, A., Busi, N.: Mobile petri nets. Technical Report UBLCS96-10, University of Bologna (May 1996Google Scholar
  3. 3.
    Baldan, P., Ehring, H., Heckel, R., Hoffmann, K., Ehrig, H.: High-level net processes. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 191–219. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Best, E., Devillers, R., Hall, J.: The Petri Box Calculus: A new causal algebra with multi-label communication.  609, 21–69 (1992)Google Scholar
  5. 5.
    Bocchi, L., Laneve, C., Zavattaro, G.: A calculus for long-running transactions. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 124–138. Springer, Heidelberg (2003) (to appear)CrossRefGoogle Scholar
  6. 6.
    bpel Specification. version 1.1. (May 2003), http://www-106.ibm.com/developerworks/webservices/library/ws-bpel/
  7. 7.
    Bruni, R., Laneve, C., Montanari, U.: Centralized and distributed orchestration of transactions in the jo in calculus. Technical Report TR-02-12, Computer Science Department, University of Pisa (2002)Google Scholar
  8. 8.
    Bruni, R., Laneve, C., Montanari, U.: Orchestrating transactions in join calculus. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 321–336. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Bruni, R., Melgratti, H., Montanari, U.: Nested commits for mobile calculi: extending Join (2003) (submitted)Google Scholar
  10. 10.
    Bruni, R., Montanari, U.: Executing transactions in zero-safe nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 83–102. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Bruni, R., Montanari, U.: Zero-safe nets: Comparing the collective and individual token approaches. Inform. and Comput. 156(1-2), 46–89 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Bruni, R., Montanari, U.: Transactions and zero-safe nets. In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2128, pp. 380–426. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Bruni, R., Montanari, U.: Zero-safe net models for transactions in Linda. In: Montanari, U., Sassone, V. (eds.) Proceedings of ConCoord 2001, International Workshop on Concurrency and Coordination. Elect. Notes in Th. Comput. Sci., vol. 54 (2001)Google Scholar
  14. 14.
    Bruni, R., Montanari, U.: Concurrent models for linda with transactions. Math. Struct. in Comput. Sci. (2003) (to appear)Google Scholar
  15. 15.
    Buscemi, M., Sassone, V.: High-level Petri nets as type theories in the Join calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 104–120. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  16. 16.
    Busi, N.: On zero safe nets. Private communication (April 1999)Google Scholar
  17. 17.
    Busi, N., Zavattaro, G.: On the serializability of transactions in javaspaces. In: Montanari, U., Sassone, V. (eds.) Elect. Notes in Th. Comput. Sci., vol. 54. Elsevier Science, Amsterdam (2001)Google Scholar
  18. 18.
    Butler, M., Chessell, M., Ferreira, C., Griffin, C., Henderson, P., Vines, D.: Extending the concept of transaction compensation. IBM Systems Journal 41(4), 743–758 (2002)CrossRefGoogle Scholar
  19. 19.
    Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  20. 20.
    Duggan, D.: An architecture for secure fault-tolerant global applications. TCS (to appear)Google Scholar
  21. 21.
    Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the Join calculus. In: Proceedings of POPL 1996, 23rd Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages, pp. 372–385. ACM Press, New York (1996)CrossRefGoogle Scholar
  22. 22.
    Garcia-Molina, H., Salem, K.: Sagas. In: Dayal, U., Traiger, I.L. (eds.) Proceedings of the ACM Special Interest Group on Management of Data Annual Conference, pp. 249–259. ACM Press, New York (1987)Google Scholar
  23. 23.
    Gelernter, D.: Generative communication in Linda. ACM Transactions on Programming Languages and Systems 7(1), 80–112 (1985)zbMATHCrossRefGoogle Scholar
  24. 24.
    Jensen, K.: Coloured Petri Nets, Basic Concepts. EATCS Monographs on Theoretical Computer Science. SV (1992)Google Scholar
  25. 25.
    Leymann, F.: wsfl Specification. version 1.0. (May 2001), http://www-306.ibm.com/software/solutions/webservices/pdf/WSFL.pdf
  26. 26.
    Milner, R., Parrow, J., Walker, J.: A calculus of mobile processes, I and II. Inform. and Comput. 100(1), 1–40, 41–77 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn (1962)Google Scholar
  28. 28.
    Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)zbMATHGoogle Scholar
  29. 29.
    Ristori, G.: Modelling Systems with Shared Resources via Petri Nets. PhD thesis, Computer Science Department, University of Pisa (1994)Google Scholar
  30. 30.
    Roxburgh, U.: Biztalk orchestration: Transactions, exceptions, and debugging. Microsoft Corporation (2001), Available at http://msdn.microsoft.com/library/en-us/dnbiz/html/bizorchestr.asp
  31. 31.
    Sun Microsystem, Inc. JavaSpacesTM service specifications, v.1.1 (2000)Google Scholar
  32. 32.
    Thatte, S.: xlang: Web Services for Business Process Design (2001), http://www.gotdotnet.com/team/xml_wsspecs/xlang-c/default.htm

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Roberto Bruni
    • 1
  • Hernán Melgratti
    • 1
  • Ugo Montanari
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaItaly

Personalised recommendations