Skip to main content

On the Structure of Cycloids Introduced by Carl Adam Petri

  • Conference paper
  • First Online:
Application and Theory of Petri Nets and Concurrency (PETRI NETS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10877))

Abstract

Cycloids are particular Petri nets for modelling processes of actions or events. They belong to the fundaments of Petri’s general systems theory and have very different interpretations, ranging from Einstein’s relativity theory to elementary information processing gates. Despite their simple definitions, their properties are still not completely understood. This contribution provides for the first time a formal definition together with new results concerning their structure. For instance, it is shown that the minimal length of a cycle is the length of a local basic circuit, possibly decreased by an integer multiple of the number of semi-active transitions.

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 EPUB and 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

Notes

  1. 1.

    In the net, the gaps are also ordinary black tokens, but represented here by a cross to distinguish them from the cars.

  2. 2.

    In his Hamburg lecture 2004 [8] and in [9] Petri introduced the denomination natural coordinates whereas in an earlier publication [7] the term Minkowski coordinates has been used. This shows that he also saw the necessity to use a different name.

  3. 3.

    See more about the notion of slowness in Sect. 4.

  4. 4.

    The cycloid model generator cyclogen written by Fenske, in combination with the RENEW tool.

  5. 5.

    The net is known as “oscillator net” or “four seasons net”. See also Fig. 9.

  6. 6.

    \(F^{-1}[x]\) is the relational image of the element x with respect to the inverse of the relation F.

  7. 7.

    denotes the set of positive integers.

  8. 8.

    \(\mathord {\equiv }[A]\) is the relational image of the set A with respect to the relation \(\mathord {\equiv }\).

    \([\![x]\!]_{\equiv }\) denotes the equivalence class to which x belongs in the quotient \(X_1/_\equiv \).

  9. 9.

    These sets are not disjoint.

  10. 10.

    Reported by Fenske.

  11. 11.

    They are in the concurrency relation co.

  12. 12.

    We will use the term initial marking, for short.

  13. 13.

    For the definitions of safe and secure see [7], whereas live was used in the usual form (e.g. see [2], p. 59). For a cycloid to be secure \(\alpha ,\beta ,\gamma ,\delta \ge 2\) is required.

  14. 14.

    First and last with respect to the space dimension.

  15. 15.

    It may be helpful for the reader to consider Fig. 7, which illustrates the proof and is explained afterwards.

  16. 16.

    Such unfoldings of the fundamental parallelogram have been frequently used by Petri, see “Nets, Time and Space” [7], Fig. 11, for instance.

References

  1. Fenske, U.: Petris Zykloide und Überlegungen zur Verallgemeinerung. Diploma thesis (2008)

    Google Scholar 

  2. Girault, C., Valk, R. (eds.): Petri Nets for System Engineering - A Guide to Modelling, Verification and Applications. Springer, Berlin (2003). https://doi.org/10.1007/978-3-662-05324-9. 585 p.

    Book  MATH  Google Scholar 

  3. Kummer, O.: Axiomatic Systems in Concurrency Theory. Logos Verlag Berlin, Berlin (2001)

    MATH  Google Scholar 

  4. Kummer, O., Stehr, M.-O.: Petri’s axioms of concurrency a selection of recent results. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 195–214. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63139-9_37

    Chapter  Google Scholar 

  5. Langner, P.: Cycloids’ Characteristics (2013). http://cycloids.adventas.de/

  6. Petri, C.A.: Collection of Handwritten Scripts on Cycloids. Lecture University of Hamburg (1990/1991)

    Google Scholar 

  7. Petri, C.A.: Nets, time and space. Theor. Comput. Sci. 153, 3–48 (1996)

    Article  MathSciNet  Google Scholar 

  8. Petri, C.A.: Slides of the Lecture “Systematik der Netzmodellierung”, Hamburg (2004). http://www.informatik.uni-hamburg.de/TGI/mitarbeiter/profs/petri_eng.html

  9. Petri, C.A., Valk, R.: On the Physical Basics of Information Flow - Results obtained in cooperation Konrad Zuse. http://www.informatik.uni-hamburg.de/TGI/mitarbeiter/profs/petri_eng.html (2008)

  10. Smith, E., Reisig, W.: The semantics of a net is a net - an exercise in general net theory. In: Voss, K., Genrich, J., Rozenberg, G. (eds.) Concurrency and Nets, pp. 461–479. Springer, Berlin (1987). https://doi.org/10.1007/978-3-642-72822-8_29

    Chapter  Google Scholar 

  11. Stehr, M.O.: System specification by cyclic causality constraints. Technical report 210, Department of Informatics, University Hamburg (1998)

    Google Scholar 

  12. Stehr, M.O.: Characterizing security in synchronization graphs. Petri Net Newsl. 56, 17–26 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rüdiger Valk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Valk, R. (2018). On the Structure of Cycloids Introduced by Carl Adam Petri. In: Khomenko, V., Roux, O. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2018. Lecture Notes in Computer Science(), vol 10877. Springer, Cham. https://doi.org/10.1007/978-3-319-91268-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91268-4_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91267-7

  • Online ISBN: 978-3-319-91268-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics