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

Acta Informatica最新文献

筛选
英文 中文
Correction to: Sound reasoning in tock-CSP 修正:合理的推理在股票- csp
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-10-15 DOI: 10.1007/s00236-021-00409-7
James Baxter, Pedro Ribeiro, Ana Cavalcanti
{"title":"Correction to: Sound reasoning in tock-CSP","authors":"James Baxter, Pedro Ribeiro, Ana Cavalcanti","doi":"10.1007/s00236-021-00409-7","DOIUrl":"10.1007/s00236-021-00409-7","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 2-3","pages":"283 - 283"},"PeriodicalIF":0.6,"publicationDate":"2021-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50030418","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
Interface Automata for Shared Memory 共享内存的接口自动机
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-08-30 DOI: 10.1007/s00236-021-00408-8
Ayleen Schinko, Walter Vogler, Johannes Gareis, N. Tri Nguyen, Gerald Lüttgen
{"title":"Interface Automata for Shared Memory","authors":"Ayleen Schinko,&nbsp;Walter Vogler,&nbsp;Johannes Gareis,&nbsp;N. Tri Nguyen,&nbsp;Gerald Lüttgen","doi":"10.1007/s00236-021-00408-8","DOIUrl":"10.1007/s00236-021-00408-8","url":null,"abstract":"<div><p>Interface theories based on <i>Interface Automata</i> (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory can be conservatively extended by shared memory data, without sacrificing simplicity or imposing restrictions. Our extension <i>IA for shared Memory</i> (IAM) decorates transitions with pre- and post-conditions over algebraic expressions on shared variables, which are taken into account by IA’s notion of component compatibility. Simplicity is preserved as IAM can be embedded into IA and, thus, accurately lifts IA’s compatibility concept to shared memory. We also provide a ground semantics for IAM that demonstrates that our abstract handling of data within IA’s open systems view is faithful to the standard treatment of data in closed systems.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 5","pages":"521 - 556"},"PeriodicalIF":0.6,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-021-00408-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43163802","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}
引用次数: 2
Regular numeral systems for data structures 数据结构的正则数字系统
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-25 DOI: 10.1007/s00236-021-00407-9
Amr Elmasry, Jyrki Katajainen
{"title":"Regular numeral systems for data structures","authors":"Amr Elmasry,&nbsp;Jyrki Katajainen","doi":"10.1007/s00236-021-00407-9","DOIUrl":"10.1007/s00236-021-00407-9","url":null,"abstract":"<div><p>We formalize several regular numeral systems, state their properties and supported operations, clarify the correctness, and tabulate the proofs. Our goal is to use as few symbols in the presentation of digits and make as few digit changes as possible in every operation. Most importantly, we introduce two new systems: (1) the buffered regular system is simple and allows the increment and decrement of the least-significant digit in constant time, and (2) the strictly regular system allows the increment and decrement of a digit at arbitrary position with a constant number of digit changes while using three symbols only (instead of four symbols required by the extended regular system). To demonstrate the usefulness of the regular systems, we survey how they have been used in the design of data structures.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"59 2-3","pages":"245 - 281"},"PeriodicalIF":0.6,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00407-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50102643","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
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds 一维多速度CA中生日歌曲同步问题(FSSP)的快速算法
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00383-6
Thomas Worsch
{"title":"A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds","authors":"Thomas Worsch","doi":"10.1007/s00236-020-00383-6","DOIUrl":"10.1007/s00236-020-00383-6","url":null,"abstract":"<div><p>In cellular automata with multiple speeds for each cell <i>i</i> there is a positive integer <span>(p_i)</span> such that this cell updates its state still periodically but only at times which are a multiple of <span>(p_i)</span>. Additionally there is a finite upper bound on all <span>(p_i)</span>. Manzoni and Umeo have described an algorithm for these (one-dimensional) cellular automata which solves the Firing Squad Synchronization Problem. This algorithm needs linear time (in the number of cells to be synchronized) but for many problem instances it is slower than the optimum time by some positive constant factor. In the present paper we derive lower bounds on possible synchronization times and describe an algorithm which is never slower and in some cases faster than the one by Manzoni and Umeo and which is close to a lower bound (up to a constant summand) in more cases.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"451 - 462"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00383-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42826962","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
An instruction set for reversible Turing machines 可逆图灵机的指令集
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00388-1
Kenichi Morita
{"title":"An instruction set for reversible Turing machines","authors":"Kenichi Morita","doi":"10.1007/s00236-020-00388-1","DOIUrl":"10.1007/s00236-020-00388-1","url":null,"abstract":"<div><p>A reversible Turing machine (RTM) is a standard model of reversible computing that reflects physical reversibility. So far, to describe an RTM the quadruple formulation and the quintuple formulation have been used. In this paper, we propose the program form as a new formulation for RTMs. There, an RTM is described by a sequence of only five kinds of instructions. It is shown that any RTM in the quintuple form is converted to an RTM in the program form, and <i>vice versa</i>. We also show each instruction is implemented by a particular reversible logic element with memory called a rotary element (RE) very simply. Hence, a circuit that simulates a given RTM is easily and systematically constructed out of REs.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"377 - 396"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00388-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037720","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 the size of partial derivatives and the word membership problem 关于偏导数的大小和词的隶属度问题
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-021-00399-6
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
{"title":"On the size of partial derivatives and the word membership problem","authors":"Stavros Konstantinidis,&nbsp;António Machiavelo,&nbsp;Nelma Moreira,&nbsp;Rogério Reis","doi":"10.1007/s00236-021-00399-6","DOIUrl":"10.1007/s00236-021-00399-6","url":null,"abstract":"<div><p>Partial derivatives are widely used to convert regular expressions to nondeterministic automata. For the word membership problem, it is not strictly necessary to build an automaton. In this paper, we study the size of partial derivatives on the average case. For expressions in strong star normal form, we show that on average and asymptotically the largest partial derivative is at most half the size of the expression. The results are obtained in the framework of analytic combinatorics considering generating functions of parametrised combinatorial classes defined implicitly by algebraic curves. Our average case estimates suggest that a detailed word membership algorithm based directly on partial derivatives should be analysed both theoretically and experimentally.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"357 - 375"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00399-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037379","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}
引用次数: 1
Reversible parallel communicating finite automata systems 可逆并行通信有限自动机系统
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-021-00396-9
Henning Bordihn, György Vaszil
{"title":"Reversible parallel communicating finite automata systems","authors":"Henning Bordihn,&nbsp;György Vaszil","doi":"10.1007/s00236-021-00396-9","DOIUrl":"10.1007/s00236-021-00396-9","url":null,"abstract":"<div><p>We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"263 - 279"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00396-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46009101","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}
引用次数: 1
Operational complexity and right linear grammars 操作复杂性和正确的线性语法
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00386-3
Jürgen Dassow
{"title":"Operational complexity and right linear grammars","authors":"Jürgen Dassow","doi":"10.1007/s00236-020-00386-3","DOIUrl":"10.1007/s00236-020-00386-3","url":null,"abstract":"<div><p>For a regular language <i>L</i>, let <span>({{,mathrm{Var},}}(L))</span> be the minimal number of nonterminals necessary to generate <i>L</i> by right linear grammars. Moreover, for natural numbers <span>(k_1,k_2,ldots ,k_n)</span> and an <i>n</i>-ary regularity preserving operation <i>f</i>, let <span>(g_f^{{{,mathrm{Var},}}}(k_1,k_2,ldots ,k_n))</span> be the set of all numbers <i>k</i> such that there are regular languages <span>(L_1,L_2,ldots , L_n)</span> such that <span>({{,mathrm{Var},}}(L_i)=k_i)</span> for <span>(1le ile n)</span> and <span>({{,mathrm{Var},}}(f(L_1,L_2,ldots , L_n))=k)</span>. We completely determine the sets <span>(g_f^{{{,mathrm{Var},}}})</span> for the operations reversal, Kleene-closures <span>(+)</span> and <span>(*)</span>, and union; and we give partial results for product and intersection.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"281 - 299"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00386-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037375","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}
引用次数: 1
Reversibility for stateless ordered RRWW-automata 无状态有序rrww自动机的可逆性
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-020-00389-0
Friedrich Otto, Matthias Wendlandt
{"title":"Reversibility for stateless ordered RRWW-automata","authors":"Friedrich Otto,&nbsp;Matthias Wendlandt","doi":"10.1007/s00236-020-00389-0","DOIUrl":"10.1007/s00236-020-00389-0","url":null,"abstract":"<div><p>There are two types of stateless deterministic ordered restarting automata that both characterize the class of regular languages: the stl-det-ORWW-automaton and the stl-det-ORRWW-automaton. For the former a notion of <i>reversibility</i> has been introduced and studied that is very much tuned to the way in which restarting automata work. Here we suggest another, more classical, notion of reversibility for stl-det-ORRWW-automata, and we show that each regular language is accepted by such a reversible stl-det-ORRWW-automaton. We study the descriptional complexity of these automata, showing that they are exponentially more succinct than nondeterministic finite-state acceptors. We also look at the case of unary input alphabets.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"397 - 425"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-020-00389-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50037380","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
Preface to Martin Kutrib Festschrift 马丁·库特里布艺术节序言
IF 0.6 4区 计算机科学
Acta Informatica Pub Date : 2021-07-19 DOI: 10.1007/s00236-021-00401-1
Henning Fernau, Andreas Malcher, Giovanni Pighizzini
{"title":"Preface to Martin Kutrib Festschrift","authors":"Henning Fernau,&nbsp;Andreas Malcher,&nbsp;Giovanni Pighizzini","doi":"10.1007/s00236-021-00401-1","DOIUrl":"10.1007/s00236-021-00401-1","url":null,"abstract":"","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"58 4","pages":"241 - 242"},"PeriodicalIF":0.6,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00236-021-00401-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42362666","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学术文献互助群
群 号：481959085
Book学术官方微信