IEICE TRANSACTIONS on Fundamentals
On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph
Summary :
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 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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.10 pp.1607-1609
- Publication Date
- 1993/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Nets-Oriented Software Specification and Design)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kiyoshi MIKAMI, Hiroshi TAMURA, Masakazu SENGOKU, Yoshio YAMAGUCHI, "On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 10, pp. 1607-1609, October 1993, doi: .
Abstract: 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 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_10_1607/_p
Copy
@ARTICLE{e76-a_10_1607,
author={Kiyoshi MIKAMI, Hiroshi TAMURA, Masakazu SENGOKU, Yoshio YAMAGUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph},
year={1993},
volume={E76-A},
number={10},
pages={1607-1609},
abstract={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 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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - On a Sufficient Condition for a Matrix to be the Synchronic Distance Matrix of a Marked Graph
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1607
EP - 1609
AU - Kiyoshi MIKAMI
AU - Hiroshi TAMURA
AU - Masakazu SENGOKU
AU - Yoshio YAMAGUCHI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1993
AB - 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 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.
ER -
English
