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

Acta Informatica最新文献

筛选
英文 中文
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications 邻域互余：自稳定分布式实现与应用
IF 0.4 4区 计算机科学
Acta Informatica Pub Date : 2023-12-18 DOI: 10.1007/s00236-023-00450-8
Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada
{"title":"Neighborhood mutual remainder: self-stabilizing distributed implementation and applications","authors":"Shlomi Dolev,&nbsp;Sayaka Kamei,&nbsp;Yoshiaki Katayama,&nbsp;Fukuhito Ooshita,&nbsp;Koichi Wada","doi":"10.1007/s00236-023-00450-8","DOIUrl":"10.1007/s00236-023-00450-8","url":null,"abstract":"<div><p>Motivated by the need to convert move-atomic assumption in <i>LOOK-COMPUTE-MOVE</i> (LCM) robot algorithms to be implemented in existing distributed systems, we define a new distributed fundamental task, the neighborhood mutual remainder (NMR). Consider a situation where each process has a set of operations <span>(O_p)</span> and executes each operation in <span>(O_p)</span> infinitely often in distributed systems. Then, let <span>(O_esubset O_p)</span> be a subset of operations, which a process cannot execute, while its closed neighborhood executes operations in <span>(O_psetminus O_e)</span>. The NMR is defined for such a situation. A distributed algorithm that satisfies the NMR requirement should satisfy the following two properties: (1) Liveness is satisfied if a process executes each operation in <span>(O_p)</span> infinitely often and (2) safety is satisfied if, when each process executes operations in <span>(O_e)</span>, no process in its closed neighborhood executes operations in <span>(O_psetminus O_e)</span>. We formalize the concept of NMR and give a simple self-stabilizing algorithm using the pigeon-hole principle to demonstrate the design paradigm to achieve NMR. A self-stabilizing algorithm tolerates transient faults (e.g., message loss, memory corruption, etc.) by its ability to converge from an arbitrary configuration to the legitimate one. In addition, we present an application of NMR to an LCM robot system for implementing a move-atomic property, where robots possess an independent clock that is advanced at the same speed. It is the first self-stabilizing implementation of the LCM synchronization for environments where each robot can have limited visibility and lights.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 1","pages":"83 - 100"},"PeriodicalIF":0.4,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138745976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
n-PS-codes, 2-infix-outfix codes and some related classes of codes n-PS 码、2-后缀码和一些相关的码类
IF 0.4 4区 计算机科学
Acta Informatica Pub Date : 2023-12-15 DOI: 10.1007/s00236-023-00449-1
Haiyan Liu, Rongdong Cui, Tianjie Zhang
{"title":"n-PS-codes, 2-infix-outfix codes and some related classes of codes","authors":"Haiyan Liu,&nbsp;Rongdong Cui,&nbsp;Tianjie Zhang","doi":"10.1007/s00236-023-00449-1","DOIUrl":"10.1007/s00236-023-00449-1","url":null,"abstract":"<div><p>In this paper, <i>n</i>-PS-codes, 2-infix-outfix codes and some related classes of codes are investigated where <span>(nge 1)</span>. The classes of <i>n</i>-PS-codes and 2-infix-outfix codes are generalizations of classes of prefix codes and suffix codes, and infix codes and outfix codes, respectively. The closure properties of <i>n</i>-PS-codes and <i>g</i>-3-PS-codes under composition are discussed where <span>(nge 1)</span>, and the condition under which the class of 2-infix-outfix codes is closed under composition is provided.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 1","pages":"67 - 81"},"PeriodicalIF":0.4,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Balancing m-ary search trees with compressions on the fringe 用边缘压缩平衡 mary 搜索树
IF 0.4 4区 计算机科学
Acta Informatica Pub Date : 2023-12-15 DOI: 10.1007/s00236-023-00448-2
Shuyang Gao, Leen Hatem, Hosam Mahmoud
{"title":"Balancing m-ary search trees with compressions on the fringe","authors":"Shuyang Gao,&nbsp;Leen Hatem,&nbsp;Hosam Mahmoud","doi":"10.1007/s00236-023-00448-2","DOIUrl":"10.1007/s00236-023-00448-2","url":null,"abstract":"<div><p>We investigate the performance of random <i>m</i>-ary trees grown under an algorithm that perfectly balances <i>k</i> levels, whenever the opportunity arises in a fringe subtree. The average-case analysis shows that considerable saving in space and search time is achieved by such <b>a</b> fringe balancing algorithm.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 1","pages":"53 - 66"},"PeriodicalIF":0.4,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Editorial 2023: changes and invariants 编辑2023:变化与不变
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2023-11-03 DOI: 10.1007/s00236-023-00447-3
Henning Fernau
{"title":"Editorial 2023: changes and invariants","authors":"Henning Fernau","doi":"10.1007/s00236-023-00447-3","DOIUrl":"10.1007/s00236-023-00447-3","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 4","pages":"331 - 333"},"PeriodicalIF":0.6,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-023-00447-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71908571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A decision procedure for string constraints with string/integer conversion and flat regular constraints 带字符串/整数转换和平面正则约束的字符串约束决策程序
IF 0.4 4区 计算机科学
Acta Informatica Pub Date : 2023-10-24 DOI: 10.1007/s00236-023-00446-4
Hao Wu, Yu-Fang Chen, Zhilin Wu, Bican Xia, Naijun Zhan
{"title":"A decision procedure for string constraints with string/integer conversion and flat regular constraints","authors":"Hao Wu,&nbsp;Yu-Fang Chen,&nbsp;Zhilin Wu,&nbsp;Bican Xia,&nbsp;Naijun Zhan","doi":"10.1007/s00236-023-00446-4","DOIUrl":"10.1007/s00236-023-00446-4","url":null,"abstract":"<div><p>String constraint solving is the core of various testing and verification approaches for scripting languages. Among algorithms for solving string constraints, flattening is a well-known approach that is particularly useful in handling satisfiable instances. As string/integer conversion is an important function appearing in almost all scripting languages, Abdulla et al. extended the flattening approach to this function recently. However, their approach supports only a special flattening pattern and leaves the support of the general flat regular constraints as an open problem. In this paper, we fill the gap by proposing a complete flattening approach for the string/integer conversion. The approach is built upon a new quantifier elimination procedure for the linear-exponential arithmetic (namely, the extension of Presburger arithmetic with exponential functions, denoted by <span>ExpPA</span>) improved from the one proposed by Cherlin and Point in 1986. We analyze the complexity of our quantifier elimination procedure and show that the decision problem for existential <span>ExpPA</span> formulas is in 3-EXPTIME. Up to our knowledge, this is the first elementary complexity upper bound for this problem. While the quantifier elimination procedure is too expensive to be implemented efficiently, we propose various optimizations and provide a prototypical implementation. We evaluate the performance of our implementation on the benchmarks that are generated from the string hash functions as well as randomly. The experimental results show that our implementation outperforms the state-of-the-art solvers.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 1","pages":"23 - 52"},"PeriodicalIF":0.4,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135268450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Discovering workflow nets of concurrent iterative processes 发现并发迭代过程的工作流网络
IF 0.4 4区 计算机科学
Acta Informatica Pub Date : 2023-09-14 DOI: 10.1007/s00236-023-00445-5
Tonatiuh Tapia-Flores, Ernesto López-Mellado
{"title":"Discovering workflow nets of concurrent iterative processes","authors":"Tonatiuh Tapia-Flores,&nbsp;Ernesto López-Mellado","doi":"10.1007/s00236-023-00445-5","DOIUrl":"10.1007/s00236-023-00445-5","url":null,"abstract":"<div><p>A novel and efficient method for discovering concurrent workflow processes is presented. It allows building a suitable workflow net (WFN) from a large event log <span>(lambda )</span>, which represents the behaviour of complex iterative processes involving concurrency. First, the <i>t</i>-invariants are determined from <span>(lambda )</span>; this allows computing the causal and concurrent relations between the events and the implicit causal relations between events that do not appear consecutively in <span>(lambda )</span>. Then a 1-bounded WFN is built, which could be eventually adjusted if its <i>t</i>-invariants do not match with those computed from <span>(lambda )</span>. The discovered model allows firing all the traces in <span>(lambda )</span>. The procedures derived from the method are polynomial time on <span>(|lambda |)</span>; they have been implemented and tested on artificial logs.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 1","pages":"1 - 21"},"PeriodicalIF":0.4,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-023-00445-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134911044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The second step in characterizing a three-word code 描述三字代码的第二步
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2023-09-08 DOI: 10.1007/s00236-023-00444-6
Chunhua Cao, Jiao Xu, Lei Liao, Di Yang, Guichuan Jia, Qian Du
{"title":"The second step in characterizing a three-word code","authors":"Chunhua Cao,&nbsp;Jiao Xu,&nbsp;Lei Liao,&nbsp;Di Yang,&nbsp;Guichuan Jia,&nbsp;Qian Du","doi":"10.1007/s00236-023-00444-6","DOIUrl":"10.1007/s00236-023-00444-6","url":null,"abstract":"<div><p>In the fields of combinatorics on words and theory of codes, a two-word language <span>({x, y})</span> is a code if and only if <span>(xy not = yx)</span>. But up to now, corresponding characterizations for a three-word language, which forms a code, have not been completely found. Let <span>(X={x, y, z})</span> be a three-word language and <span>(|x|, |y|, |z|)</span> be their lengths. When <span>(|x| = |y| &lt; |z|)</span>, a necessary and sufficient condition for <i>X</i> to be a code was obtained in 2018. If <span>(|x| &lt; |y| = |z| le 2|x|)</span>, a necessary and sufficient condition for <i>X</i> to be a code is proposed in this paper.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 4","pages":"453 - 465"},"PeriodicalIF":0.6,"publicationDate":"2023-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48790117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On first-order runtime enforcement of branching-time properties 分支时间属性的一阶运行时强制
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2023-08-03 DOI: 10.1007/s00236-023-00441-9
Luca Aceto, Ian Cassar, Adrian Francalanza, Anna Ingólfsdóttir
{"title":"On first-order runtime enforcement of branching-time properties","authors":"Luca Aceto,&nbsp;Ian Cassar,&nbsp;Adrian Francalanza,&nbsp;Anna Ingólfsdóttir","doi":"10.1007/s00236-023-00441-9","DOIUrl":"10.1007/s00236-023-00441-9","url":null,"abstract":"<div><p>Runtime enforcement is a dynamic analysis technique that uses monitors to enforce the behaviour specified by some correctness property on an executing system. The enforceability of a logic captures the extent to which the properties expressible via the logic can be enforced at runtime for a specified operational model of enforcing monitors. We study the enforceability of branching-time, first-order properties expressed in the Hennessy–Milner Logic with Recursion (<span>(mu )</span> <span>HML</span>) with respect to monitors that can enforce behaviour involving events that carry data. To this end, we develop an operational framework for first-order enforcement via suppressions, insertions and replacements. We then use this model to formalise the meaning of enforcing a branching-time property. We also show that a safety syntactic fragment of the logic is enforceable within this framework by providing an automated synthesis function that generates correct suppression monitors from any formula taken from this logical fragment.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 4","pages":"385 - 451"},"PeriodicalIF":0.6,"publicationDate":"2023-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41339460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms 点对点，简单或复杂:形状重建算法综述
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2023-08-01 DOI: 10.1007/s00236-023-00443-7
Farnaz Sheikhi, Behnam Zeraatkar, Sama Hanaie
{"title":"Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms","authors":"Farnaz Sheikhi,&nbsp;Behnam Zeraatkar,&nbsp;Sama Hanaie","doi":"10.1007/s00236-023-00443-7","DOIUrl":"10.1007/s00236-023-00443-7","url":null,"abstract":"<div><p><i>Dot pattern</i> points are the samples taken from all regions of a 2D object, either inside or the boundary. Given a set of dot pattern points in the plane, the <i>shape reconstruction</i> problem seeks to find the boundaries of the points. These boundaries are not mathematically well-defined. Hence, a superior algorithm is the one which produces the result closest to the human visual perception. There are different challenges in designing these algorithms, such as the independence from human supervision, and the ability to detect multiple components, holes and sharp corners. In this paper, we present a thorough review on the rich body of research in shape reconstruction, classify the ideas behind the algorithms, and highlight their pros and cons. Moreover, to overcome the barriers of implementing these algorithms, we provide an integrated application to visualize the outputs of the prominent algorithms for further comparison.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 4","pages":"335 - 359"},"PeriodicalIF":0.6,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46914067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Testing membership for timed automata 时间自动机的成员关系测试
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2023-07-17 DOI: 10.1007/s00236-023-00442-8
Richard Lassaigne, Michel de Rougemont
{"title":"Testing membership for timed automata","authors":"Richard Lassaigne,&nbsp;Michel de Rougemont","doi":"10.1007/s00236-023-00442-8","DOIUrl":"10.1007/s00236-023-00442-8","url":null,"abstract":"<div><p>Given a timed automaton which admits thick components and a timed word <i>w</i>, we present a tester which decides if <i>w</i> is in the language of the automaton or if <i>w</i> is <span>(epsilon )</span>-far from the language, using finitely many samples taken from the weighted time distribution <span>(mu )</span> associated with the input <i>w</i>. We introduce a distance between timed words, the <i>timed edit distance</i>, which generalizes the classical edit distance. A timed word <i>w</i> is <span>(epsilon )</span>-far from a timed language if its relative distance to the language is greater than <span>(epsilon )</span>.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"60 4","pages":"361 - 384"},"PeriodicalIF":0.6,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71910443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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学术文献互助群
群 号：604180095
Book学术官方微信