Skip to main content
SpringerLink
Log in
SpringerLink
Log in

JC-Nets

  • Conference paper
  • First Online:
Machines, Computations, and Universality (MCU 2001)

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

Included in the following conference series:

Abstract

In this paper we introduce and study a graphical representation of the join calculus given by the so called jc-nets. jc-nets provide a fully abstract semantics for a Turing complete fragment of the join calculus. Thus a new formal model for concurrency and distributed systems is introduced.This new formal model simplifies Milner’s π-nets, while preserving their expressive power.

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. G. Ciobanu, M. Rotaru.“Faithful π-nets.A Graphical Representation of the Asynchronous π-calculus”, ENTCS, vol.18, 22 p, North-Holland, 1998.

    Google Scholar 

  2. G. Ciobanu, M. Rotaru. “A π-calculus Machine”. In Journal of Universal Computer Science, vol.6(1), 39–59, Springer, 2000.

    MATH  MathSciNet  Google Scholar 

  3. C. Fournet, G. Gonthier. “The Reflexive CHAM and the Join Calculus”.In Proc. POPL’96, ACM Press, 1996.

    Google Scholar 

  4. C. Fournet. “The Join-Calculus: A calculus for Distributed Mobile Programming”, PhD thesis, INRIA Rocquencourt, 1998.

    Google Scholar 

  5. Kon99.B. König. “Description and Verification of Mobile Processes with Graph Rewriting Techniques”, PhD thesis, Technische Universität München, 1999.

    Google Scholar 

  6. Lev98.J. J. Lévy. “Some Results in the Join Calculus”.In Proc.TACS’97, LNCS vol.1281, Springer, 233–249, 1997.

    Google Scholar 

  7. A. Mifsud, R. Milner, A.J. Parrow. “Control Structures”,.In Proc. LICS’95.

    Google Scholar 

  8. A. Mifsud.PhD thesis, University of Edinburgh, 1996.

    Google Scholar 

  9. R. Milner. “The Polyadic p-calculus: a Tutorial”.In Logic and Algebra of Specification, Springer, 203–246, 1993.

    Google Scholar 

  10. R. Milner. “ π-nets: a Graphical Form of π-calculus”.In Proc. ESOP’94, LNCS 788, Springer, 26–42, 1994.

    Google Scholar 

  11. R. Milner. “Calculi for Interaction”, Acta Informatica 33 (8), 707–737, 1996.

    Article  MathSciNet  Google Scholar 

  12. Mil99.R. Milner. Communicating and Mobile Systems: the π-calculus, Cambridge University Press, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Theoretical Computer Science, Romanian Academy, Iaşi, Romania

    Gabriel Ciobanu & Mihai Rotaru

Authors
  1. Gabriel Ciobanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mihai Rotaru
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LITA, UFR MIM, Université de Metz, Ile du Saulcy, 57045, Metz, Cedex, France

    Maurice Margenstern

  2. Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova, 5 Academiei str, 2028, Chiŗinău, Moldova

    Yurii Rogozhin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciobanu, G., Rotaru, M. (2001). JC-Nets. In: Margenstern, M., Rogozhin, Y. (eds) Machines, Computations, and Universality. MCU 2001. Lecture Notes in Computer Science, vol 2055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45132-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45132-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45132-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation