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.

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