{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:26:03Z","timestamp":1746001563611},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_3","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:33:58Z","timestamp":1277494438000},"page":"29-42","source":"Crossref","is-referenced-by-count":3,"title":["Concurrent Construction of Proof-Nets"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Andreoli","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Mazar\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0168-0072(00)00032-4","volume":"107","author":"J.M. Andreoli","year":"2001","unstructured":"Andreoli, J.M.: Focussing and proof construction. Annals of Pure and Applied Logic\u00a0107, 131\u2013163 (2001)","journal-title":"Annals of Pure and Applied Logic"},{"key":"3_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/3-540-45620-1_39","volume-title":"Automated Deduction - CADE-18","author":"J.M. Andreoli","year":"2002","unstructured":"Andreoli, J.M.: Focussing proof-net construction as a middleware paradigm. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 501\u2013516. Springer, Heidelberg (2002)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Archive for Mathematical Logic\u00a028, 181\u2013203 (1989)","journal-title":"Archive for Mathematical Logic"},{"key":"3_CR5","volume-title":"Proc. of 15th Conference on Logic in Computer Science","author":"A. Murawski","year":"2000","unstructured":"Murawski, A., Ong, C.: Dominator trees and fast verification of proof nets. In: Proc. of 15th Conference on Logic in Computer Science, Santa Barbara, Ca, U.S.A., IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"3_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-45616-3_23","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"L. Habert","year":"2002","unstructured":"Habert, L., Notin, J.M., Galmiche, D.: Link: A proof environment based on proof nets. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 330\u2013334. Springer, Heidelberg (2002)"},{"key":"3_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets. Springer, Heidelberg (1985)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1017\/S0960129500000062","volume":"1","author":"N. Marti-Olliet","year":"1991","unstructured":"Marti-Olliet, N., Meseguer, J.: From petri-nets to linear logic. Mathematical Structures in Computer Science\u00a01, 69\u2013101 (1991)","journal-title":"Mathematical Structures in Computer Science"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-45541-8_12","volume-title":"Unifying Petri Nets","author":"R. Bruni","year":"2001","unstructured":"Bruni, R., Montanari, U.: Transactions and zero-safe nets. In: Ehrig, H., Juh\u00e1s, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol.\u00a02128, pp. 380\u2013426. Springer, Heidelberg (2001)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-46562-6_18","volume-title":"Perspectives of System Informatics","author":"I. Lomazova","year":"2000","unstructured":"Lomazova, I., Schnoebelen, P.: Some decidability results for nested petri nets. In: Bjorner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol.\u00a01755, pp. 198\u2013207. Springer, Heidelberg (2000)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-58152-9_11","volume-title":"Application and Theory of Petri Nets 1994","author":"G. Ciardo","year":"1994","unstructured":"Ciardo, G.: Petri nets with marking-dependent arc cardinality. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol.\u00a0815, pp. 179\u2013198. Springer, Heidelberg (1994)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"3_CR13","first-page":"372","volume-title":"Proc. of 23rd Symposium on Principles of Programming Languages","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., Gonthier, G.: The reflexive cham and the join-calculus. In: Proc. of 23rd Symposium on Principles of Programming Languages, St. Petersburg Beach, Fl, U.S.A., pp. 372\u2013385. ACM Press, New York (1996)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-45694-5_22","volume-title":"CONCUR 2002 - Concurrency Theory","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Laneve, C., Montanari, U.: Orchestrating transactions in join calculus. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 321\u2013337. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T23:30:15Z","timestamp":1552606215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}