Valero, Valentín; Macià, Hermenegilda; Pardo, Juan José; Cambronero, María Emilia; Díaz, Gregorio Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets. (English) Zbl 1243.68042 Sci. Comput. Program. 77, No. 3, 290-313 (2012). Summary: A Web Service is a self-describing, self-contained modular application that can be published, located, and invoked over a network, such as the Internet. Web Service composition provides a way to obtain value-added services by combining different existing facilities, which are then able to support the integration of commercial applications. WS-CDL (web services choreography description language) is a W3C candidate recommendation for the description of peer-to-peer collaborations by participants in a web services composition. This paper focuses on several important aspects of WS-CDL, namely, data variables, timed restrictions, as well as the priorization of collaborations. In WS-CDL there are no priorities, thus, one of our first goals is to provide a WS-CDL definition of prioritized collaborations. We also define a semantics of WS-CDL (with priorities) by means of prioritized-timed colored Petri nets. MSC: 68M11 Internet topics 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) Keywords:web services; web service composition; priorities; choreography; timed colored Petri nets Software:BPEL2oWFN; M-nets; Reo PDFBibTeX XMLCite \textit{V. Valero} et al., Sci. Comput. Program. 77, No. 3, 290--313 (2012; Zbl 1243.68042) Full Text: DOI References: [1] Van Der Aalst, W. M. P.: Interval timed coloured Petri nets and their analysis, Lecture notes in computer science 691, 451-472 (1993) [2] Van Der Aalst, W. M. P.; Odijk, M. A.: Analysis of railway stations by means of interval timed coloured Petri nets, Real-time systems 9, 241-263 (1995) [3] W.M.P. van der Aalst, M. Dumas, C. Ouyang, A. Rozinat, H.M.W. Verbeek, Choreography conformance checking: an approach based on BPEL and Petri nets, in: Dagstuhl Seminar Proccedings 06291, The Role of Business Processes in SOA, 2006. http://drops.dagstuhl.de/opus/volltexte/2006/830. [4] Marsan, M. Ajmone; Balbo, G.; Bobbio, A.; Chiola, G.; Conte, G.; Cumani, A.: On Petri nets with stochastic timing, , 80-87 (1985) [5] Alonso, G.; Casati, F.; Kuno, H.; Machiraju, V.: Web services, (2002) [6] T. Andrews, et al., BPEL4WS–Business Process Execution Language for Web Services. Version 1.1, May 2003, http://www.ibm.com/developerworks/library/specification/ws-bpel/. [7] Arbab, F.: Reo: a channel-based coordination model for component composition, Mathematical structures in computer science 14, No. 3, 329-366 (2004) · Zbl 1085.68552 [8] Bause, F.: On the analysis of Petri nets with static priorities, Acta informatica 33, No. 7, 669-686 (1986) · Zbl 0849.68086 [9] Best, E.; Koutny, M.: Petri net semantics of priority systems, Theoretical computer science 96, 175-215 (1992) · Zbl 0753.68059 [10] Ben-Hafaiedh, I.; Graf, S.; Quinton, S.: Building distributed controllers for systems with priorities, Journal of logic and algebraic programming 80, No. 3–5, 194-218 (2011) · Zbl 1217.68057 [11] Best, E.; Devillers, R.; Koutny, M.: Petri net algebra, (2001) · Zbl 0968.68110 [12] Best, E.; Fraczak, W.; Hopkins, R. P.; Klaudel, H.; Pelz, E.: M-nets: an algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages, Acta informatica 35, No. 10, 813-857 (1998) · Zbl 0917.68160 [13] Bolognesi, T.; Lucidi, F.; Trigila, S.: From timed Petri nets to timed LOTOS, (1990) [14] Fred D.J. Bowden, Modelling time in Petri nets, in: Proc. Second Australia-Japan Workshop on Stochastic Models, 1996. [15] Brogi, A.; Canal, C.; Pimentel, E.; Vallecillo, A.: Formalizing web service choreography, Electronic notes in theoretical computer science (2004) · Zbl 1271.68083 [16] Bultan, T.; Fu, X.; Su, J.: Analyzing conversations of web services, IEEE Internet computing 10, No. 1, 18-25 (2006) [17] M. Carbone, K. Honda, N. Yoshida, Structured communication–centred programming for web services, in: ESOP, 2007, pp. 2–17. · Zbl 1187.68064 [18] CPN Tools homepage. www.cs.au.dk/CPNTools. [19] R. Hamadi, B. Benatallah, A Petri net-based model for web service composition, in: ADC’03: Proceedings of the 14th Australasian Database Conference, 2003. [20] Hoare, C. A. R.: Communicating sequential processes, (1985) · Zbl 0637.68007 [21] Jensen, K.: Coloured Petri nets. Basic concepts, analysis methods and practical use, Monographs in theoretical computer science (1997) · Zbl 0883.68098 [22] Jensen, K.; Kristensen, L. M.: Coloured Petri nets. Modelling and validation of concurrent systems, (2009) · Zbl 1215.68153 [23] C. Laneve, L. Padovani, Smooth orchestrators, in: FoSSaCS, 2006, pp. 32–46. · Zbl 1180.68195 [24] N. Lohmann, A feature-complete Petri net semantics for ws-bpel 2.0, in: Web Services and Formal Methods, 4th International Workshop, WS-FM 2007, Brisbane, Australia, September 28–29, 2007. Proceedings, 2007, pp. 77–91. [25] Martens, A.: Analyzing web service based business processes, Lecture notes in computer science 3442, 19-33 (2005) · Zbl 1119.68305 [26] P. Merlin, A study of the recoverability of communication protocols, Ph.D. Thesis, Univ. of California, 1974. [27] Milner, R.: Communication and concurrency, (1989) · Zbl 0683.68008 [28] Peterson, J. L.: Petri net theory and the modeling of systems, (1981) · Zbl 0461.68059 [29] Z. Qiu, X. Zhao, C. Cai, H. Yang, Towards the theoretical foundation of choreography, in: Proceedings of the 16th International Conference on World Wide Web, WWW 2007, 2007, pp. 973–982. [30] C. Ramchandani, Performance evaluation of asynchronous concurrent systems by timed Petri nets, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, 1973. · Zbl 0362.68090 [31] Roohi, N.; Salaün, G.; Mirian-Hosseinabadi, S.: Analyzing chor specifications by translation into FSP, Electronic notes in theoretical computer science 255, 159-176 (2009) · Zbl 1364.68143 [32] Salaun, G.; Bordeaux, L.; Schaerf, M.: Describing and reasoning on web services using process algebra, (2004) [33] Sifakis, J.: Use of Petri nets for performance evaluation, , 75-93 (1977) [34] Tasharofi, S.; Sirjani, M.: Formal modeling and conformance validation for WS-CDL using reo and CASM, Electronic notes in theoretical computer science 229, No. 2, 155-174 (2009) · Zbl 1347.68240 [35] J.P. Thomas, M. Thomas, G. Ghinea, Modeling of web services flow, in: IEEE International Conference on E-Commerce, Newport Beach, California, USA, June 2003, pp. 391–398. [36] H.M.W. Verbeek, W.M.P. van der Aalst, Analyzing BPEL processes using Petri nets, in: Proceedings of the Second International Workshop on Applications of Petri Nets to Coordination, Workflow and Business Process Management, 2005, pp. 59–78. [37] V. Valero, D. de Frutos, F. Cuartero, Decidability of the strict reachability problem for TPN’s with rational and real durations, in: Proc. 5th International Workshop on Petri Nets and Performance Models, 1993, pp. 56–65. [38] Wang, J.: Timed Petri nets, theory and application, (1998) · Zbl 0924.68147 [39] World Wide Web Consortium (W3C). http://www.w3.org/. [40] Web Services Choreography Description Language Version 1.0 (WS-CDL). http://www.w3.org/TR/ws-cdl-10/. [41] W3C. Web Services Description Language (WSDL). Version 1.1. http://www.w3.org/TR/wsdl/. · Zbl 0881.68019 [42] Web Service Choreography Interface (WSCI) 1.0. http://www.w3.org/TR/wsci/. [43] Yang, H.; Zhao, X.; Qiu, Z.; Pu, G.; Wang, S.: A formal model for web service choreography description language (WS-CDL), , 893-894 (2006) [44] Yeung, W. L.: Mapping WS-CDL and BPEL into CSP for behavioural specification and verification of web services, , 297-305 (2006) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.