Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2001: CONCUR 2001 — Concurrency Theory pp 202–217Cite as

Liveness and Fairness in Process-Algebraic Verification

  • Conference paper
  • First Online:

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

Abstract

Although liveness and fairness have been used for a long time in classical model checking, with process-algebraic methods they have seen far less use. One reason for this is that most well-known process-algebraic theories such as CSP and CCS have limited capability for handling liveness properties. In this article we discuss the problems and possibilities of liveness and fairness in process algebra. We show that most well-known semantic equivalences do not preserve enough fairness-related information and that fairness properties are difficult to combine with the bottom-up compositionality of process algebra. However, we also establish positive results for a useful subset of fairness properties. We develop a method that does not assume new fairness-related constructs or rules for processes, but uses the standard LTS model. We demonstrate the method by removing livelocks from a communication protocol.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpern, B. & Schneider, F. “Defining Liveness”. Information Processing Letters, Vol. 21 (No. 4), 1985, North-Holland.

    Google Scholar 

  2. Apt, K., Francez, N. & Katz, S.: “Appraising fairness in languages for distributed programming”. Distributed Computing (1988) Vol. 2 (No. 4), Springer-Verlag, pp. 226–241.

    Article  MATH  Google Scholar 

  3. Bartlett, K. A., Scantlebury, R. A. & Wilkinson, P. T.: “A Note on Reliable Full-Duplex Transmission Over Half-Duplex Links”, Communications of the ACM 12(5) 1969, pp. 260–261.

    Article  Google Scholar 

  4. Bergstra, J. A., Klop, J. W.: “Verification of an Alternating Bit Protocol by Means of Process Algebra”. Mathematical Methods of Specification and Synthesis of Software Systems’ 85, Lecture Notes in Computer Science 215, Springer-Verlag 1985, pp. 9–23.

    Google Scholar 

  5. Brinksma, E., Rensink, A. & Vogler, W.: “Fair Testing”. CONCUR’95, Sixth International Conference on Concurrency Theory, Lecture Notes in Computer Science 962, Springer-Verlag 1995, pp. 313–327.

    Google Scholar 

  6. Clarke, E. M. & Emerson, E. A.: “Synthesis of Synchronization Skeletons for Branching Time Temporal Logic”. Proc. Logic in Programs: Workshop, 1981, Lecture Notes in Computer Science 131, Springer-Verlag 1981, pp. 52–71.

    Google Scholar 

  7. Cleaveland, R. & Lüttgen, G.: “A Semantic Theory for Heterogeneous System Design”. Proc. Foundations of Software Technology and Theoretical Computer Science 2000. Lecture Notes in Computer Science 1974, Springer-Verlag 2000, pp. 312–324.

    Google Scholar 

  8. Costa, G. & Stirling, C.: “A Fair Calculus of Communicating Systems”. Acta Informatica 21 (1984), Springer-Verlag, pp. 417–441.

    Article  MATH  MathSciNet  Google Scholar 

  9. Costa, G. & Stirling, C.: “Weak and Strong Fairness in CCS”. Proc. Mathematical Foundations of Computer Science 1984, Lecture Notes in Computer Science 176, Springer-Verlag 1984, pp. 245–254.

    Chapter  Google Scholar 

  10. Davies, J. & Schneider, S.: “Using CSP to Verify a Timed Protocol over a Fair Medium”. Proc. CONCUR’92, Third International Conference on Concurrency Theory, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 355–369.

    Google Scholar 

  11. Francez, N.: “Fairness”. Springer-Verlag 1986, 295 p.

    Google Scholar 

  12. Hennessy, M.: “Axiomatising Finite Delay Operators”. Acta Informatica 21(1) 1984, Springer-Verlag, pp. 61–88.

    Article  MATH  MathSciNet  Google Scholar 

  13. Hennessy, M.: “An Algebraic Theory of Fair Asynchronous Communicating processes”. Theoretical Computer Science 49 (1987), North-Holland, pp. 121–143.

    Article  MATH  MathSciNet  Google Scholar 

  14. Kaivola, R. & Valmari, A.: “The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic”. Proc. CONCUR’ 92, Third International Conference on Concurrency Theory, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207–221.

    Google Scholar 

  15. Lamport, L.: “Proving the Correctness of Multiprocess Programs”. IEEE Transactions on Software Engineering, Vol. SE-3 (No. 2) 1977, IEEE Computer Society, pp. 125–143.

    Article  MathSciNet  Google Scholar 

  16. Lamport, L.: “The Temporal Logic of Actions”. ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 16 (No. 3) 1994, pp. 872–923.

    Article  Google Scholar 

  17. Lehmann, D., Pnueli, A. & Stavi, J.: “Impartiality, Justice and Fairness: The Ethics of Concurrent Termination”. Proc. Eighth International Colloquium on Automata, Languages and Programming 1981, Lecture Notes in Computer Science 115, Springer-Verlag 1981, pp. 264–277.

    Google Scholar 

  18. Manna, Z. & Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Volume I: Specification. Springer-Verlag 1992, 427 p.

    Google Scholar 

  19. Milner, R.: Communication and Concurrency. Prentice-Hall 1989, 260 p.

    Google Scholar 

  20. Parrow, J.: Fairness Properties in Process Algebra with Applications in Communication Protocol Verification. Ph.D. thesis, Uppsala University, Department of Computer Systems, 1985, 176 p.

    Google Scholar 

  21. Pnueli, A.: “A Temporal Logic of Concurrent Programs”. Theoretical Computer Science, 13, 1981, pp. 45–60.

    Article  MATH  MathSciNet  Google Scholar 

  22. Puhakka, A. & Valmari, A.: “Livelocks, Fairness and Protocol Verification”. Proc. World Computer Conference 2000, Conference on Software: Theory and Practice, International Federation for Information Processing (IFIP), pp. 471–479.

    Google Scholar 

  23. Puhakka, A. & Valmari, A.: “Liveness and Fairness in Process-Algebraic Verification”. To be published as Tampere University of Technology, Software Systems Laboratory Report 24, ISBN 952-15-0650-4.

    Google Scholar 

  24. Queille, J. P. & Sifakis, J.: “Specification and Verification of Concurrent Systems in CESAR”. Proc. Fifth International Symposium on Programming, 1981.

    Google Scholar 

  25. Roscoe, A. W.: The Theory and Practice of Concurrency. Prentice-Hall 1998, 565 p.

    Google Scholar 

  26. Valmari, A.: “Failure-based Equivalences Are Faster Than Many Believe”. Proc. Structures in Concurrency Theory 1995, Springer-Verlag “Workshops in Computing” series, 1995, pp. 326–340.

    Google Scholar 

  27. Valmari, A.: “Compositionality in State Space Verification Methods”. Proc. Application and Theory of Petri Nets 1996, Lecture Notes in Computer Science 1091, Springer-Verlag 1996, pp. 29–56.

    Google Scholar 

  28. Valmari, A., Kemppainen, J., Clegg, M. & Levanto, M.: “Putting Advanced Reachability Analysis Techniques Together: the ‘ARA’ Tool”. Proc. Formal Methods Europe’ 93, Lecture Notes in Computer Science 670, Springer-Verlag 1993, pp. 597–616.

    Google Scholar 

  29. Valmari, A. & Tienari, M.: “Compositional Failure-Based Semantic Models for Basic LOTOS”. Formal Aspects of Computing (1995) 7: 440–468.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Systems Laboratory, Tampere University of Technology, PO Box 553, FIN-33101, Tampere, FINLAND

    Antti Puhakka & Antti Valmari

Authors
  1. Antti Puhakka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antti Valmari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, BRICS, Aalborg University, Fredrik Bajersvej 7, 9220, Aalborg, Denmark

    Kim G. Larsen

  2. BRICS, Aarhus University, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Puhakka, A., Valmari, A. (2001). Liveness and Fairness in Process-Algebraic Verification. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44685-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42497-0

  • Online ISBN: 978-3-540-44685-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation