属性图重写中的并行独立性
Parallel Independence in Attributed Graph Rewriting
摘要：
为了定义图变换的并发规则的同时应用，我们在以前的工作中采用了一种结构的属性图稳定的工会。我们分析的后果并行独立性，一个属性的特点，诉诸顺序重写的可能性。这个性质不仅取决于规则的左边，就像在图重写的代数方法中一样，而且取决于规则的右边。然后，它表明，三种可能的定义并行重写，只有一个是方便的平行独立性。
英文摘要：
In order to define graph transformations by the simultaneous application of concurrent rules, we have adopted in previous work a structure of attributed graphs stable by unions. We analyze the consequences on parallel independence, a property that characterizes the possibility to resort to sequential rewriting. This property turns out to depend not only on the left-hand side of rules, as in algebraic approaches to graph rewriting, but also on their right-hand side. It is then shown that, of three possible definitions of parallel rewriting, only one is convenient in the light of parallel independence.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
