图重写的结构化操作语义
Structured Operational Semantics for Graph Rewriting
摘要：
进程演算和图转换系统提供了具有标记转换语义的反应系统模型。虽然进程演算的语义是组合的，但一般来说，图转换系统的情况并非如此。因此，这篇文章的目标是获得一个组合语义图转换系统类似的结构操作语义（SOS）米尔纳的演算通信系统（CCS）。本文介绍了图变换系统的标准标号变迁语义的SOS式公理化。第一个结果是它等同于所谓的借用上下文技术。不幸的是，公理化不是以预期的方式组成的，因为没有规则捕获子系统的“内部”通信。主要结果表明，这样的规则是可导的，如果给定的图转换系统享有一定的属性，我们称之为“互补的行动”。这种系统的典型例子是交互网络。我们还讨论了出现的问题，如果“行动的互补性”被违反。
英文摘要：
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a compositional semantics for graph transformation system in analogy to the structural operational semantics (SOS) for Milner's Calculus of Communicating Systems (CCS). The paper introduces an SOS style axiomatization of the standard labelled transition semantics for graph transformation systems. The first result is its equivalence with the so-called Borrowed Context technique. Unfortunately, the axiomatization is not compositional in the expected manner as no rule captures "internal" communication of sub-systems. The main result states that such a rule is derivable if the given graph transformation system enjoys a certain property, which we call "complementarity of actions". Archetypal examples of such systems are interaction nets. We also discuss problems that arise if "complementarity of actions" is violated.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
