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

International Workshop on Concurrency, Specification and Programming最新文献

筛选
英文 中文
Properties of Languages with Catenation and Shuffle 具有链贯和洗牌的语言的属性
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2014-964
M. Kudlek, Nils Erik Flick
{"title":"Properties of Languages with Catenation and Shuffle","authors":"M. Kudlek, Nils Erik Flick","doi":"10.3233/FI-2014-964","DOIUrl":"https://doi.org/10.3233/FI-2014-964","url":null,"abstract":"We present structural properties of languages constructed with catenation and shuffle, comprising iteration lemmata and closure properties of the language classes, as well as decidability results that follow.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124602366","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
Security Enforcing 安全执行
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-26651-5_6
Damas P. Gruska
{"title":"Security Enforcing","authors":"Damas P. Gruska","doi":"10.1007/978-3-031-26651-5_6","DOIUrl":"https://doi.org/10.1007/978-3-031-26651-5_6","url":null,"abstract":"","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115427287","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
Equations for Asynchronous Message Passing 异步消息传递方程
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2013-931
L. Czaja
{"title":"Equations for Asynchronous Message Passing","authors":"L. Czaja","doi":"10.3233/FI-2013-931","DOIUrl":"https://doi.org/10.3233/FI-2013-931","url":null,"abstract":"In [Cza 2006] fix-point equations specifying synchronous (”hand-shaking”) communication in distributed systems have been proposed. Their solution yielded a communication network of agents, directly presented as a Petri net-like structure, and determined the global state of the specified system. The net-places represented agents, while transitions transfer of messages. A special algebra being a semi-ring with ”addition” (nondeterministic choice) and ”multiplication” (simultaneity) was a formal basis for the equations and their solving procedure. Here, the equations are modified to specify asynchronous communication, that is, such that the senders, after sending message, continue their performance without waiting for reception. This required introducing a new type of objects called buffers or mailboxes apart from the agents (senders/receivers), and changing the semi-ring into a distributive lattice of the agents and mailboxes. In the asynchronous communication, solution to the fix-point equations should determine that: (1) the sender can send message as soon as mailboxes of its simultaneous receivers can store the message, no matter whether the receivers are ready to get it or not. (2) in the resulting net, the mailboxes are included as net-places too, each one collecting messages from its senders (possibly a number of senders) and transferring them to its (exactly one) receiver for which it is the unique mailbox. The proposed modelling of communication takes some (but only some!) ideas from CSP [Hoa 1978, 1985], CCS [Mil 1980, 1989] (e.g. a concept of agents, ports, synchronization between senders and mailboxes or its absence: no synchronization between senders and receivers, communication media or channels), Petri nets [Rei 1985] (e.g. graphical presentation of solution to the communication equations) or practice of computer networks and distributed systems [C-D-K 2005] (e.g. multicasting and broadcasting,","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131973634","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
Rough Sets and Sorites Paradox 粗糙集和索氏悖论
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2018-1633
A. Jankowski, A. Skowron, Piotr Wasilewski
{"title":"Rough Sets and Sorites Paradox","authors":"A. Jankowski, A. Skowron, Piotr Wasilewski","doi":"10.3233/FI-2018-1633","DOIUrl":"https://doi.org/10.3233/FI-2018-1633","url":null,"abstract":"We discuss the rough set approach to approximation of vague concepts. There are already published several papers on rough sets and vague concepts staring from the seminal papers by Zdzis law Pawlak. However, only a few of them are discussing the relationships of rough sets with the sorites paradox. This paper contains a continuation of discussion on this issue.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128039384","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
Dynamic Programming Approach for Construction of Association Rule Systems 关联规则系统构建的动态规划方法
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1402
F. Alsolami, Talha Amin, I. Chikalov, M. Moshkov, Beata Zielosko
{"title":"Dynamic Programming Approach for Construction of Association Rule Systems","authors":"F. Alsolami, Talha Amin, I. Chikalov, M. Moshkov, Beata Zielosko","doi":"10.3233/FI-2016-1402","DOIUrl":"https://doi.org/10.3233/FI-2016-1402","url":null,"abstract":"In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115314321","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
TripICS - a Web Service Composition System for Planning Trips and Travels (extended abstract) triics -规划旅行和旅行的Web服务组合系统(扩展摘要)
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2018-1635
A. Niewiadomski, W. Penczek
{"title":"TripICS - a Web Service Composition System for Planning Trips and Travels (extended abstract)","authors":"A. Niewiadomski, W. Penczek","doi":"10.3233/FI-2018-1635","DOIUrl":"https://doi.org/10.3233/FI-2018-1635","url":null,"abstract":"Automatic composition of Web services is a very active area of research which has provided a lot of important results [10, 1, 15, 6] as well as many implemented approaches [11, 12, 2, 3, 13]. In this paper we present the system TripICS a real-life application of our Web service composition system PlanICS [8, 9, 13] to planning trips and travels around the world. While there are systems offering some support for planning excursions and travels [4, 5], our system uses advanced automated concrete planning methods [13, 16, 14]. TripICS is a specialization of the concrete planning viewed as a constrained optimization problem to the ontology containing services provided by hotels, airlines, railways, museums etc. The system finds an optimal plan (solution) satisfying the requirements of the user by applying the most efficient concrete planners of PlanICS based on a combination of an SMT-solver [7] with the nature inspired algorithm: GA, SA, and GEO [16, 14]. Contrary to PlanICS, the first phase of planning, called abstract planning, is realized by TripICS in a semi-automatic way by giving the user a possibility to choose the elements of an abstract plan using a Graphical User Interface (GUI). In the remainder we present: the description of the system TripICS, the theory behind it, and the implementation followed by some experimental results and conclusions.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116048805","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
The Method for Describing Changes in the Perception of Stenosis in Blood Vessels Caused by an Additional Drug 描述由额外药物引起的血管狭窄感知变化的方法
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1404
Sylwia Buregwa-Czuma, Jan G. Bazan, L. Zarȩba, S. Bazan-Socha, B. Rewerska, Przemyslaw Wiktor Pardel, Lukasz Dydo
{"title":"The Method for Describing Changes in the Perception of Stenosis in Blood Vessels Caused by an Additional Drug","authors":"Sylwia Buregwa-Czuma, Jan G. Bazan, L. Zarȩba, S. Bazan-Socha, B. Rewerska, Przemyslaw Wiktor Pardel, Lukasz Dydo","doi":"10.3233/FI-2016-1404","DOIUrl":"https://doi.org/10.3233/FI-2016-1404","url":null,"abstract":"The decision making depends on the perception of the world and the proper identification of objects. The perception can be modified by various factors, such as drugs or diet. The purpose of this research is to study how the disturbing factors can influence the perception. The idea was to introduce the description of the rules of these changes. We propose a method for evaluating the effect of additional therapy in patients with coronary heart disease based on the tree of the impact. The leaves of the tree provide cross-decision rules of perception changes which could be suggested as a solution to the problem of predicting changes in perception. The problems considered in this paper are associated with the design of classifiers which allow the perception of the object in the context of information related to the decision attribute.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122951956","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
Reversing Transitions in Bounded Petri Nets 有界Petri网中的反转跃迁
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2018-1631
Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski, M. Koutny, Evgeny Erofeev
{"title":"Reversing Transitions in Bounded Petri Nets","authors":"Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski, M. Koutny, Evgeny Erofeev","doi":"10.3233/FI-2018-1631","DOIUrl":"https://doi.org/10.3233/FI-2018-1631","url":null,"abstract":"Reversible computation deals with mechanisms for undoing the effects of actions executed by a dynamic system. This paper is concerned with reversibility in the context of Petri nets which are a general formal model of concurrent systems. A key construction we investigate amounts to adding ‘reverse’ versions of selected net transitions. Such a static modification can severely impact on the behaviour of the system, e.g., the problem of establishing whether the modified net has the same states as the original one is undecidable. We therefore concentrate on nets with finite state spaces and show, in particular, that every transition in such nets can be reversed using a suitable finite set of new transitions.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917193","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}
引用次数: 16
An Afficient Equivalence-Checking Algorithm for a Model of Programs with Commutative and Absorptive Statements 具有交换和吸收语句的程序模型的有效等价检验算法
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1410
V. Podymov
{"title":"An Afficient Equivalence-Checking Algorithm for a Model of Programs with Commutative and Absorptive Statements","authors":"V. Podymov","doi":"10.3233/FI-2016-1410","DOIUrl":"https://doi.org/10.3233/FI-2016-1410","url":null,"abstract":"We present an efficient equivalence-checking algorithm for a propositional model of programs with semantics based on (what we call) progressive monoids on the finite set of statements generated by relations of a specific form. We consider arbitrary set of relations for commutativity (relations of the form ab = ba for statements a, b) and left absorption (relations of the form ab = b for statements a, b) properties. The main results are a polynomial-time decidability for the equivalence problem in the considered case, and an explicit description of an equivalence-checking algorithm which terminates in time polynomial in size","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116933124","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 Recommender Systems Scalability and Efficacy 推荐系统的可扩展性和有效性
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-26651-5_5
Eyad Kannout, Marek Grzegorowski, H. Nguyen
{"title":"Toward Recommender Systems Scalability and Efficacy","authors":"Eyad Kannout, Marek Grzegorowski, H. Nguyen","doi":"10.1007/978-3-031-26651-5_5","DOIUrl":"https://doi.org/10.1007/978-3-031-26651-5_5","url":null,"abstract":"","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127617004","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
首页 上一页 下一页 尾页
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学术官方微信