Earticle

초록

영어

This paper gives a solution of the synchronic distance between any two transitions in a fair Petri net. In order to describe the synchronic distance between two transitions more accurately, the concept of weighted synchronic distance is adopted. The solution method is firstly to add a weighted observe-place between two transitions, and a net system with a weighted observe-place is constructed by assigning a suitable weight function for an arc between a transition and an observe-place. Then the initial tokens of a weighted observe-place are obtained by constructing an augumented coverability tree of a net system with a weighted observe-place. The synchronic distance between two transitions is finally yielded by constructing a coverability tree of a net system with a weighted observe-place, and the corresponding solution algorithms are also given.

목차

Abstract
 1. Introduction
 2．A Net System with a Weighted Observe-place and an Augumented Cover Ability Tree
 3. An Algorithm of Computing Synchronic Distance
  3.1. The Algorithm Allocating the Initial Tokens to the Weighted Observe-place
  3.2. The Algorithm for Computation of the Synchronic Distance
 4. Conclusions
 Acknowledgements
 References

키워드

저자

• Li-li Wang [ School of Mathematics and Physics Anhui University of Science and Technology Huainan, Anhui, China ]
• Xiang-wei Liu [ School of Mathematics and Physics Anhui University of Science and Technology Huainan, Anhui, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605