Skip to main content
SpringerLink
Log in

A Linear Metalanguage for Concurrency

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1999)

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

Abstract

A metalanguage for concurrent process languages is introduced. Within it a range of process languages can be defined, including higher-order process languages where processes are passed and received as arguments. The metalanguage is provided with two interpretations both of which can be understood as categorical models of a variant of linear logic. One interpretation is in a simple category of nondeterministic domains; here a process will denote its set of traces. The other interpretation, obtained by direct analogy with the nondeterministic domains, is in a category of presheaf categories; the nondeterministic branching behaviour of a process is captured in its denotation as a presheaf. Every presheaf category possesses a notion of (open-map) bisimulation, preserved by terms of the metalanguage. The conclusion summarises open problems and lines of future work.

Basic Research in CS, Centre of the Danish National Research Foundation.

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

Access this chapter

Log in via an institution
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. S. Abramsky. Computational interpretation of linear logic. Tech. Report 90/20, Dept. of Computing, Imperial College, 1990.

    Google Scholar 

  2. G. L. Cattani. Forthcoming PhD thesis, CS Dept., University of Aarhus.

    Google Scholar 

  3. G. L. Cattani, M. Fiore, and G. Winskel. A Theory of Recursive Domains with Applications to Concurrency. In Proc. of LICS’ 98.

    Google Scholar 

  4. G. L. Cattani, I. Stark, and G. Winskel. Presheaf Models for the π-Calculus. In Proc. of CTCS’ 97, LNCS 1290, 1997.

    Google Scholar 

  5. G. L. Cattani and G. Winskel. Presheaf Models for Concurrency. In Proc. of CSL’ 96, LNCS 1258, 1997.

    Google Scholar 

  6. G. L. Cattani and G. Winskel. On bisimulation for higher order processes. Manuscript, 1998.

    Google Scholar 

  7. G. L. Cattani, A. J. Power and G. Winskel. A categorical axiomatics for bisimulation. In Proc. of CONCUR’98, LNCS 1466, 1998.

    Google Scholar 

  8. M. Hennessy and G.D. Plotkin. Full abstraction for a simple parallel programming language. In Proc. of MFCS’79, LNCS 74, 1979.

    Google Scholar 

  9. C.A.R. Hoare. A model for communicating sequential processes. Tech. Report PRG-22, University of Oxford Computing Lab., 1981.

    Google Scholar 

  10. A. Joyal and I. Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, 70:51–86, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127:164–185, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  12. G. Winskel and K. Larsen. Using information systems to solve recursive domain equations effectively. LNCS173, 1984.

    Google Scholar 

  13. R. Milner. Communication and concurrency. Prentice Hall, 1989.

    Google Scholar 

  14. R. Milner. Calculi for Interaction. Acta Informatica 33, 1996.

    Google Scholar 

  15. M. Nielsen, G.D. Plotkin and G. Winskel. Petri nets, Event structures and Domains, part 1. Theoretical Computer Science, vol. 13, 1981.

    Google Scholar 

  16. G. Winskel. An introduction to event structures. In Proc. of REX summerschool in temporal logic,’ May 88, LNCS 354, 1988.

    Google Scholar 

  17. G. Winskel. A presheaf semantics of value-passing processes. In Proceedings of CONCUR’96, LNCS 1119, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, University of Aarhus, Denmark

    Glynn Winskel

Authors
  1. Glynn Winskel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática, Pontifícia Laboratório de Métodos Formais, Universidade Católica do Rio de Janeiro, Rua Marquês De São Vicente, 225, 22453-900, Rio de Janeiro, RJ, Brazil

    Armando M. Haeberer

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Winskel, G. (1998). A Linear Metalanguage for Concurrency. In: Haeberer, A.M. (eds) Algebraic Methodology and Software Technology. AMAST 1999. Lecture Notes in Computer Science, vol 1548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49253-4_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-49253-4_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65462-9

  • Online ISBN: 978-3-540-49253-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation