Skip to main content

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Editor information

Patrice Godefroid

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1996). Persistent sets. In: Godefroid, P. (eds) Partial-Order Methods for the Verification of Concurrent Systems. Lecture Notes in Computer Science, vol 1032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60761-7_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-60761-7_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics