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

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

筛选
英文 中文
Classifiers for Behavioral Patterns Identification Induced from Huge Temporal Data 基于海量时间数据的行为模式识别分类器
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1301
Jan G. Bazan, A. Szczur, Lukasz Dydo, H. Wojtowicz, M. Szpyrka
{"title":"Classifiers for Behavioral Patterns Identification Induced from Huge Temporal Data","authors":"Jan G. Bazan, A. Szczur, Lukasz Dydo, H. Wojtowicz, M. Szpyrka","doi":"10.3233/FI-2016-1301","DOIUrl":"https://doi.org/10.3233/FI-2016-1301","url":null,"abstract":"Praca opublikowana w: Bazan, J., G., Szpyrka, M., Szczur, A., Dydo, L., Wojtowicz, H.: Classifiers for Behavioral Patterns Identification Induced from Huge Temporal Data, In Proceedings of the Workshop on Concurrency, Specification and Programming (CS&P 2014), Chemnitz, Germany, 2014, September 29-October 1, volume 245 of Informatik-Bericht, pages 22-33, Humboldt University, 2014.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"25 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132531848","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
ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic ExpTime Tableaux与全局缓存的分级命题动态逻辑
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1408
Linh Anh Nguyen
{"title":"ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic","authors":"Linh Anh Nguyen","doi":"10.3233/FI-2016-1408","DOIUrl":"https://doi.org/10.3233/FI-2016-1408","url":null,"abstract":"We present the first direct tableau decision procedure for graded PDL, which uses global caching and has ExpTime (optimal) complexity when numbers are encoded in unary. It shows how to combine checking fulfillment of existential star modalities with integer linear feasibility checking for tableaux with global caching. As graded PDL can be used as a description logic for representing and reasoning about terminological knowledge, our procedure is useful for practical applications.","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":"133604446","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
Granular Floor Plan Representation for Evacuation Modeling 用于疏散建模的颗粒平面表示
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17996-4_30
Wojciech Swieboda, Maja Nguyen, H. Nguyen
{"title":"Granular Floor Plan Representation for Evacuation Modeling","authors":"Wojciech Swieboda, Maja Nguyen, H. Nguyen","doi":"10.1007/978-3-319-17996-4_30","DOIUrl":"https://doi.org/10.1007/978-3-319-17996-4_30","url":null,"abstract":"","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":"125732569","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
Remarks on Memory Consistency Description 内存一致性说明
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1405
L. Czaja
{"title":"Remarks on Memory Consistency Description","authors":"L. Czaja","doi":"10.3233/FI-2016-1405","DOIUrl":"https://doi.org/10.3233/FI-2016-1405","url":null,"abstract":"Two observations in the matter of pictorial as well as formal presentation of some consistency in distributed shared memory are made. The first concerns geometric transformation of line segments and points picturing read/write operations, the second converting partial order of the operations into linear order of their initiations and terminations. This allows to reduce serialization of the read/write operations as a whole to permutations of their beginnings and ends. Some draft proposals are introduced.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"7 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":"127228623","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
Trying to Understand PEG 试图理解PEG
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2018-1638
Roman R. Redziejowski
{"title":"Trying to Understand PEG","authors":"Roman R. Redziejowski","doi":"10.3233/FI-2018-1638","DOIUrl":"https://doi.org/10.3233/FI-2018-1638","url":null,"abstract":"Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. Its properties are useful in many applications, but it is not well understood as a language definition tool. In its appearance, PEG is almost identical to a grammar in the Extended Backus-Naur Form (EBNF), and one may expect it to define the same language. But, due to the limited backtracking, PEG may reject some strings defined by EBNF, which gives an impression of PEG being unpredictable. We note that for some grammars, the limited backtracking is ”efficient”, in the sense that it exhausts all possibilities. A PEG with efficient backtracking should therefore be easy to understand. There is no general algorithm to check if the grammar has efficient backtracking, but it can be often checked by inspection. The paper outlines an interactive tool to facilitate such inspection.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"131 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":"126161278","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}
引用次数: 6
Left Recursion by Recursive Ascent 通过递归上升的左递归
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-26651-5_2
Roman R. Redziejowski
{"title":"Left Recursion by Recursive Ascent","authors":"Roman R. Redziejowski","doi":"10.1007/978-3-031-26651-5_2","DOIUrl":"https://doi.org/10.1007/978-3-031-26651-5_2","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":"130990718","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
Computing Bisimulation-Based Comparisons 计算基于双仿真的比较
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2018-1634
Linh Anh Nguyen
{"title":"Computing Bisimulation-Based Comparisons","authors":"Linh Anh Nguyen","doi":"10.3233/FI-2018-1634","DOIUrl":"https://doi.org/10.3233/FI-2018-1634","url":null,"abstract":"By using the idea of Henzinger et al. for computing the similarity relation, we give an efficient algorithm, with complexity O((m + n)n), for computing the largest bisimulation-based autocomparison and the directed similarity relation of a labeled graph for the setting without counting successors, where m is the number of edges and n is the number of vertices. Moreover, we provide the first algorithm with a polynomial time complexity, O((m + n)n), for computing such relations but for the setting with counting successors (like the case with graded modalities in modal logics and qualified number restrictions in description logics).","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"45 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":"115847160","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
An Upper Bound for the Reachability Problem of Safe, Elementary Hornets 安全初等大黄蜂可达性问题的上界
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1305
Michael Köhler-Bussmeier, Frank Heitmann
{"title":"An Upper Bound for the Reachability Problem of Safe, Elementary Hornets","authors":"Michael Köhler-Bussmeier, Frank Heitmann","doi":"10.3233/FI-2016-1305","DOIUrl":"https://doi.org/10.3233/FI-2016-1305","url":null,"abstract":"In this paper we study the complexity of the reachability problem HORNETS, an algebraic extension of object nets. Here we consider the restricted class of safe, elementary HORNETS. In previous work we established the lower bound, i.e. reachability requires at least exponential space. In another work we have shown we can simulate elementary HORNETS with elementary object nets EOS, where reachability is known to be PSpace-complete. Since this simulation leads to a double exponential increase in the size of the simulating EOS, we obtain that for HORNETS the reachability problem is solvable in double exponential space. In this contribution we show that this kind of simulation is rather bad, since we show that exponential space is sufficient. Together with the known lower bound this shows that the upper is tight.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"516 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":"116228503","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
From EBNF to PEG 从EBNF到PEG
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2013-940
Roman R. Redziejowski
{"title":"From EBNF to PEG","authors":"Roman R. Redziejowski","doi":"10.3233/FI-2013-940","DOIUrl":"https://doi.org/10.3233/FI-2013-940","url":null,"abstract":"Parsing Expression Grammar PEG encodes a recursive-descent parser with limited backtracking. The parser has many useful properties, and with the use of memoization, it works in a linear time. In its appearance, PEG is almost identical to a grammar in Extended Backus-Naur Form EBNF, but usually defines a different language. However, in some cases only minor typographical changes are sufficient to convert an EBNF grammar into its PEG parser. As recently shown by Medeiros, this is, in particular, true for LL1 grammars. But this is also true for many non-LL1 grammars, which is interesting because the backtracking of PEG is often a convenient way to circumvent just the LL1 restriction. We formulate a number of conditions for EBNF grammar to become its own PEG parser, and arrive at a condition that we call LL1p, meaning that a top-down parser can choose its next action by looking at the input within the reach of one parsing procedure rather than by looking at the next letter. An extension to LLkp for k > 1 seems possible.","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":"122731938","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}
引用次数: 10
Cut Points in PEG PEG切割点
International Workshop on Concurrency, Specification and Programming Pub Date : 1900-01-01 DOI: 10.3233/FI-2016-1308
Roman R. Redziejowski
{"title":"Cut Points in PEG","authors":"Roman R. Redziejowski","doi":"10.3233/FI-2016-1308","DOIUrl":"https://doi.org/10.3233/FI-2016-1308","url":null,"abstract":"Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. It has been recently noticed that in the situa tion when the parser is to explore several alternatives one after another, no further alternatives ne ed to be explored after the parser reached certain \"cut point\". This fact can be used to save both processing time and storage. The subject of the paper is identification of cut points, which can also help in producing better diagnostics.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"103 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":"128149244","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
首页 上一页
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学术官方微信