Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS pairs a set of entities with a set of reactions over them. Entities can be used to enable or inhibit each reaction, and are produced by reactions. Entities can also be provided by an external context. RS semantics is defined in terms of an (unlabelled) rewrite system: given the current set of entities, a rewrite step consists of the application of all and only the enabled reactions. In this paper we define, for the first time, a labelled transition system for RSs in the structural operational semantics (SOS) style. This is achieved by distilling a signature whose operators directly correspond to the ingredients of RSs and by defining some simple SOS inference rules for any such operator to define the behaviour of the RS in a compositional way. The rich information recorded in the labels allows us to define an assertion language to tailor behavioural equivalences on some specific properties or entities. The SOS approach is suited to drive additional enhancements of RSs along features such as quantitative measurements of entities and communication between RSs. The SOS rules have been also exploited to design a prototype implementation in logic programming.

中文翻译：

---

反应系统等效性的 SOS 规则

反应系统 (RS) 是一种受生物系统启发的成功计算框架。RS 将一组实体与一组对它们的反应配对。实体可用于启用或抑制每个反应，并且由反应产生。实体也可以由外部上下文提供。RS 语义是根据（未标记的）重写系统定义的：给定当前实体集，重写步骤包括应用所有且仅启用的反应。在本文中，我们首次定义了结构操作语义 (SOS) 风格的 RS 标记转换系统。这是通过提取签名（其运算符直接对应于 RS 的成分）并通过为任何此类运算符定义一些简单的 SOS 推理规则来以组合方式定义 RS 的行为来实现的。标签中记录的丰富信息使我们能够定义断言语言来定制某些特定属性或实体的行为等效性。SOS 方法适用于推动 RS 的其他增强功能，例如实体的定量测量和 RS 之间的通信。SOS 规则还被用于设计逻辑编程中的原型实现。