Files in this item
A verified algorithm enumerating event structures
Item metadata
dc.contributor.author | Bowles, Juliana Kuster Filipe | |
dc.contributor.author | Caminati, Marco Bright | |
dc.contributor.editor | Geuvers, Herman | |
dc.contributor.editor | England, Matthew | |
dc.contributor.editor | Hasan, Osman | |
dc.contributor.editor | Rabe, Florian | |
dc.contributor.editor | Teschke, Olaf | |
dc.date.accessioned | 2017-07-18T14:30:13Z | |
dc.date.available | 2017-07-18T14:30:13Z | |
dc.date.issued | 2017 | |
dc.identifier.citation | Bowles , J K F & Caminati , M B 2017 , A verified algorithm enumerating event structures . in H Geuvers , M England , O Hasan , F Rabe & O Teschke (eds) , Intelligent Computer Mathematics : 10th International Conference, CICM 2017, Edinburgh, UK, July 17-21, 2017, Proceedings . Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence) , vol. 10383 , Springer , Cham , pp. 239-254 , 10th Conference on Intelligent Computer Mathematics (CICM 2017) , Edinburgh , United Kingdom , 17/07/17 . https://doi.org/10.1007/978-3-319-62075-6_17 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783319620749 | |
dc.identifier.isbn | 9783319620756 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.other | PURE: 250067602 | |
dc.identifier.other | PURE UUID: de5a57ab-1581-417b-a20b-db26fed8116f | |
dc.identifier.other | Scopus: 85025168751 | |
dc.identifier.other | ORCID: /0000-0002-5918-9114/work/58055298 | |
dc.identifier.other | WOS: 000441207700017 | |
dc.identifier.other | ORCID: /0000-0002-4529-5442/work/68281664 | |
dc.identifier.uri | https://hdl.handle.net/10023/11248 | |
dc.description.abstract | An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and formulas to generate, enumerate and count particular sets of their members, no algorithm or formulas are known to generate or count all the possible event structures over af inite set of events. We present an algorithm to generate such a family, along with a functional implementation verified using Isabelle/HOL. As byproducts, we obtain a verified enumeration of all possible preorders and partial orders. While the integer sequences counting preorders and partial orders are already listed on OEIS (On-line Encyclopedia of Integer Sequences), the one counting event structures is not. We therefore used our algorithm to submit a formally verified addition, which has been successfully reviewed and is now part of the OEIS. | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | Intelligent Computer Mathematics | en |
dc.relation.ispartofseries | Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence) | en |
dc.rights | © 2017, Springer. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at link.springer.com / https://doi.org/10.1007/978-3-319-62075-6_17 | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | QA76 Computer software | en |
dc.subject | DAS | en |
dc.subject.lcc | QA75 | en |
dc.subject.lcc | QA76 | en |
dc.title | A verified algorithm enumerating event structures | en |
dc.type | Conference item | en |
dc.contributor.sponsor | EPSRC | en |
dc.description.version | Postprint | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | https://doi.org/10.1007/978-3-319-62075-6_17 | |
dc.identifier.grantnumber | EP/M014290/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.