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

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

筛选
英文 中文
Graph-based Sparse Neural Networks for Traffic Signal Optimization 基于图的稀疏神经网络交通信号优化
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-26651-5_9
Lukasz Skowronek, P. Góra, Marcin Możejko, Arkadiusz Klemenko
{"title":"Graph-based Sparse Neural Networks for Traffic Signal Optimization","authors":"Lukasz Skowronek, P. Góra, Marcin Możejko, Arkadiusz Klemenko","doi":"10.1007/978-3-031-26651-5_9","DOIUrl":"https://doi.org/10.1007/978-3-031-26651-5_9","url":null,"abstract":"","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"19 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":"132281623","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
Towards an Anticipatory Mechanism for Complex Decisions in a Bio-Hybrid Beehive 生物混合蜂窝复杂决策的预期机制研究
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-26651-5_7
H. Mellmann, Volha Taliaronak, V. Hafner
{"title":"Towards an Anticipatory Mechanism for Complex Decisions in a Bio-Hybrid Beehive","authors":"H. Mellmann, Volha Taliaronak, V. Hafner","doi":"10.1007/978-3-031-26651-5_7","DOIUrl":"https://doi.org/10.1007/978-3-031-26651-5_7","url":null,"abstract":"","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"1 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":"130198851","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
An Example of Computation in Interactive Granular Computing 交互颗粒计算中的一个计算实例
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-26651-5_3
S. Dutta
{"title":"An Example of Computation in Interactive Granular Computing","authors":"S. Dutta","doi":"10.1007/978-3-031-26651-5_3","DOIUrl":"https://doi.org/10.1007/978-3-031-26651-5_3","url":null,"abstract":"","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"11 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":"130526010","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
Controlling Petri Net Behavior Using Priorities for Transitions 使用转换优先级控制Petri网行为
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1306
I. Lomazova, L. Popova-Zeugmann
{"title":"Controlling Petri Net Behavior Using Priorities for Transitions","authors":"I. Lomazova, L. Popova-Zeugmann","doi":"10.3233/FI-2016-1306","DOIUrl":"https://doi.org/10.3233/FI-2016-1306","url":null,"abstract":"In this paper we examine how it is possible to control Petri net behavior with the help of transition priorities. Controlling here means forcing a process to behave in a stable way by ascribing priorities to transitions and hence transforming a classic Petri net into a Priority Petri net. For Petri net models stability is often ensured by liveness and boundedness. These properties are crucial in many application areas, e.g. workflow modeling, embedded systems design, and bioin- formatics. In this paper we study the problem of transforming a given live, but unbounded Petri net into a live and bounded one by adding priority constraints. We specify necessary conditions for the solvability of this problem and present an algorithm for ascribing priorities to net transitions in such a way that the resulting net becomes bounded while staying live.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"13 2 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":"129497835","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}
引用次数: 13
Extended Future in Testing Semantics for Time Petri Nets 时间Petri网语义测试的扩展前景
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-26651-5_4
E. N. Bozhenkova, I. Virbitskaite
{"title":"Extended Future in Testing Semantics for Time Petri Nets","authors":"E. N. Bozhenkova, I. Virbitskaite","doi":"10.1007/978-3-031-26651-5_4","DOIUrl":"https://doi.org/10.1007/978-3-031-26651-5_4","url":null,"abstract":"","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"29 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":"114210568","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
On a Notion of Extensionality for Artifacts 关于工件的可扩展性的概念
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2013-896
L. Polkowski, M. Semeniuk-Polkowska
{"title":"On a Notion of Extensionality for Artifacts","authors":"L. Polkowski, M. Semeniuk-Polkowska","doi":"10.3233/FI-2013-896","DOIUrl":"https://doi.org/10.3233/FI-2013-896","url":null,"abstract":"The notion of extensionality means in plain sense that properties of complex things can be expressed by means of their simple components, in particular, that two things are identical if and only if certain of their components or features are identical; e.g., the Leibniz Identitas Indiscernibilium Principle: two things are identical if each applicable to them operator yields the same result on either; or, extensionality for sets, viz., two sets are identical if and only if they consist of identical elements. In mereology, this property is expressed by the statement that two things are identical if their parts are the same. However, building a thing from parts may proceed in various ways and this, unexpectedly, yields various extensionality principles. Also, building a thing may lead to things identical with respect to parts but distinct with respect, e.g., to usage. We address the question of extensionality for artifacts, i.e., things produced in some assembling or creative process in order to satisfy a chosen purpose of usage, and, we formulate the extensionality principle for artifacts which takes into account the assembling process and requires for identity of two artifacts that assembling graphs for the two be isomorphic in a specified sense. In parallel, we consider the design process and design things showing the canonical correspondence between abstracta as design products and concreta as artifacts. In the end, we discuss approximate artifacts as a result of assembling with spare parts which analysis does involve rough mereology.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"2004 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":"123765116","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
Extrapolation of an Optimal Policy using Statistical Probabilistic Model Checking 基于统计概率模型检验的最优策略外推
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2018-1637
A. Rataj, B. Wozna
{"title":"Extrapolation of an Optimal Policy using Statistical Probabilistic Model Checking","authors":"A. Rataj, B. Wozna","doi":"10.3233/FI-2018-1637","DOIUrl":"https://doi.org/10.3233/FI-2018-1637","url":null,"abstract":"We show how to extrapolate an optimal policy controlling a model, which is itself too large to find the policy directly using probabilistic model checking (PMC). In particular, we look for a global optimal resolution of non–determinism in several small Markov Decision Processes (MDP) using PMC. We then use the resolution to find a respective set of decision boundaries representing the optimal policies found. Then, a hypothesis is formed on an extrapolation of these boundaries to an equivalent boundary in a large MDP. The resulting hypothetical extrapolated decision boundary is statistically approximately verified, whether it indeed represents an optimal policy for the large MDP. The verification either weakens or strengthens the hypothesis. The criterion of the optimality of the policy can be expressed in any modal logic that includes the probabilistic operator P∼p[·], and for which a PMC method exists.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"91 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":"124665995","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 Classifier Based on a Decision Tree with Verifying Cuts 基于验证切的决策树分类器
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1300
Jan G. Bazan, S. Bazan-Socha, Sylwia Buregwa-Czuma, Lukasz Dydo, W. Rzasa, A. Skowron
{"title":"A Classifier Based on a Decision Tree with Verifying Cuts","authors":"Jan G. Bazan, S. Bazan-Socha, Sylwia Buregwa-Czuma, Lukasz Dydo, W. Rzasa, A. Skowron","doi":"10.3233/FI-2016-1300","DOIUrl":"https://doi.org/10.3233/FI-2016-1300","url":null,"abstract":"This article introduces a new method of a decision tree construction. Such construction is performed using additional cuts applied for a verificatio n of the cuts' quality in tree nodes during the classification of objects. The presented approach allow s us to exploit the additional knowledge represented in the attributes which could be eliminated using greedy methods. The paper includes the results of experiments performed on data sets from a biomedical database and machine learning repositories. In order to evaluate the presented method, we compared its performance with the classification results of a local discretization decision t ree, well known from literature. Our new method outperforms the existing method, which is also confir med by statistical tests.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"1 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":"121926554","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}
引用次数: 11
SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata 基于smt的加权时间自动机k-拟最优运行搜索
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2017-1527
B. Wozna, A. Zbrzezny, A. Zbrzezny
{"title":"SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata","authors":"B. Wozna, A. Zbrzezny, A. Zbrzezny","doi":"10.3233/FI-2017-1527","DOIUrl":"https://doi.org/10.3233/FI-2017-1527","url":null,"abstract":"We investigate an optimal cost reachability problem for weighted timed automata, and we use a translation to SMT to solve the problem. In particular, we show how to find a run of length k ∈ IN that starts at the initial state and terminates at a state containing the target location, its total cost belongs to the interval [c, c+1), for some natural number c ∈ IN, and the cost of each other run of length k, which also leads from the initial state to a state containing the target location, is greater or equal to c. This kind of runs we call k-quasi-optimal. We exemplify the use of our solution to the mentioned problem by means of the weighted timed generic pipeline protocol, and we provide some preliminary experimental results.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"62 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":"126298386","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
A Protocol of Mutual Exclusion for DSM Based on Vectors of Global Timestamps 基于全局时间戳矢量的DSM互斥协议
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2018-1632
L. Czaja
{"title":"A Protocol of Mutual Exclusion for DSM Based on Vectors of Global Timestamps","authors":"L. Czaja","doi":"10.3233/FI-2018-1632","DOIUrl":"https://doi.org/10.3233/FI-2018-1632","url":null,"abstract":"A new protocol using vectors of global timestamps for mutual exclusion in systems with Distributed Shared Memory (DSM) is described and some of its properties proved.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"75 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":"134144306","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学术官方微信