Skip to main content
SpringerLink
Log in

Causality and true concurrency: A data-flow analysis of the Pi-Calculus

Extended abstract

  • Refereed Contributions
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1995)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky and R. Jagadeesan. New foundations for the geometry of interaction. Information and Computation, 111(1):53–119, 1994.

    Google Scholar 

  2. Samson Abramsky. A generalized Kahn principle for abstract asynchronous networks. In Mathematical Foundations of Programming Semantics, pages 1–21. Springer-Verlag, 1989. Lecture Notes in Computer Science Vol. 442.

    Google Scholar 

  3. L. Aceto and M. Hennessy. Towards action-refinement in process algebras. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 138–145. IEEE Computer Society Press, 1989.

    Google Scholar 

  4. M. Boreale and S. Sangiorgi. A fully abstract semantics for causality in the π-calculus. Technical report, University of Edinburgh, 1994. Tec. Rep.ECS-LFCS-94-297.

    Google Scholar 

  5. G. Boudol, I. Castellani, Matthew C. Hennessy, and A. Kiehn. A theory of processes with localities. In Proceedings of International Conference on Concurrency Theory, Volume 630 of Lecture Notes in Computer Science, pages 108–122, 1992.

    Google Scholar 

  6. T. Coquand, C. Gunter, and G. Winskel. dI-domains as a model of polymorphism. In Third Workshop on the Mathematical Foundations of Programming Language Semantics, pages 344–363. Springer-Verlag, 1987.

    Google Scholar 

  7. D. Degano and D. Darondeau. Causal trees. In Proceedings of ICALP '89, Volume 372 of Lecture Notes in Computer Science, pages 234–248, 1989.

    Google Scholar 

  8. J.-Y. Girard. Linear Logic. Theoretical Computer Science, 50(1):1–102, 1987.

    Google Scholar 

  9. J.-Y. Girard. Geometry of interaction 1: Interpretation of System F. In R. Ferro et al., editor, Logic Colloquium 88. North Holland, 1989.

    Google Scholar 

  10. Ursula Goltz. CCS and Petri nets. Technical report, GMD, July 1990.

    Google Scholar 

  11. Roberto Gorrieri. Refinement, Atomicity, and Transactions for Process Description Languages. PhD thesis, University of Pisa, 1991.

    Google Scholar 

  12. Lalita Jategaonkar. Observing “True” Concurrency. PhD thesis, Massachusetts institute of Technology, September 1993. Supervised by Albert R. Meyer.

    Google Scholar 

  13. Lalita Jategaonkar and Albert R. Meyer. Testing equivalence for Petri nets with action refinement. In Proceedings of International Conference on Concurrency Theory, Volume 630 of the Lecture Notes in Computer Science, pages 17–31, 1992.

    Google Scholar 

  14. G. Kahn. The semantics of a simple language for parallel programming. In Information Processing 74, pages 993–998. North-Holland, 1977.

    Google Scholar 

  15. G. Kahn and D. MacQueen. Coroutines and networks of parallel proceses. In Proceedings of IFIP Congress. North-Holland, 1977.

    Google Scholar 

  16. A. Kiehn. Local and global causes. Technical report, Technische Universitat Munchen, 1991.

    Google Scholar 

  17. R. Milner. Functions as processes. In Proceedings of ICALP 90, volume 443 of Lecture Notes in Computer Science, pages 167–180. Springer-Verlag, 1990.

    Google Scholar 

  18. R. Milner. The polyadic pi-calculus: a tutorial. Technical Report ECS-LFCS-91-180, University of Endinburgh, 1991.

    Google Scholar 

  19. Robin Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall, 1989.

    Google Scholar 

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

    Google Scholar 

  21. Vaughan Pratt. Modeling concurrency with partial orders. International Journal Of Parallel Programming, 15(1):33–71, 1986.

    Google Scholar 

  22. J. R. Russell. On oraclizable networks and kahn's principle. In Proceedings of ACM Symposium on Principles of Programming Languages, 1990.

    Google Scholar 

  23. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992.

    Google Scholar 

  24. D. Sangiorgi. Locality and non-interleaving semantics in calculi for mobile processes. In Proceedings of ICALP '94, Lecture Notes in Computer Science, 1994.

    Google Scholar 

  25. Rob van Glabbeek and Frits Vaandrager. Petri net models for algebraic theories of concurrency. In Proceedings of PARLE, Volume 259 of the Lecture Notes in Computer Science, pages 224–242, 1987.

    Google Scholar 

  26. Walter Vogler. Modular Construction and Partial Order Semantics of Petri Nets, volume 625 of Lecture Notes in Computer Science. Springer-Verlag, 1992. 252 pp.

    Google Scholar 

  27. David Walker. π-calculus semantics of object-oriented programming languages. In Theoretical Aspects of Computer Software, pages 532–547, 1991.

    Google Scholar 

  28. Glynn Winskel. Event structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, Volume 255 of Lecture Notes in Computer Science, pages 325–392 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Production Research Dept., AT&T Bell Laboratories, 60566, Naperville, IL, USA

    Lalita Jategaonkar Jagadeesan

  2. Math. Sciences, Loyola University, 60626, Chicago, IL, USA

    Radha Jagadeesan

Authors
  1. Lalita Jategaonkar Jagadeesan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Radha Jagadeesan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. S. Alagar Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jategaonkar Jagadeesan, L., Jagadeesan, R. (1995). Causality and true concurrency: A data-flow analysis of the Pi-Calculus. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-60043-4_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60043-5

  • Online ISBN: 978-3-540-49410-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation