{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:14:35Z","timestamp":1790813675450,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_31","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"440-454","source":"Crossref","is-referenced-by-count":12,"title":["On Negotiation as Concurrency Primitive"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg","family":"Desel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","author":"W.M.P. Aalst van der","year":"1998","unstructured":"van der Aalst, W.M.P.: The application of Petri nets to workflow management. J. Circuits, Syst. and Comput.\u00a08(1), 21\u201366 (1998)","journal-title":"J. Circuits, Syst. and Comput."},{"issue":"3","key":"31_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. Comp.\u00a023(3), 333\u2013363 (2011)","journal-title":"Formal Asp. Comp."},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1142\/S0218843011002237","volume":"20","author":"E. Bacarin","year":"2011","unstructured":"Bacarin, E., Madeira, E.R.M., Medeiros, C.B., van der Aalst, W.M.P.: SpiCa\u2019s multi-party negotiation protocol: Implementation using YAWL. Int. J. Cooperative Inf. Syst.\u00a020(3), 221\u2013259 (2011)","journal-title":"Int. J. Cooperative Inf. Syst."},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/MS.2011.27","volume":"28","author":"A. Basu","year":"2011","unstructured":"Basu, A., Bensalem, S., Bozga, M., Combaz, J., Jaber, M., Nguyen, T.-H., Sifakis, J.: Rigorous component-based system design using the BIP framework. IEEE Software\u00a028(3), 41\u201348 (2011)","journal-title":"IEEE Software"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-540-47919-2_13","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"G. Berthelot","year":"1987","unstructured":"Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0254, pp. 359\u2013376. Springer, Heidelberg (1987)"},{"issue":"10","key":"31_CR6","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1109\/TC.2008.26","volume":"57","author":"S. Bliudze","year":"2008","unstructured":"Bliudze, S., Sifakis, J.: The algebra of connectors - structuring interaction in BIP. IEEE Trans. Computers\u00a057(10), 1315\u20131330 (2008)","journal-title":"IEEE Trans. Computers"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Extending the zero-safe approach to coloured, reconfigurable and dynamic nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 291\u2013327. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-27755-2_7"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Bruni, R., Montanari, U.: Executing transactions in zero-safe nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000, pp. 83\u2013102 (2000)","DOI":"10.1007\/3-540-44988-4_7"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Castagna, G., Dezani-Ciancaglini, M., Padovani, L.: On global types and multi-party session. Logical Methods in Computer Science\u00a08(1) (2012)","DOI":"10.2168\/LMCS-8(1:24)2012"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BFb0039059","volume-title":"CONCUR \u201990","author":"J. Desel","year":"1990","unstructured":"Desel, J.: Reduction and design of well-behaved concurrent systems. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 166\u2013181. Springer, Heidelberg (1990)"},{"key":"31_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526558","volume-title":"Free choice Petri nets","author":"J. Desel","year":"1995","unstructured":"Desel, J., Esparza, J.: Free choice Petri nets. Cambridge University Press, New York (1995)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Desel, J., Esparza, J.: On negotiation as concurrency primitive. Technical report, Technische Universit\u00e4t M\u00fcnchen, Germany (2013) Available via arxiv.org","DOI":"10.1007\/978-3-642-40184-8_31"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"van Dongen, B.F., van der Aalst, W.M.P., Verbeek, H.M.W.: Verification of EPCs: Using reduction rules and Petri nets. In: Pastor, \u00d3., Falc\u00e3o e Cunha, J. (eds.) CAiSE 2005. LNCS, vol.\u00a03520, pp. 372\u2013386. Springer, Heidelberg (2005)","DOI":"10.1007\/11431855_26"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(84)90137-3","volume":"30","author":"H.J. Genrich","year":"1984","unstructured":"Genrich, H.J., Thiagarajan, P.S.: A theory of bipolar synchronization schemes. Theor. Comput. Sci.\u00a030, 241\u2013318 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-52494-0_31","volume-title":"Advances in Petri Nets 1989","author":"S. Haddad","year":"1990","unstructured":"Haddad, S.: A reduction theory for coloured nets. In: Rozenberg, G. (ed.) APN 1989. LNCS, vol.\u00a0424, pp. 209\u2013235. Springer, Heidelberg (1990)"},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/S0129626406002502","volume":"16","author":"S. Haddad","year":"2006","unstructured":"Haddad, S., Pradat-Peyre, J.-F.: New efficient Petri nets reductions for parallel programs verification. Parallel Processing Letters\u00a016(1), 101\u2013116 (2006)","journal-title":"Parallel Processing Letters"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: Necula, G.C., Wadler, P. (eds.) POPL, pp. 273\u2013284. ACM (2008)","DOI":"10.1145\/1328897.1328472"},{"key":"31_CR18","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)","edition":"3"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-03339-1_26","volume-title":"Multi-Agent Systems for Society","author":"S. Ji","year":"2009","unstructured":"Ji, S., Tian, Q., Liang, Y.: A Petri-net-based modeling framework for automated negotiation protocols in electronic commerce. In: Lukose, D., Shi, Z. (eds.) PRIMA 2005. LNCS, vol.\u00a04078, pp. 324\u2013336. Springer, Heidelberg (2009)"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of facets (and some facets of complexity). In: Lewis, H.R., Simons, B.B., Burkhard, W.A., Landweber, L.H. (eds.) STOC, pp. 255\u2013260. ACM (1982)","DOI":"10.1145\/800070.802199"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-30209-4_15","volume-title":"Web Services","author":"G. Sala\u00fcn","year":"2004","unstructured":"Sala\u00fcn, G., Ferrara, A., Chirichiello, A.: Negotiation among web services using LOTOS\/CADP. In: Zhang, L.-J., Jeckle, M. (eds.) ECOWS 2004. LNCS, vol.\u00a03250, pp. 198\u2013212. Springer, Heidelberg (2004)"},{"issue":"2","key":"31_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.jcss.2009.06.003","volume":"76","author":"H.M.W. Verbeek","year":"2010","unstructured":"Verbeek, H.M.W., Wynn, M.T., van der Aalst, W.M.P., ter Hofstede, A.H.M.: Reduction rules for reset\/inhibitor nets. J. Comp. Syst. Sci.\u00a076(2), 125\u2013143 (2010)","journal-title":"J. Comp. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:56:38Z","timestamp":1557960998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}