2022-05-18T20:39:23Zhttps://niigata-u.repo.nii.ac.jp/oaioai:niigata-u.repo.nii.ac.jp:000019292021-03-01T09:04:24ZOn a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked GraphMikami, KiyoshiTamura, HiroshiSengoku, MasakazuYamaguchi, YoshiocopyrightÂ©1993 IEICEmarked graphsynchronic distance matrixdistance matrixThe 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 wellknown that the synchronic disrance 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.The Institute of Electronics, Information and Communication Engineers1993-10engjournal articlehttp://hdl.handle.net/10191/6513https://niigata-u.repo.nii.ac.jp/records/1929http://www.ieice.org/jpn/trans_online/AA1082623909168508IEICE transactions on fundamentals of electronics, communications and computer sciencesIEICE transactions on fundamentals of electronics, communications and computer sciencesE76-A1016071609https://niigata-u.repo.nii.ac.jp/record/1929/files/e76-a_10_1607.pdfapplication/pdf214.9 kB2019-07-29