可重写粒子网的数学实现：动态可重构系统的可行模型

Petri网(PN)是并发或分布式系统的一个中心的、理论上健全的模型，但至少在其经典定义中，它们的表达力不足以表示动态重新配置能力。另一方面，重写逻辑已经被证明是并发/分布式系统的几个形式模型的自然语义框架。我们提出了一种紧凑、高效的动态可重构PT网（带抑制剂弧），以一个简单、容错的制造系统的规范作为运行实例。我们讨论了这种组合方法的优点，以及它所提出的一些关注。

原文题目：A Maude Implementation of Rewritable Petri Nets: a Feasible Model for Dynamically Reconfigurable Systems

原文：Petri Nets (PN) are a central, theoretically sound model for concurrent or distributed systems but, at least in their classical definition, not expressive enough to represent dynamic reconfiguration capabilities. On the other side, Rewriting Logic has proved to be a natural semantic framework for several formal models of concurrent/distributed systems. We propose a compact, efficient Maude formalization of dynamically reconfigurable PT nets (with inhibitor arcs), using as a running example the specification of a simple, fault-tolerant manufacturing system. We discuss the advantages of such a combined approach, as well as some concerns that it raises.