{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:07:37Z","timestamp":1762459657427,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030047702"},{"type":"electronic","value":"9783030047719"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04771-9_24","type":"book-chapter","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T17:02:53Z","timestamp":1544029373000},"page":"320-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing the Parallelism Degree of Timed BPMN Processes"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Dur\u00e1n","sequence":"first","affiliation":[]},{"given":"Camilo","family":"Rocha","sequence":"additional","affiliation":[]},{"given":"Gwen","family":"Sala\u00fcn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,6]]},"reference":[{"key":"24_CR1","unstructured":"http:\/\/maude.lcc.uma.es\/MaudeBPMN\/"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(99)00206-6","volume":"236","author":"A Bouhoula","year":"2000","unstructured":"Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic. Theor. Comput. Sci. 236(1), 35\u2013132 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71999-1","volume-title":"All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic","author":"M Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic. LNCS, vol. 4350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71999-1"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Corradini, F., Fornari, F., Polini, A., Re, B., Tiezzi, F., Vandin, A.: BProVe: a formal verification framework for business process models. In: Proceedings of ASE, pp. 217\u2013228. IEEE Computer Society (2017)","DOI":"10.1109\/ASE.2017.8115635"},{"issue":"12","key":"24_CR5","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1016\/j.infsof.2008.02.006","volume":"50","author":"R Dijkman","year":"2008","unstructured":"Dijkman, R., Dumas, M., Ouyang, C.: Semantics and analysis of business process models in BPMN. Inf. Softw. Technol. 50(12), 1281\u20131294 (2008)","journal-title":"Inf. Softw. Technol."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.scico.2018.08.007","volume":"168","author":"F Dur\u00e1n","year":"2018","unstructured":"Dur\u00e1n, F., Rocha, C., Sala\u00fcn, G.: Stochastic analysis of BPMN with time in rewriting logic. Sci. Comput. Program. 168, 1\u201317 (2018)","journal-title":"Sci. Comput. Program."},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-59746-1_12","volume-title":"Coordination Models and Languages","author":"F Dur\u00e1n","year":"2017","unstructured":"Dur\u00e1n, F., Sala\u00fcn, G.: Verifying timed BPMN processes using Maude. In: Jacquet, J.-M., Massink, M. (eds.) COORDINATION 2017. LNCS, vol. 10319, pp. 219\u2013236. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59746-1_12"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"El-Saber, N., Boronat, A.: BPMN formalization and verification using Maude. In: Proceedings of BM-FA 2014, pp. 1\u20138. ACM (2014)","DOI":"10.1145\/2630768.2630769"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(97)00235-1","volume":"198","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Reachability in live and safe free-choice Petri nets is NP-complete. Theor. Comput. Sci. 198, 211\u2013224 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR10","unstructured":"ISO\/IEC. International Standard 19510, Information technology - Business Process Model and Notation (2013)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-23063-4_4","volume-title":"Business Process Management","author":"A Kheldoun","year":"2015","unstructured":"Kheldoun, A., Barkaoui, K., Ioualalen, M.: Specification and verification of complex business processes - a high-level Petri net-based approach. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 55\u201371. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23063-4_4"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-319-66845-1_21","volume-title":"Integrated Formal Methods","author":"A Krishna","year":"2017","unstructured":"Krishna, A., Poizat, P., Sala\u00fcn, G.: VBPMN: automated verification of BPMN processes (tool paper). In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 323\u2013331. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66845-1_21"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Mateescu, R., Sala\u00fcn, G., Ye, L.: Quantifying the parallelism in BPMN processes using model checking. In: Proceedings of CBSE 2014, pp. 159\u2013168. ACM (2014)","DOI":"10.1145\/2602458.2602473"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E Mayr","year":"1984","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73\u2013155 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.infsof.2011.08.004","volume":"54","author":"LEM Morales","year":"2012","unstructured":"Morales, L.E.M., Capel, M.I., P\u00e9rez, M.A.: Conceptual framework for business processes compositional verification. Inf. Soft. Technol. 54(2), 149\u2013161 (2012)","journal-title":"Inf. Soft. Technol."},{"issue":"1\u20132","key":"24_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10990-007-9001-5","volume":"20","author":"PC \u00d6lveczky","year":"2007","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: Semantics and pragmatics of real-time Maude. High.-Order Symbolic Comput. 20(1\u20132), 161\u2013196 (2007)","journal-title":"High.-Order Symbolic Comput."},{"key":"24_CR18","unstructured":"OMG. Business Process Model and Notation (BPMN) - Version 2.0, January 2011"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Poizat, P., Sala\u00fcn, G.: Checking the realizability of BPMN 2.0 choreographies. In: Proceedings of SAC 2012, pp. 1927\u20131934. ACM Press (2012)","DOI":"10.1145\/2245276.2232095"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25535-9_1","volume-title":"Service-Oriented Computing","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Su, J.: Computing degree of parallelism for BPMN processes. In: Kappel, G., Maamar, Z., Motahari-Nezhad, H.R. (eds.) ICSOC 2011. LNCS, vol. 7084, pp. 1\u201315. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25535-9_1"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-88194-0_22","volume-title":"Formal Methods and Software Engineering","author":"PYH Wong","year":"2008","unstructured":"Wong, P.Y.H., Gibbons, J.: A process semantics for BPMN. In: Liu, S., Maibaum, T., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 355\u2013374. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88194-0_22"},{"issue":"1","key":"24_CR22","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1108\/14637150910931479","volume":"15","author":"MT Wynn","year":"2009","unstructured":"Wynn, M.T., Verbeek, H.M.W., van der Aalst, W.M.P., ter Hofstede, A.H.M., Edmond, D.: Business process verification - finally a reality!. Bus. Process Manag. J. 15(1), 74\u201392 (2009)","journal-title":"Bus. Process Manag. J."}],"container-title":["Lecture Notes in Computer Science","Software Technologies: Applications and Foundations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04771-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T15:52:48Z","timestamp":1573055568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04771-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030047702","9783030047719"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04771-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"STAF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Federation of International Conferences on Software Technologies: Applications and Foundations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"staf2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.staf2018.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}