{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:36Z","timestamp":1725491616122},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_11","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T10:30:48Z","timestamp":1187433048000},"page":"151-165","source":"Crossref","is-referenced-by-count":0,"title":["A Nice Labelling for Tree-Like Event Structures of Degree 3"],"prefix":"10.1007","author":[{"given":"Luigi","family":"Santocanale","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part 1. Theor. Comput. Sci.\u00a013, 85\u2013108 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR2","first-page":"1","volume-title":"Handbook of logic in computer science, of Handb. Log. Comput. Sci.","author":"G. Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of logic in computer science, of Handb. Log. Comput. Sci., vol.\u00a04, pp. 1\u2013148. Oxford Univ. Press, New York (1995)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0012800","volume-title":"Automata, Languages, and Programming","author":"G. Winskel","year":"1982","unstructured":"Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages, and Programming. LNCS, vol.\u00a0140, pp. 561\u2013576. Springer, Heidelberg (1982)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.entcs.2006.04.019","volume":"158","author":"D. Varacca","year":"2006","unstructured":"Varacca, D., Yoshida, N.: Typed event structures and the pi-calculus: Extended abstract. Electr. Notes Theor. Comput. Sci.\u00a0158, 373\u2013397 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"11_CR5","first-page":"376","volume-title":"LICS","author":"C. Faggian","year":"2005","unstructured":"Faggian, C., Maurel, F.: Ludics nets, a game model of concurrent interaction. In: LICS, pp. 376\u2013385. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/978-3-540-28644-8_29","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P.A. Melli\u00e8s","year":"2004","unstructured":"Melli\u00e8s, P.A.: Asynchronous games 2: The true concurrency of innocence. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 448\u2013465. Springer, Heidelberg (2004)"},{"volume-title":"The book of traces","year":"1995","key":"11_CR7","unstructured":"Diekert, V., Rozenberg, G. (eds.): The book of traces. World Scientific Publishing Co. Inc., River Edge, NJ (1995)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Pratt, V.: Modeling concurrency with partial orders. Internat. J. Parallel Programming\u00a015(1), 33\u201371 (1986)","journal-title":"Internat. J. Parallel Programming"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(91)90087-I","volume":"91","author":"B. Rozoy","year":"1991","unstructured":"Rozoy, B., Thiagarajan, P.S.: Event structures and trace monoids. Theoret. Comput. Sci.\u00a091(2), 285\u2013313 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-55610-9_175","volume-title":"Advances in Petri Nets 1992","author":"B. Rozoy","year":"1992","unstructured":"Rozoy, B.: On distributed languages and models for concurrency. In: Rozenberg, G. (ed.) Advances in Petri Nets 1992. LNCS, vol.\u00a0609, pp. 267\u2013291. Springer, Heidelberg (1992)"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0304-3975(94)90065-5","volume":"123","author":"M.R. Assous","year":"1994","unstructured":"Assous, M.R., Bouchitt\u00e9, V., Charretton, C., Rozoy, B.: Finite labelling problem in event structures. Theor. Comput. Sci.\u00a0123(1), 9\u201319 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR12","first-page":"355","volume":"25","author":"A. Arnold","year":"1991","unstructured":"Arnold, A.: An extension of the notions of traces and of asynchronous automata. ITA\u00a025, 355\u2013396 (1991)","journal-title":"ITA"},{"issue":"1-2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00120-4","volume":"153","author":"P.W. Hoogers","year":"1996","unstructured":"Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general Petri nets. Theoret. Comput. Sci.\u00a0153(1-2), 129\u2013170 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. of Math.\u00a051(2), 161\u2013166 (1950)","journal-title":"Ann. of Math."},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J. Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphs. Colloq. Math.\u00a03, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/11901914_37","volume-title":"Automated Technology for Verification and Analysis","author":"P. Niebert","year":"2006","unstructured":"Niebert, P., Qu, H.: The implementation of mazurkiewicz traces in poem. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 508\u2013522. Springer, Heidelberg (2006)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-56496-9_14","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 164\u2013177. Springer, Heidelberg (1993)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-44685-0_27","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Niebert","year":"2001","unstructured":"Niebert, P., Huhn, M., Zennou, S., Lugiez, D.: Local first search - a new paradigm for partial order reductions. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 396\u2013410. Springer, Heidelberg (2001)"},{"key":"11_CR19","volume-title":"The congruences of a finite lattice","author":"G. Gr\u00e4tzer","year":"2006","unstructured":"Gr\u00e4tzer, G.: The congruences of a finite lattice. Birkh\u00e4user Boston Inc., Boston, MA (2006) A proof-by-picture approach."},{"key":"11_CR20","unstructured":"Santocanale, L.: Topological properties of event structures. GETCO 2006 (August 2006)"},{"key":"11_CR21","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015, 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"issue":"66","key":"11_CR22","first-page":"163","volume":"24","author":"A.A. Zykov","year":"1949","unstructured":"Zykov, A.A.: On some properties of linear complexes. Mat. Sbornik N.S.\u00a024(66), 163\u2013188 (1949)","journal-title":"Mat. Sbornik N.S."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:24:57Z","timestamp":1619504697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}