Interface Automata for Shared Memory

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS 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, Walter Vogler, Johannes Gareis, N. Tri Nguyen, Gerald Lüttgen","doi":"10.1007/s00236-021-00408-8","DOIUrl":null,"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":null,"pages":null},"PeriodicalIF":0.4000,"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":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00236-021-00408-8","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 2

Abstract

Interface theories based on Interface Automata (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 IA for shared Memory (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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

共享内存的接口自动机

基于接口自动机(IA)的接口理论是并发系统基于组件规范的形式化方法。它们的基本同步机制的扩展允许数据建模，但在涉及模态转换系统的更复杂的设置中进行研究，或者不能从内部计算中抽象出来。在本文中，我们将展示de Alfaro和Henzinger的原始IA理论如何通过共享内存数据保守地扩展，而不会牺牲简单性或施加限制。我们的共享内存扩展IA (IAM)在共享变量的代数表达式上使用前置和后置条件来修饰转换，这些条件被IA的组件兼容性概念所考虑。由于IAM可以嵌入到IA中，因此可以准确地将IA的兼容性概念提升到共享内存，因此保持了简单性。我们还为IAM提供了一个基础语义，表明我们在IA的开放系统视图中对数据的抽象处理忠实于封闭系统中对数据的标准处理。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.