複数種類ネットワーク資源の自律分散相互排除プロトコルとそのマークグラフ解析

抄録

An autonomous distributed mutual exclusion protocol for multiple network resources is disscussed. This protocol is based on acyclic graph evolution model. This paper analyzes firing concurrency of acyclic graph evolution by graph theoretical terms. We show the network topology conditions and the scheme to control the concurrency for the mutual exclution of multiple network resources. A marked graph, a subclass of Petrinets, is often utilized as a proof tool in analysis.