Skip to main content

Symmetry and Concurrency

(Extended Abstract)

  • Conference paper
Algebra and Coalgebra in Computer Science (CALCO 2007)

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

Included in the following conference series:

Abstract

A category of event structures with symmetry is introduced and its categorical properties investigated. Applications to the event-structure semantics of higher order processes, nondeterministic dataflow and the unfolding of higher-dimensional automata and Petri nets with multiple tokens are indicated.

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. Abramsky, S., Jagadeesan, R., Malacaria, P.: Full Abstraction for PCF. Information and Computation 163, 409–470 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Berry, G.: Modèles completement adéquats et stables des λ-calculs typés. Thèse de Doctorat d’Etat, Université de Paris VII (1979)

    Google Scholar 

  3. Burroni, A.: T-catégories. Cahiers de topologie et géométrie différentielle, XII(3) (1971)

    Google Scholar 

  4. Cattani, G.L., Winskel, G.: Profunctors, open maps and bisimulation. In: MSCS (2005)

    Google Scholar 

  5. Cheng, E., Hyland, J.M.E., Power, A.J.: Pseudo-distributive laws. ENTCS 83 (2004)

    Google Scholar 

  6. Crazzolara, F., Winskel, G.: Composing Strand Spaces. In: Agrawal, M., Seth, A.K. (eds.) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 2556, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. van Glabbeek, R.J.: On the expressiveness of higher dimensional automata. EXPRESS 2004. ENTCS 128(2) (2005)

    Google Scholar 

  8. Doghmi, S.F., Guttman, J.D., Thayer, F.J.: Searching for shapes in cryptographic protocols. In: TACAS 2007 (2007)

    Google Scholar 

  9. Hayman, J., Winskel, G.: The unfolding of general Petri nets. Forthcoming.

    Google Scholar 

  10. Johnstone, P.: Sketches of an elephant, a topos theory compendium, vol.1. OUP (2002)

    Google Scholar 

  11. Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. LICS ’93 special issue of Information and Computation 127(2), 164–185 (1996) Available as BRICS report, RS-94-7

    MATH  MathSciNet  Google Scholar 

  12. Kahn, G., Plotkin, G.D.: Concrete domains. TCS 121(1& 2), 187–277 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  13. Koslowski, J.: A monadic approach to polycategories. Theory and Applications of Categories 14(7), 125–156 (2005)

    MathSciNet  Google Scholar 

  14. Mac Lane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)

    MATH  Google Scholar 

  15. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains. TCS 13(1), 85–108 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  16. Nygaard, M.: Domain theory for concurrency. PhD Thesis, University of Aarhus (2003)

    Google Scholar 

  17. Nygaard, M., Winskel, G.: Domain theory for concurrency. TCS 316, 153–190 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  18. Power, A.J.: 2-Categories. BRICS Lecture Notes, Aarhus University (March 1998)

    Google Scholar 

  19. Saunders-Evans, L., Winskel, G.: Event structure spans for non-deterministic dataflow. In: Proc. Express 2006, ENTCS (2006)

    Google Scholar 

  20. Saunders-Evans, L.: Events with persistence. Forthcoming PhD thesis, University of Cambridge Computer Laboratory (2007)

    Google Scholar 

  21. Winskel, G., Nielsen, M.: Models for Concurrency. Handbook of Logic and the Foundations of Computer Science 4, 1–148 OUP (1995)

    MathSciNet  Google Scholar 

  22. Winskel, G.: Events in Computation. PhD thesis, Univ. of Edinburgh (1980), Available from http://www.cl.cam.ac.uk/users/gw104

  23. Winskel, G.: Event structure semantics of CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages, and Programming. LNCS, vol. 140, Springer, Heidelberg (1982), http://www.cl.cam.ac.uk/users/gw104

    Chapter  Google Scholar 

  24. Winskel, G.: A new definition of morphism on Petri Nets. In: STACS 1984: pp. 140–150 (1984)

    Google Scholar 

  25. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986. Proceedings of an Advanced Course. LNCS, vol. 255, Springer, Heidelberg (1987)

    Google Scholar 

  26. Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  27. Winskel, G.: Event structures as presheaves—two representation theorems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, Springer, Heidelberg (1999)

    Google Scholar 

  28. Winskel, G.: Relations in concurrency. In: Invited talk, LICS 2005 (2005)

    Google Scholar 

  29. Winskel, G.: Event structures with symmetry. In: the Plotkin Festschrift. ENTCS 172 (2007), See http://www.cl.cam.ac.uk/users/gw104 for corrections

Download references

Author information

Authors and Affiliations

Authors

Editor information

Till Mossakowski Ugo Montanari Magne Haveraaen

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Winskel, G. (2007). Symmetry and Concurrency . In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds) Algebra and Coalgebra in Computer Science. CALCO 2007. Lecture Notes in Computer Science, vol 4624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73859-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73859-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73857-2

  • Online ISBN: 978-3-540-73859-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics