分布式资源共享系统的进展性设计

Progressity design for distributed systems with shared resources

无饥饿性和活性是系统进展性的典型问题 .基于不变式理论 ,针对一类Petri网 ,提出了分布式资源共享系统强制公平性和活性的方法 .首先 ,基于T 不变式 ,把系统的网模型设计为一个公平网 .此后 ,利用P 不变式把一个公平的网模型设计为一个活且公平网 .以著名哲学家就餐问题为例 ,说明了这种方法的应用 .

Starvation freeness and liveness are typical problems of progressity for a distributed system. This paper presents a systematic method to design Petri nets based controllers with fairness and liveness. By using the invariant theory of Petri nets, an approach is proposed to enforce the fair ness and liveness design for distributive systems with shared resources. Firstly, a fair net is obtained by adding some places that make the net have one T invariant. Secondly, a fair net is enforced to be live through the controlling minimal deadlocks by P invariants. The famous dinning philosophers problem is used to demonstrate the methdos proposed in this paper. The results are also of significance for supervisory problems for discrete event systems.