On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph (Special Section on Nets-Oriented Software Specification and Design)

概要

論文の詳細を見る
The synchronic distance is a fundamental concept in a Petri net. Marked graphs form a subclass of Petri nets. Given a matrix D, we are interested in the problem of finding a marked graph whose synchronic distance matrix is D. It is well-known that the synchronic distance matrix of a marked graph is a distance matrix. In this letter, we give a matrix D such that D is a distance matrix and there does not exist a marked graph whose synchronic distance matrix is D.
社団法人電子情報通信学会の論文
1993-10-25