Abstract
Weighted synchronic distances have been introduced by Kurt Lautenbach in [2] for pairs of single events and for nets which are covered by exactly one reproduction component. We will generalize this notion to pairs of sets of events and to arbitrary cyclic condition/ event-systems.
Weighted synchronic distances yield a metric space and meet furthermore some other numerical properties which are already known for unweighted synchronic distances [4]. We will show how to compute weighted synchronic distances and how to find weights which yield finite distances. This will be achieved by help of linear algebra.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
W. Brauer (ed): Net Theory and Applications.- Lecture Notes in Computer Science, Vol. 84, Springer Verlag 1980
H. Genrich, K. Lautenbach, P.S. Thiagarajan: Elements of General Net Theory.- in [1]
H. Genrich, E. Stankiewicz-Wiechno: A Dictionary of Some Basic Notions of Net Theory.- in [1]
U. Goltz, W. Reisig, P.S. Thiagarajan: Two Alternative Definitions of Synchronic Distance.- First European Workshop on Application and Theory of Petri Nets.- Strasbourg 1980, to appear
Special Interest Group “Petri Nets and Related System Models” Newsletter No. 5, Cover Picture Story
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goltz, U., Reisig, W. (1982). Weighted Synchronic Distances. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive