{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T10:10:10Z","timestamp":1746353410493,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445839"},{"type":"electronic","value":"9783662445846"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44584-6_3","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:21:03Z","timestamp":1408756863000},"page":"23-31","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Negotiations: Concurrency for Free"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"01","key":"3_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"08","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.\u00a008(01), 21\u201366 (1998)","journal-title":"J. Circuits, Syst. and Comput."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","year":"2010","unstructured":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.): ICALP 2010. LNCS, vol.\u00a06199. Springer, Heidelberg (2010)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/3-540-48224-5_65","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of msc graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 797\u2013808. Springer, Heidelberg (2001)"},{"issue":"11","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1109\/12.895935","volume":"49","author":"T.F. Atdelzater","year":"2000","unstructured":"Atdelzater, T.F., Atkins, E.M., Shin, K.G.: Qos negotiation in real-time systems and its application to automated flight control. IEEE Transactions on Computers\u00a049(11), 1170\u20131183 (2000)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Basu, S., Bultan, T., Ouederni, M.: Deciding choreography realizability. In: POPL, pp. 191\u2013202. ACM (2012)","DOI":"10.1145\/2103621.2103680"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Jancar, P., Kucera, A.: Reachability games on extended vector addition systems with states. In: Abramsky, et al. (eds.) [2], pp. 478\u2013489","DOI":"10.1007\/978-3-642-14162-1_40"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0004-3702(83)90015-2","volume":"20","author":"R. Davis","year":"1983","unstructured":"Davis, R., Smith, R.G.: Negotiation as a metaphor for distributed problem solving. Artificial Intelligence\u00a020(1), 63\u2013109 (1983)","journal-title":"Artificial Intelligence"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G., Rozenburg, G.: The book of traces, vol.\u00a015. World Scientific (1995)","DOI":"10.1142\/9789814261456"},{"key":"3_CR9","unstructured":"Esparza, J., Desel, J.: Realizability of deterministic negotiations (in preparation)"},{"key":"3_CR10","unstructured":"Esparza, J., Desel, J.: On negotiation as concurrency primitive. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 \u2013 Concurrency Theory. LNCS, vol.\u00a08052, pp. 440\u2013454. Springer, Heidelberg (2013), Extended version in CoRR abs\/1307.2145"},{"key":"3_CR11","unstructured":"Esparza, J., Desel, J.: On negotiation as concurrency primitive II: Deterministic cyclic negotiations. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol.\u00a08412, pp. 258\u2013273. Springer, Heidelberg (2014), Extended version in CoRR abs\/1403.4958"},{"key":"3_CR12","unstructured":"Esparza, J., Hoffmann, P.: Negotiation games. CoRR, abs\/1405.6820 (2014)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Optimal Zielonka-type construction of deterministic asynchronous automata. In: Abramsky, et al. (eds.) [2], pp. 52\u201363","DOI":"10.1007\/978-3-642-14162-1_5"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-540-27755-2_15","volume-title":"Lectures on Concurrency and Petri Nets","author":"B. Genest","year":"2004","unstructured":"Genest, B., Muscholl, A., Peled, D.: Message sequence charts. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 537\u2013558. Springer, Heidelberg (2004)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-54430-5_96","volume-title":"CONCUR \u201991","author":"W. Janssen","year":"1991","unstructured":"Janssen, W., Poel, M., Zwiers, J.: Action systems and action refinement in the development of parallel systems - an algebraic approach. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 298\u2013316. Springer, Heidelberg (1991)"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1008746126376","volume":"10","author":"N.R. Jennings","year":"2001","unstructured":"Jennings, N.R., Faratin, P., Lomuscio, A.R., Parsons, S., Wooldridge, M.J., Sierra, C.: Automated negotiation: prospects, methods and challenges. Group Decision and Negotiation\u00a010(2), 199\u2013215 (2001)","journal-title":"Group Decision and Negotiation"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-33512-9_4","volume-title":"Reachability Problems","author":"A. Ku\u010dera","year":"2012","unstructured":"Ku\u010dera, A.: Playing games with counter automata. In: Finkel, A., Leroux, J., Potapov, I. (eds.) RP 2012. LNCS, vol.\u00a07550, pp. 29\u201341. Springer, Heidelberg (2012)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/978-3-540-24597-1_29","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"S. Mohalik","year":"2003","unstructured":"Mohalik, S., Walukiewicz, I.: Distributed games. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 338\u2013351. Springer, Heidelberg (2003)"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/TSC.2011.9","volume":"5","author":"G. Sala\u00fcn","year":"2012","unstructured":"Sala\u00fcn, G., Bultan, T., Roohi, N.: Realizability of choreographies using process algebra encodings. IEEE T. Services Computing\u00a05(3), 290\u2013304 (2012)","journal-title":"IEEE T. Services Computing"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput.\u00a0164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Winsborough, W.H., Seamons, K.E., Jones, V.E.: Automated trust negotiation. In: Proceedings of DARPA Information Survivability Conference and Exposition, DISCEX 2000, vol.\u00a01, pp. 88\u2013102. IEEE (2000)","DOI":"10.1109\/DISCEX.2000.824965"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Compositionality, Concurrency, and Partial Correctness","author":"J. Zwiers","year":"1989","unstructured":"Zwiers, J.: Compositionality, Concurrency, and Partial Correctness. LNCS, vol.\u00a0321. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2014 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44584-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:41:00Z","timestamp":1746351660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44584-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445839","9783662445846"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44584-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}