Skip to main content
SpringerLink
Log in

Make your enemies transparent

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1997)

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

Included in the following conference series:

  • 114 Accesses

Abstract

We design a distributed program that sorts a connected network of processes in an unstable environment. We show two techniques that enable us to factor out dynamic changes to the topology of the network in the specification of the program.

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. K.M. Chandy and J. Misra. Parallel Program Design — A Foundation. Addison-Wesley, 1988.

    Google Scholar 

  2. Mike J.C. Gordon and Tom F. Melham. Introduction to HOL. Cambridge University Press, 1993.

    Google Scholar 

  3. W Prasetya.Mechanically Supported Design of Self-stabilizing Algorithms. PhD thesis, UU, Oct 1995.

    Google Scholar 

  4. K.A. Ross and C. R. B. Wright. Discrete Mathematics. Prentice-Hall, 1992.

    Google Scholar 

  5. T.E.J. Vos, S.D. Swierstra, and I.S.W.B. Prasetya. Formal Methods and Mechanical Verification Applied to the development of a Convergent Distributed Sorting Program. Technical report, UU, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, Netherlands

    Tanga Vos & Doaitse Swierstra

Authors
  1. Tanga Vos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Doaitse Swierstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf H. Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vos, T., Swierstra, D. (1997). Make your enemies transparent. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024509

Download citation

  • DOI: https://doi.org/10.1007/BFb0024509

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63757-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation