发布求助
文献互助 智能选刊 最新文献

International Conference on Information and Computation Economies最新文献

筛选
英文 中文
Interface Automata for Choreographies 用于编排的接口自动机
International Conference on Information and Computation Economies Pub Date : 2019-09-12 DOI: 10.4204/EPTCS.304.1
Hao Zeng, A. Kurz, E. Tuosto
{"title":"Interface Automata for Choreographies","authors":"Hao Zeng, A. Kurz, E. Tuosto","doi":"10.4204/EPTCS.304.1","DOIUrl":"https://doi.org/10.4204/EPTCS.304.1","url":null,"abstract":"Choreographic approaches to message-passing applications can be regarded as an instance of the model-driven development principles. Choreographies specify interactions among distributed participants coordinating among themselves with message-passing at two levels of abstractions. A global view of the application is specified with a model that abstracts away from asynchrony while a local view of the application specifies the communication pattern of each participant. Noteworthy, the latter view can typically be algorithmically obtained by projection of the global view. A crucial element of this approach is to verify the so-called well-formed conditions on global views so that its projections realise a sound communication protocol. We introduce a novel local model, group interface automata, to represent the local view of choreographies and propose a new method to verify the well-formedness of global choreographies. We rely on a recently proposed semantics of global views formalised in terms of pomsets.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133115064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Cπ-calculus: a Model for Confidential Name Passing π-演算:保密名称传递的模型
International Conference on Information and Computation Economies Pub Date : 2019-02-26 DOI: 10.4204/EPTCS.304.8
I. Prokić
{"title":"The Cπ-calculus: a Model for Confidential Name Passing","authors":"I. Prokić","doi":"10.4204/EPTCS.304.8","DOIUrl":"https://doi.org/10.4204/EPTCS.304.8","url":null,"abstract":"Sharing confidential information in distributed systems is a necessity in many applications, however, it opens the problem of controlling information sharing even among trusted parties. In this paper, we present a formal model in which dissemination of information is disabled at the level of the syntax in a direct way. We introduce a subcalculus of the pi-calculus in which channels are considered as confidential information. The only difference with respect to the pi-calculus is that channels once received cannot be forwarded later on. By means of examples, we give an initial idea of how some privacy notions already studied in the past, such as group creation and name hiding, can be represented without any additional language constructs. We also present an encoding of the (sum-free) pi-calculus in our calculus.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129143540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Urgency in Asynchronous Timed Session Types 关于异步定时会话类型的紧迫性
International Conference on Information and Computation Economies Pub Date : 2018-10-04 DOI: 10.4204/EPTCS.279.9
Maurizio Murgia
{"title":"On Urgency in Asynchronous Timed Session Types","authors":"Maurizio Murgia","doi":"10.4204/EPTCS.279.9","DOIUrl":"https://doi.org/10.4204/EPTCS.279.9","url":null,"abstract":"We study an urgent semantics of asynchronous timed session types, where input actions happen as soon as possible. We show that with this semantics we can recover to the timed setting an appealing property of untimed session types: namely, deadlock-freedom is preserved when passing from synchronous to asynchronous communication.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124072501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Toward a Uniform Approach to the Unfolding of Nets 对网展开的统一方法
International Conference on Information and Computation Economies Pub Date : 2018-06-18 DOI: 10.4204/EPTCS.279.5
É. Fabre, G. Pinna
{"title":"Toward a Uniform Approach to the Unfolding of Nets","authors":"É. Fabre, G. Pinna","doi":"10.4204/EPTCS.279.5","DOIUrl":"https://doi.org/10.4204/EPTCS.279.5","url":null,"abstract":"In this paper we introduce the notion of spread net. Spread nets are (safe) Petri nets equipped with vector clocks on places and with ticking functions on transitions, and are such that vector clocks are consistent with the ticking of transitions. Such nets generalize previous families of nets like unfoldings, merged processes and trellis processes, and can thus be used to represent runs of a net in a true concurrency semantics through an operation called the spreading of a net. By contrast with previous constructions, which may identify conflicts, spread nets allow loops in time","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115308587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Nominal Cellular Automata 标称元胞自动机
International Conference on Information and Computation Economies Pub Date : 2016-08-11 DOI: 10.4204/EPTCS.223.2
T. Bolognesi, V. Ciancia
{"title":"Nominal Cellular Automata","authors":"T. Bolognesi, V. Ciancia","doi":"10.4204/EPTCS.223.2","DOIUrl":"https://doi.org/10.4204/EPTCS.223.2","url":null,"abstract":"The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their computational capabilities, with a special focus on the emergent behavioural properties of this new model and their significance in the context of computation-oriented interpretations of physical phenomena. A preliminary investigation of the relations between Nominal Cellular Automata and Wolfram's Elementary Cellular Automata is also carried out.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126936633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Worlds of Events: Deduction with Partial Knowledge about Causality 事件世界:关于因果关系的部分知识演绎
International Conference on Information and Computation Economies Pub Date : 2016-08-11 DOI: 10.4204/EPTCS.223.8
S. H. Haeri, P. V. Roy, Carlos Baquero, Christopher S. Meiklejohn
{"title":"Worlds of Events: Deduction with Partial Knowledge about Causality","authors":"S. H. Haeri, P. V. Roy, Carlos Baquero, Christopher S. Meiklejohn","doi":"10.4204/EPTCS.223.8","DOIUrl":"https://doi.org/10.4204/EPTCS.223.8","url":null,"abstract":"-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.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114064862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Step Towards Checking Security in IoT 迈向物联网安全检查的一步
International Conference on Information and Computation Economies Pub Date : 2016-08-11 DOI: 10.4204/EPTCS.223.9
C. Bodei, P. Degano, G. Ferrari, Letterio Galletta
{"title":"A Step Towards Checking Security in IoT","authors":"C. Bodei, P. Degano, G. Ferrari, Letterio Galletta","doi":"10.4204/EPTCS.223.9","DOIUrl":"https://doi.org/10.4204/EPTCS.223.9","url":null,"abstract":"The Internet of Things (IoT) is smartifying our everyday life. Our starting point is IoT-LySa, a calculus for describing IoT systems, and its static analysis, which will be presented at Coordination 2016. We extend the mentioned proposal in order to begin an investigation about security issues, in particular for the static verification of secrecy and some other security properties.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"115 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128217326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Multi-Threaded Actors 多线程的演员
International Conference on Information and Computation Economies Pub Date : 2016-08-11 DOI: 10.4204/EPTCS.223.4
Keyvan Azadbakht, F. D. Boer, V. Serbanescu
{"title":"Multi-Threaded Actors","authors":"Keyvan Azadbakht, F. D. Boer, V. Serbanescu","doi":"10.4204/EPTCS.223.4","DOIUrl":"https://doi.org/10.4204/EPTCS.223.4","url":null,"abstract":"In this paper we introduce a new programming model of multi-threaded actors which feature the parallel processing of their messages. In this model an actor consists of a group of active objects which share a message queue. We provide a formal operational semantics, and a description of a Java-based implementation for the basic programming abstractions describing multi-threaded actors. Finally, we evaluate our proposal by means of an example application.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123285366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
An Abstract Semantics of the Global View of Choreographies 编舞全局视图的抽象语义
International Conference on Information and Computation Economies Pub Date : 2016-08-10 DOI: 10.4204/EPTCS.223.5
R. Guanciale, E. Tuosto
{"title":"An Abstract Semantics of the Global View of Choreographies","authors":"R. Guanciale, E. Tuosto","doi":"10.4204/EPTCS.223.5","DOIUrl":"https://doi.org/10.4204/EPTCS.223.5","url":null,"abstract":"We introduce an abstract semantics of the global view of choreographies. Our semantics is given in terms of pre-orders and can accommodate different lower level semantics. We discuss the adequacy of our model by considering its relation with communicating machines, that we use to formalise the local view. Interestingly, our framework seems to be more expressive than others where semantics of global views have been considered. This will be illustrated by discussing some interesting examples.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122424955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
On the Regular Emptiness Problem of Subzero Automata 亚零度自动机的正则空性问题
International Conference on Information and Computation Economies Pub Date : 2016-08-10 DOI: 10.4204/EPTCS.223.1
H. Michalewski, M. Mio, M. Bojanczyk
{"title":"On the Regular Emptiness Problem of Subzero Automata","authors":"H. Michalewski, M. Mio, M. Bojanczyk","doi":"10.4204/EPTCS.223.1","DOIUrl":"https://doi.org/10.4204/EPTCS.223.1","url":null,"abstract":"Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122214364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信