Skip to main content
SpringerLink
Log in

The limit of split n -bisimulations for CCS agents

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

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

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. L. Aceto, M. Hennessy: Adding Action Refinement to a Finite Process Algebra, University of Sussex, Report No. 6/90, 1990.

    Google Scholar 

  2. B. Bloom, S. Istrail, A.R. Mayer: Bisimulation can't be Traced, in Proc. 15th Principles of Programming Languages (POPL'88), San Diego, California, 229–239, 1988.

    Google Scholar 

  3. R.J. van Glabbeek, F.W. Vaandrager: Petri Nets Models for Algebraic Theories of Concurrency, in Proc. PARLE Conference, LNCS 259, Springer-Verlag, 224–242, 1987.

    Google Scholar 

  4. R.J. van Glabbeek, F.W. Vaandrager: The Difference between Splitting in n and in n+1, in preparation.

    Google Scholar 

  5. R. Gorrieri: Refinement, Atomicity and Transactions for Process Description Languages, PhD Thesis, University of Pisa, TD-2/91, March 1991.

    Google Scholar 

  6. R. Gorrieri, C. Laneve: Split-and St-Semantics for CCS, Internal Report, University of Pisa, 1991.

    Google Scholar 

  7. R. Gorrieri, C. Laneve: The Coarsest Bisimulation Congruence for CCS plus Refinement, forthcoming.

    Google Scholar 

  8. M. Hennessy: Axiomatising Finite Concurrent Processes, SIAM Journal on Computing, 17 (5), 997–1014, 1988.

    Google Scholar 

  9. R. Milner: Communication and Concurrency, Prentice Hall, 1989.

    Google Scholar 

  10. D. Park: Concurrency and Automata on Infinite Sequences, LNCS 104, Springer-Verlag, 1981.

    Google Scholar 

  11. G. Plotkin: A Structural Approach to Operational Semantics, Report DAIMI-FN-19, Computer Science Dept, Arhus University, Denmark, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, I-56125, Pisa, Italy

    Roberto Gorrieri & Cosimo Laneve

Authors
  1. Roberto Gorrieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cosimo Laneve
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gorrieri, R., Laneve, C. (1991). The limit of split n -bisimulations for CCS agents. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation