Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/51506
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Haeri, Seyed Hossein | por |
dc.contributor.author | Van Roy, Peter | por |
dc.contributor.author | Baquero, Carlos | por |
dc.contributor.author | Meiklejohn, Christopher | por |
dc.date.accessioned | 2018-03-05T11:32:33Z | - |
dc.date.available | 2018-03-05T11:32:33Z | - |
dc.date.issued | 2016 | - |
dc.identifier.issn | 2075-2180 | - |
dc.identifier.uri | https://hdl.handle.net/1822/51506 | - |
dc.description.abstract | Interactions between internet users are mediated by their devices and the common support infrastructure in data centres. Keeping track of causality amongst actions that take place in this distributed system is key to provide a seamless interaction where effects follow causes. Tracking causality in large scale interactions is difficult due to the cost of keeping large quantities of metadata; even more challenging when dealing with resource-limited devices. In this paper, we focus on keeping partial knowledge on causality and address deduction from that knowledge.We provide the first proof-theoretic causality modelling for distributed partial knowledge. We prove computability and consistency results. We also prove that the partial knowledge gives rise to a weaker model than classical causality. We provide rules for offline deduction about causality and refute some related folklore. We define two notions of forward and backward bisimilarity between devices, using which we prove two important results. Namely, no matter the order of addition/ removal, two devices deduce similarly about causality so long as: (1) the same causal information is fed to both. (2) they start bisimilar and erase the same causal information. Thanks to our establishment of forward and backward bisimilarity, respectively, proofs of the latter two results work by simple induction on length. | por |
dc.description.sponsorship | -This work was partially funded by the SyncFree project in the European Seventh Framework Programme under Grant Agreement 609551 and by the Erasmus Mundus Joint Doctorate Programme under Grant Agreement 2012-0030. Our special thanks to the SyncFree peers for their prolific comments on the early versions of this work. We would like to also thank the anonymous referees for their constructive discussion over the ICE forum. | por |
dc.language.iso | eng | por |
dc.publisher | Open Publishing Association | por |
dc.rights | openAccess | por |
dc.title | Worlds of events: deduction with partial knowledge about causality | por |
dc.type | conferencePaper | por |
dc.peerreviewed | yes | por |
oaire.citationStartPage | 113 | por |
oaire.citationEndPage | 127 | por |
oaire.citationIssue | 223 | por |
oaire.citationVolume | 223 | por |
dc.date.updated | 2018-02-14T15:48:43Z | - |
dc.identifier.doi | 10.4204/EPTCS.223.8 | por |
dc.description.publicationversion | info:eu-repo/semantics/publishedVersion | por |
dc.subject.wos | Science & Technology | - |
sdum.export.identifier | 2702 | - |
sdum.journal | Electronic Proceedings in Theoretical Computer Science (EPTCS) | por |
Aparece nas coleções: | HASLab - Artigos em revistas internacionais |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
World-of-Events-EPTCS2016.pdf | 589,22 kB | Adobe PDF | Ver/Abrir |