树的CCS
CCS for Trees
摘要：
CCS可以被认为是有限状态自动机的最自然的扩展，其中由于并行组合而使得交互成为可能。我们在这里提出了一个类似的自顶向下树自动机的扩展。我们引入了一个并行组合，这是由一个图的顶点，其中子进程位于参数化。通信只允许在图中的边所关联的子进程之间进行。我们定义了一个观察等价的基础上倒钩以及弱双相似等价，并证明了这两个概念的充分性定理。
英文摘要：
CCS can be considered as a most natural extension of finite state automata in which interaction is made possible thanks to parallel composition. We propose here a similar extension for top-down tree automata. We introduce a parallel composition which is parameterized by a graph at the vertices of which subprocesses are located. Communication is allowed only between subprocesses related by an edge in this graph. We define an observational equivalence based on barbs as well as weak bisimilarity equivalence and prove an adequacy theorem relating these two notions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
