{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:47Z","timestamp":1740098927453,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319620749"},{"type":"electronic","value":"9783319620756"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62075-6_17","type":"book-chapter","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T14:58:50Z","timestamp":1498575530000},"page":"239-254","source":"Crossref","is-referenced-by-count":4,"title":["A Verified Algorithm Enumerating Event Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5918-9114","authenticated-orcid":false,"given":"Juliana","family":"Bowles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4529-5442","authenticated-orcid":false,"given":"Marco B.","family":"Caminati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131\u2013137 (1972)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"17_CR2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0304-3975(94)90065-5","volume":"123","author":"MR Assous","year":"1994","unstructured":"Assous, M.R., et al.: Finite labelling problem in event structures. Theor. Comput. Sci. 123(1), 9\u201319 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2001.3060","volume":"171","author":"P Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures, and processes. Inf. Comput. 171(1), 1\u201349 (2001)","journal-title":"Inf. Comput."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11784180_16","volume-title":"Algebraic Methodology and Software Technology","author":"JKF Bowles","year":"2006","unstructured":"Bowles, J.K.F.: Decomposing interactions. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 189\u2013203. Springer, Heidelberg (2006). doi: 10.1007\/11784180_16"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bowles, J.K.F., Caminati, M.B.: Mind the gap: addressing behavioural inconsistencies with formal methods. In: 2016 23rd Asia-Pacific Software Engineering Conference (APSEC). IEEE Computer Society (2016)","DOI":"10.1109\/APSEC.2016.051"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11817949_20","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R Bruni","year":"2006","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: Event structure semantics for nominal calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 295\u2013309. Springer, Heidelberg (2006). doi: 10.1007\/11817949_20"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-14128-7_15","volume-title":"Intelligent Computer Mathematics","author":"F Butelle","year":"2010","unstructured":"Butelle, F., Hivert, F., Mayero, M., Toumazet, F.: Formal proof of SCHUR conjugate function. In: Autexier, S., Calmet, J., Delahaye, D., Ion, P.D.F., Rideau, L., Rioboo, R., Sexton, A.P. (eds.) CICM 2010. LNCS, vol. 6167, pp. 158\u2013171. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14128-7_15"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Caminati, M.B., et al.: Sound auction specification and implementation. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 547\u2013564. ACM (2015)","DOI":"10.1145\/2764468.2764511"},{"key":"17_CR9","unstructured":"Costa-Gomes, M., et al.: Choice, Deferral and Consistency. Discussion Paper Series, Department of Economics 201416. Department of Economics, University of St. Andrews (2014)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22673-1_1","volume-title":"Intelligent Computer Mathematics","author":"A Distler","year":"2011","unstructured":"Distler, A., Shah, M., Sorge, V.: Enumeration of AG-Groupoids. In: Davenport, J.H., Farmer, W.M., Urban, J., Rabe, F. (eds.) CICM 2011. LNCS, vol. 6824, pp. 1\u201314. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22673-1_1"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-21215-9_7","volume-title":"Tests and Proofs","author":"R Genestier","year":"2015","unstructured":"Genestier, R., Giorgetti, A., Petiot, G.: Sequential generation of structured arrays and its deductive verification. In: Blanchette, J.C., Kosmatov, N. (eds.) TAP 2015. LNCS, vol. 9154, pp. 109\u2013128. Springer, Cham (2015). doi: 10.1007\/978-3-319-21215-9_7"},{"issue":"1","key":"17_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/FI-2011-392","volume":"107","author":"F Kamm\u00fcller","year":"2011","unstructured":"Kamm\u00fcller, F.: Mechanical analysis of finite idempotent relations. Fundamenta Informaticae 107(1), 43\u201365 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","volume":"205","author":"DJ Kleitman","year":"1975","unstructured":"Kleitman, D.J., Rothschild, B.L.: Asymptotic enumeration of partial orders on a finite set. Trans. Am. Math. Soc. 205, 205\u2013220 (1975)","journal-title":"Trans. Am. Math. Soc."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-03359-9_22","volume-title":"Theorem Proving in Higher Order Logics","author":"A Lochbihler","year":"2009","unstructured":"Lochbihler, A.: Formalising finfuns \u2013 generating code for functions as data from Isabelle\/HOL. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 310\u2013326. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03359-9_22"},{"issue":"2","key":"17_CR15","first-page":"3","volume":"7","author":"G Pfeiffer","year":"2004","unstructured":"Pfeiffer, G.: Counting transitive relations. J. Integer Sequences 7(2), 3 (2004)","journal-title":"J. Integer Sequences"},{"key":"17_CR16","first-page":"219","volume":"41","author":"N Sloane","year":"2013","unstructured":"Sloane, N.: The on-line Encyclopedia of integer sequences. Ann. Math. Informaticae 41, 219\u2013234 (2013)","journal-title":"Ann. Math. Informaticae"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0024-3795(03)00371-9","volume":"370","author":"A Vera-L\u00f3pez","year":"2003","unstructured":"Vera-L\u00f3pez, A., Arregi, J.: Conjugacy classes in unitriangular matrices. Linear Algebra Appl. 370, 85\u2013124 (2003)","journal-title":"Linear Algebra Appl."},{"key":"17_CR18","first-page":"1","volume-title":"Handbook of Logic in Computer Science: Semantic Modelling","author":"G Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science: Semantic Modelling, vol. 4, pp. 1\u2013148. Oxford University Press, Oxford (1995)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987). doi: 10.1007\/3-540-17906-2_31"},{"issue":"1","key":"17_CR20","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1093\/comjnl\/bxp052","volume":"54","author":"G Winskel","year":"2011","unstructured":"Winskel, G.: Events, causality and symmetry. Comput. J. 54(1), 42\u201357 (2011). https:\/\/doi.org\/10.1093\/comjnl\/bxp052","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62075-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T23:55:48Z","timestamp":1602374148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62075-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319620749","9783319620756"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62075-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}