Skip to main content

Orthomodular Lattices in Occurrence Nets

  • Conference paper
Applications and Theory of Petri Nets (PETRI NETS 2009)

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

Included in the following conference series:

  • 813 Accesses

Abstract

In this paper, we study partially ordered structures associated to occurrence nets. An occurrence net is endowed with a symmetric, but in general non transitive, concurrency relation. By applying known techniques in lattice theory, from any such relation one can derive a closure operator, and then an orthocomplemented lattice. We prove that, for a general class of occurrence nets, those lattices, formed by closed subsets of net elements, are orthomodular. A similar result was shown starting from a simultaneity relation defined, in the context of special relativity theory, on Minkowski spacetime. We characterize the closed sets, and study several properties of lattices derived from occurrence nets; in particular we focus on properties related to K-density. We briefly discuss some variants of the construction, showing that, if we discard conditions, and only keep the partial order on events, the corresponding lattice is not, in general, orthomodular.

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.

References

  1. Petri, C.A.: Non-sequential processes. Technical Report ISF-77–5, GMD Bonn (1977) Translation of a lecture given at the IMMD Jubilee Colloquium on ‘Parallelism in Computer Science’, Universität Erlangen–Nürnberg (June 1976)

    Google Scholar 

  2. Best, E., Fernandez, C.: Nonsequential Processes–A Petri Net View. EATCS Monographs on Theoretical Computer Science, vol. 13. Springer, Heidelberg (1988)

    Book  MATH  Google Scholar 

  3. Wolfram, S.: A New Kind of Science. Wolfram Media (2002)

    Google Scholar 

  4. Petri, C.A.: Rechnender netzraum. Spektrum der Wissenschaft, Spezial 3/07: Ist das Universum ein Computer? 16–19 (2007)

    Google Scholar 

  5. Petri, C.A.: On the physical basis of information flow – abstract. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, p. 12. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Bombelli, L., Lee, J., Meyer, D., Sorkin, R.: Spacetime as a causal set. Phys. Rev. Lett. 60, 521–524 (1985)

    MathSciNet  Google Scholar 

  7. Abramsky, S.: Petri nets, discrete physics, and distributed quantum computation. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 527–543. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Cegła, W., Jadczyk, Z.: Causal logic of Minkowski space. Commun. Math. Phys. 57, 213–217 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  9. Casini, H.: The logic of causally closed spacetime subsets. Class. Quantum Grav. 19, 6389–6404 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fernandez, C., Thiagarajan, P.S.: A lattice theoretic view of k-density. Arbeitspapiere der GMD, n. 76 (1983)

    Google Scholar 

  11. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theoretical Computer Science 13, 85–108 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  12. Petri, C.A.: Nets, time and space. Theoretical Computer Science 153, 3–48 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pták, P., Pulmannová, P.: Orthomodular Structures as Quantum Logics. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  14. Beltrametti, E.G., Cassinelli, G.: The logic of quantum mechanics. Encyclopedia of Mathematics and its Applications, vol. 15. Addison-Wesley, Reading (1981)

    MATH  Google Scholar 

  15. Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society (1979)

    Google Scholar 

  16. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  17. Petri, C.A.: Concepts of net theory. In: Mathematical Foundations of Computer Science: Proc. of Symposium and Summer School, High Tatras, September 3–8, 1973, pp. 137–146. Math. Inst. of the Slovak Acad. of Sciences (1973)

    Google Scholar 

  18. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernardinello, L., Pomello, L., Rombolà, S. (2009). Orthomodular Lattices in Occurrence Nets. In: Franceschinis, G., Wolf, K. (eds) Applications and Theory of Petri Nets. PETRI NETS 2009. Lecture Notes in Computer Science, vol 5606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02424-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02424-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02423-8

  • Online ISBN: 978-3-642-02424-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics