{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T07:10:08Z","timestamp":1743318608091,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311307"},{"type":"electronic","value":"9783642311314"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31131-4_7","type":"book-chapter","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T18:36:12Z","timestamp":1338921372000},"page":"108-127","source":"Crossref","is-referenced-by-count":0,"title":["Cost Soundness for Priced Resource-Constrained Workflow Nets"],"prefix":"10.1007","author":[{"given":"Mar\u00eda","family":"Martos-Salgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Rosa-Velardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., van Hee, K.M.: Workflow Management: Models, Methods, and Systems. MIT Press (2002)","DOI":"10.7551\/mitpress\/7301.001.0001"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00165-010-0161-4","volume":"23","author":"W.M.P. Aalst van der","year":"2011","unstructured":"van der Aalst, W.M.P., van Hee, K.M., ter Hofstede, A.H.M., Sidorova, N., Verbeek, H.M.W., Voorhoeve, M., Wynn, M.T.: Soundness of workflow nets: classification, decidability, and analysis. Formal Asp. Comput.\u00a023, 333\u2013363 (2011)","journal-title":"Formal Asp. Comput."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/11494744_15","volume-title":"Applications and Theory of Petri Nets 2005","author":"K.M. Hee van","year":"2005","unstructured":"van Hee, K.M., Serebrenik, A., Sidorova, N., Voorhoeve, M.: Soundness of Resource-Constrained Workflow Nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 250\u2013267. Springer, Heidelberg (2005)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13675-7_1","volume-title":"Applications and Theory of Petri Nets","author":"G. Juh\u00e1s","year":"2010","unstructured":"Juh\u00e1s, G., Kazlov, I., Juh\u00e1sov\u00e1, A.: Instance Deadlock: A Mystery behind Frozen Programs. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol.\u00a06128, pp. 1\u201317. Springer, Heidelberg (2010)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-21461-5_17","volume-title":"Formal Techniques for Distributed Systems","author":"M. Martos-Salgado","year":"2011","unstructured":"Martos-Salgado, M., Rosa-Velardo, F.: Dynamic Soundness in Resource-Constrained Workflow Nets. In: Bruni, R., Dingel, J. (eds.) FORTE\/FMOODS 2011. LNCS, vol.\u00a06722, pp. 259\u2013273. Springer, Heidelberg (2011)"},{"key":"7_CR6","series-title":"LNBIP","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-01112-2_18","volume-title":"Information Systems: Modeling, Development, and Integration","author":"P. Sampath","year":"2009","unstructured":"Sampath, P., Wirsing, M.: Computing the Cost of Business Processes. In: Yang, J., Ginige, A., Mayr, H.C., Kutsche, R.-D. (eds.) UNISCON 2009. LNBIP, vol.\u00a020, pp. 178\u2013183. Springer, Heidelberg (2009)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-75183-0_6","volume-title":"Business Process Management","author":"M. Magnani","year":"2007","unstructured":"Magnani, M., Montesi, D.: BPMN: How Much Does It Cost? An Incremental Approach. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol.\u00a04714, pp. 80\u201387. Springer, Heidelberg (2007)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Tahamtan, A., Oesterle, C., Tjoa, A.M., Hameurlain, A.: Bpel-time - ws-bpel time management extension. In: Zhang, R., Cordeiro, J., Li, X., Zhang, Z., Zhang, J. (eds.) ICEIS (3), pp. 34\u201345. SciTePress (2011)","DOI":"10.5220\/0003471000340045"},{"key":"7_CR9","first-page":"445","volume":"24","author":"K. Liu","year":"2010","unstructured":"Liu, K., Jin, H., Chen, J., Liu, X., Yuan, D., Yang, Y.: A compromised-time-cost scheduling algorithm in swindew-c for instance-intensive cost-constrained workflows on a cloud computing platform. IJHPCA\u00a024, 445\u2013456 (2010)","journal-title":"IJHPCA"},{"key":"7_CR10","unstructured":"Mukherjee, D.: QoS in WS-BPEL Processes. PhD thesis, Indian Institute Of Technology (2008)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-00596-1_25","volume-title":"Foundations of Software Science and Computational Structures","author":"P.A. Abdulla","year":"2009","unstructured":"Abdulla, P.A., Mayr, R.: Minimal Cost Reachability\/Coverability in Priced Timed Petri Nets. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 348\u2013363. Springer, Heidelberg (2009)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.ic.2010.11.003","volume":"209","author":"P.A. Abdulla","year":"2011","unstructured":"Abdulla, P.A., Delzanno, G., Begin, L.V.: A classification of the expressive power of well-structured transition systems. Inf. Comput.\u00a0209, 248\u2013279 (2011)","journal-title":"Inf. Comput."},{"key":"7_CR13","first-page":"251","volume":"88","author":"R. Lazic","year":"2008","unstructured":"Lazic, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Inform.\u00a088, 251\u2013274 (2008)","journal-title":"Fundam. Inform."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM Trans. Comput. Log. 11 (2010)","DOI":"10.1145\/1805950.1805953"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.tcs.2003.10.038","volume":"318","author":"R. Alur","year":"2004","unstructured":"Alur, R., Torre, S.L., Pappas, G.J.: Optimal paths in weighted timed automata. Theor. Comput. Sci.\u00a0318, 297\u2013322 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10703-007-0035-4","volume":"31","author":"P. Bouyer","year":"2007","unstructured":"Bouyer, P., Brihaye, T., Bruy\u00e8re, V., Raskin, J.F.: On the optimal reachability problem of weighted timed automata. Formal Methods in System Design\u00a031, 135\u2013175 (2007)","journal-title":"Formal Methods in System Design"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Mayr, R.: Computing optimal coverability costs in priced timed petri nets. In: LICS, pp. 399\u2013408. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.40"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Timed automata with observers under energy constraints. In: Johansson, K.H., Yi, W. (eds.) HSCC, pp. 61\u201370. ACM (2010)","DOI":"10.1145\/1755952.1755963"},{"key":"7_CR19","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS. LIPIcs, vol.\u00a08, pp. 505\u2013516. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23283-1_9","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"U. Fahrenberg","year":"2011","unstructured":"Fahrenberg, U., Juhl, L., Larsen, K.G., Srba, J.: Energy Games in Multiweighted Automata. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol.\u00a06916, pp. 95\u2013115. Springer, Heidelberg (2011)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Martos-Salgado, M., Rosa-Velardo, F.: Cost soundness for priced resource-constrained workflow nets (2012), http:\/\/antares.sip.ucm.es\/frosa\/","DOI":"10.1007\/978-3-642-31131-4_7"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256, 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"4439","DOI":"10.1016\/j.tcs.2011.05.007","volume":"412","author":"F. Rosa-Velardo","year":"2011","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of petri nets with unordered data. Theor. Comput. Sci.\u00a0412, 4439\u20134451 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R. Valk","year":"1985","unstructured":"Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in petri nets. Acta Inf.\u00a021, 643\u2013674 (1985)","journal-title":"Acta Inf."},{"key":"7_CR25","first-page":"329","volume":"88","author":"F. Rosa-Velardo","year":"2008","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Name creation vs. replication in petri net systems. Fundam. Inform.\u00a088, 329\u2013356 (2008)","journal-title":"Fundam. Inform."}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31131-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T10:34:07Z","timestamp":1743244447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31131-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311307","9783642311314"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31131-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}