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.
Research supported by the MSR Cambridge Project Napi, by the FET-GC Project IST-2001-32747 Agile, by the MIUR Project COFIN 2001013518 CoMeta, and by the MURST-CNR 1999 Project, Software Architectures on Cooperative WAN.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Inform. and Comput. 148(1), 1–70 (1999)
Asperti, A., Busi, N.: Mobile petri nets. Technical Report UBLCS96-10, University of Bologna (May 1996
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)
Best, E., Devillers, R., Hall, J.: The Petri Box Calculus: A new causal algebra with multi-label communication. 609, 21–69 (1992)
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)
bpel Specification. version 1.1. (May 2003), http://www-106.ibm.com/developerworks/webservices/library/ws-bpel/
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)
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)
Bruni, R., Melgratti, H., Montanari, U.: Nested commits for mobile calculi: extending Join (2003) (submitted)
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)
Bruni, R., Montanari, U.: Zero-safe nets: Comparing the collective and individual token approaches. Inform. and Comput. 156(1-2), 46–89 (2000)
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)
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)
Bruni, R., Montanari, U.: Concurrent models for linda with transactions. Math. Struct. in Comput. Sci. (2003) (to appear)
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)
Busi, N.: On zero safe nets. Private communication (April 1999)
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)
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)
Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)
Duggan, D.: An architecture for secure fault-tolerant global applications. TCS (to appear)
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)
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)
Gelernter, D.: Generative communication in Linda. ACM Transactions on Programming Languages and Systems 7(1), 80–112 (1985)
Jensen, K.: Coloured Petri Nets, Basic Concepts. EATCS Monographs on Theoretical Computer Science. SV (1992)
Leymann, F.: wsfl Specification. version 1.0. (May 2001), http://www-306.ibm.com/software/solutions/webservices/pdf/WSFL.pdf
Milner, R., Parrow, J., Walker, J.: A calculus of mobile processes, I and II. Inform. and Comput. 100(1), 1–40, 41–77 (1992)
Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn (1962)
Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)
Ristori, G.: Modelling Systems with Shared Resources via Petri Nets. PhD thesis, Computer Science Department, University of Pisa (1994)
Roxburgh, U.: Biztalk orchestration: Transactions, exceptions, and debugging. Microsoft Corporation (2001), Available at http://msdn.microsoft.com/library/en-us/dnbiz/html/bizorchestr.asp
Sun Microsystem, Inc. JavaSpacesTM service specifications, v.1.1 (2000)
Thatte, S.: xlang: Web Services for Business Process Design (2001), http://www.gotdotnet.com/team/xml_wsspecs/xlang-c/default.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bruni, R., Melgratti, H., Montanari, U. (2004). Extending the Zero-Safe Approach to Coloured, Reconfigurable and Dynamic Nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds) Lectures on Concurrency and Petri Nets. ACPN 2003. Lecture Notes in Computer Science, vol 3098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27755-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-27755-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22261-3
Online ISBN: 978-3-540-27755-2
eBook Packages: Springer Book Archive