Verifying a protocol using relativized bisimulation | SpringerLink
Skip to main content
Springer Nature Link
Log in

Verifying a protocol using relativized bisimulation

  • Semantics, Concurrency
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1987)

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

Included in the following conference series:

  • 207 Accesses

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. J.A.Bergstra and J.W.Klop: Verification of an Alternating Bit Protocol by means of Process Algebra, Centrum voor Wiskunde en Informatica, Amsterdam, 1984.

    Google Scholar 

  2. C.P.J.Koymans and J.C.Mulder: A Modular Approach to Protocol Verification using Process Algebra, University of Utrecht, Department of Philosophy, Logic Group, Preprint Series no. 6.

    Google Scholar 

  3. K.G.Larsen: A Context Dependent Equivalence between Processes, ICALP'85, LNCS 194. Full version to appear in TCS.

    Google Scholar 

  4. K.G.Larsen: Context-Dependent Bisimulation between Processes, Ph.D. Thesis, Edinburgh, 1986.

    Google Scholar 

  5. K.G.Larsen and R.Milner: A Complete Protocol Verification Using Relativized Bisimulation, R-86-12, Aalborg University Center, Denmark and also ECS-LFCS-86-13, Laboratory for Foundation of Computer Science, Edinburgh University, Scotland.

    Google Scholar 

  6. R.Milner: A Calculus of Communicating Systems, LNCS 92, 1980.

    Google Scholar 

  7. R.Milner: Calculi for Synchrony and Asynchrony, TCS 25, 1983.

    Google Scholar 

  8. D.Park: Concurrency and automata on infinite sequences, LNCS 104, 1981.

    Google Scholar 

  9. K.V.S.Prasad: Specification and Proof of a Simple Fault Tolerant System in CCS, CSR-178-84, Edinburgh University, 1984.

    Google Scholar 

  10. A.A.Schoone and J. van Leeuwen: Verification of Balanced Link-Level Protocol, Rijksuniversitet Utrecht, Vakgroep Informatica, RU-CS-85-12, 1985.

    Google Scholar 

  11. A.S. Tanenbaum: Computer Networks, Prentice-Hall, Inc., Englewood Cliffs, NY, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aalborg University Centre, Denmark

    Kim G. Larsen

  2. Edinburgh University, Scotland

    Robin Milner

Authors
  1. Kim G. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robin Milner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Ottmann

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Larsen, K.G., Milner, R. (1987). Verifying a protocol using relativized bisimulation. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-18088-5_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18088-3

  • Online ISBN: 978-3-540-47747-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics