Skip to main content

Petri Nets, Discrete Physics, and Distributed Quantum Computation

  • Conference paper
Petri Nets and Other Models of Concurrency – ICATPN 2007 (ICATPN 2007)

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

Included in the following conference series:

Abstract

The genius, the success, and the limitation of process calculi is their linguistic character. This provides an ingenious way of studying processes, information flow, etc. without quite knowing, independently of the particular linguistic setting, what any of these notions are. One could try to say that they are implicitly defined by the calculus. But then the fact that there are so many calculi, potential and actual, does not leave us on very firm ground.

An important quality of Petri’s conception of concurrency is that it does seek to determine fundamental concepts: causality, concurrency, process, etc. in a syntax-independent fashion. Another important point, which may originally have seemed merely eccentric, but now looks rather ahead of its time, is the extent to which Petri’s thinking was explicitly influenced by physics (see e.g. [7] . As one example, note that K-density comes from one of Carnap’s axiomatizations of relativity). To a large extent, and by design, Net Theory can be seen as a kind of discrete physics: lines are time-like causal flows, cuts are space-like regions, process unfoldings of a marked net are like the solution trajectories of a differential equation.

This acquires new significance today, when the consequences of the idea that “Information is physical” are being explored in the rapidly developing field of quantum informatics. (One feature conspicuously lacking in Petri Net theory is an account of the non-local information flows arising from entangled states, which play a key role in quantum informatics. Locality is so plausible to us — and yet, at a fundamental physical level, apparently so wrong!). Meanwhile, there are now some matching developments on the physics side, and a greatly increased interest in discrete models. As one example, the causal sets approach to discrete spacetime of Sorkin et al. [8] is very close in spirit to event structures.

My own recent work with Bob Coecke on a categorical axiomatics for Quantum Mechanics [4,5], adequate for modelling and reasoning about quantum information and computation, is strikingly close in the formal structures used to my earlier work on Interaction Categories [6] — which represented an attempt to find a more intrinsic, syntax-free formulation of concurrency theory; and on Geometry of Interaction [1], which can be seen as capturing a notion of interactive behaviour, in a mathematically rather robust form, which can be used to model the dynamics of logical proof theory and functional computation.

The categorical formulation of Quantum Mechanics admits a striking (and very useful) diagrammatic presentation, which suggests a link to geometry — and indeed there are solid connections with some of the central ideas relating geometry and physics which have been so prominent in the mathematics of the past 20 years [3].

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

References

  • Abramsky, S.: Retracing some paths in process algebra. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 1–17. Springer, Heidelberg (1996)

    Google Scholar 

  • Abramsky, S.: What are the fundamental structures of concurrency? We still don’t know? In: APC 25. Proceedings of the Workshop Essays on Algebraic Process Calculi. Electronic Notes in Theoretical Computer Science, vol. 162, pp. 37–41 (2006)

    Google Scholar 

  • Abramsky, S.: Temperley-Lieb algebra: from knot theory to logic and computation via quantum mechanics. To appear in Mathematics of Quantum Computation and Quantum Technology. Chen, G., Kauffman, L., Lomonaco, S. (eds.) Taylor and Francis, pp. 523–566 (2007)

    Google Scholar 

  • Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp. 415–425 (2004) arXiv:quant-ph/0402130.

    Google Scholar 

  • Abramsky, S., Coecke, B.: Abstract physical traces. Theory and Applications of Categories 14, 111–124 (2005)

    MATH  MathSciNet  Google Scholar 

  • Abramsky, S., Gay, S.J., Nagarajan, R.: Interaction categories and foundations of typed concurrent programming. In: Deductive Program Design: Proceedings of the 1994 Marktoberdorf International Summer School. NATO ASI Series F, pp. 35–113. Springer, Heidelberg (1995)

    Google Scholar 

  • Petri, C.-A.: State-Transition Structures in Physics and in Computation. International Journal of Theoretical Physics 21(12), 979–993 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  • Sorkin, R.: First Steps in Causal Sets. Available at http://physics.syr.edu/~sorkin/some.papers/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jetty Kleijn Alex Yakovlev

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Abramsky, S. (2007). Petri Nets, Discrete Physics, and Distributed Quantum Computation. In: Kleijn, J., Yakovlev, A. (eds) Petri Nets and Other Models of Concurrency – ICATPN 2007. ICATPN 2007. Lecture Notes in Computer Science, vol 4546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73094-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73094-1_1

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-73094-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics