Abstract
Three notions of distance for measuring the synchronic dependence of transition firings in Petri nets are studied. For the first two notions we present algorithms for obtaining a basis of the linear space of weight vectors for which the distance is finite, and methods for computing the distance for any given weight vector by examining a finite set of vectors obtained a priori. For the third notion of distance, the problem of deciding whether a given weight vector yields a finite distance is shown to be equivalent to the reachability problem. Finally it is shown that a basis of the linear space of weight vectors for which the weighted sum of token counts is bounded over all reachable markings can be obtained effectively. Also some complexity results are given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
