Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 254))

Included in the following conference series:

Abstract

The concept of synchronic distance is introduced and motivated by S-completion. A definition based on processes of C/E-systems is given and several properties are proved. Weighted synchronic distances are shortly discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. Best, C. Fernandez: “Notation and Terminology on Petri Net Theory”, Arbeitspapiere der GMD 195, January 1986

    Google Scholar 

  2. H. J. Genrich, K. Lautenbach, P. S. Thiagarajan: “Elements of General Net Theory”, in: Net Theory and Applications, Lecture Notes in Computer Science 84, Springer-Verlag, 1980

    Google Scholar 

  3. U. Goltz, W. Reisig: “Weighted Synchronic Distance”, in: Application and Theory of Petri Nets, Informatik Fachberichte 52, Springer-Verlag, 1982

    Google Scholar 

  4. U. Goltz, W. Reisig, P. S. Thiagarajan: “Two Alternative Definitions of Synchronie Distance”, in: Application and Theory of Petri Nets, Informatik Fachberichte 52, Springer-Verlag 1982

    Google Scholar 

  5. U. Goltz, Yuan Chong-Yi: “Synchronie Structure”, in: Advances in Petri Nets 1985, Lecture Notes in Computer Science 222, Springer-Verlag, 1986

    Google Scholar 

  6. K. Lautenbach: “Ein kombinatorischer Ansatz zur Beschreibung und Erreichung von Fairness in Scheduling-Problemen”, in: Applied Computer Science, Vol. 8, Verlag Carl Hanser, 1977

    Google Scholar 

  7. C. A. Petri: “Interpretations of Net Theory”, internal report GMD-ISF 75-07, revised version, Bonn 1976

    Google Scholar 

  8. W. Reisig: “Petri Nets”, Springer-Verlag, 1985

    Google Scholar 

  9. G. Rozenberg: “Behaviour of Elementary Net Systems”, in this volume

    Google Scholar 

  10. P. S. Thiagarajan: “Elementary Net Systems”, in this volume

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goltz, U. (1987). Synchronic Distance. In: Brauer, W., Reisig, W., Rozenberg, G. (eds) Petri Nets: Central Models and Their Properties. ACPN 1986. Lecture Notes in Computer Science, vol 254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47919-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-47919-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17905-4

  • Online ISBN: 978-3-540-47919-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics