[go: up one dir, main page]

Skip to main content

Verifying temporal properties of processes

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '90 Theories of Concurrency: Unification and Extension (CONCUR 1990)

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

Included in the following conference series:

  • 190 Accesses

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.

References

  1. J. Bradfield, ‘Proving temporal properties of Petri Nets', Proc. 11th Int. Conf. on Theory and Application of Petri Nets, 1990.

    Google Scholar 

  2. J. Bradfield, C. Stirling, ‘Local model checking for infinite state spaces', Technical Report LFCS-90-115, University of Edinburgh 1990.

    Google Scholar 

  3. E. M. Clarke, E. A. Emerson, A. P. Sistla, ‘Automatic verification of finite-state concurrent systems using temporal logic specifications: a practical approach’ Tenth ACM Symposium on Principles of Programming Languages. ACM, Austin, Texas, 1983.

    Google Scholar 

  4. R. Cleaveland, ‘Tableau-based model checking in the Propositional Mu-Calculus', Technical Report, University of Sussex 1988. (To appear in Acta Informatica)

    Google Scholar 

  5. M. Hennessy, R. Milner, ‘Algebraic laws for nondeterminism and concurrency', J. Assoc. Comput. Mach. 32, 137–161, 1985.

    Google Scholar 

  6. D. Kozen, ‘Results on the propositional mu-calculus', Theoretical Computer Science 27, 333–354, 1983.

    Google Scholar 

  7. K. Larsen, ‘Proof systems for Hennessy-Milner logic with recursion', Proc. CAAP 1988. (To appear in Inf. and Comp.)

    Google Scholar 

  8. R. Milner, Communication and Concurrency, Prentice-Hall 1989.

    Google Scholar 

  9. V. Pratt, ‘A decidable μ-calculus', Proc. 22nd. FOCS, 421–27, 1981.

    Google Scholar 

  10. C. Stirling, ‘Temporal logics for CCS', LNCS 354, 660–672, 1989.

    Google Scholar 

  11. C. Stirling, D. J. Walker, ‘Local model checking in the modal mu-calculus', TAPSOFT 89 (369–382). LNCS 351, 1989. (To appear in Theoretical Computer Science)

    Google Scholar 

  12. C. Stirling, D. J. Walker, ‘A general tableau technique for verifying temporal properties of concurrent programs', Proc. Int. BCS-FACS Workshop on Semantics For Concurrency, 1990.

    Google Scholar 

  13. D. J. Walker, ‘Automated analysis of mutual exclusion algoritms using CCS', Formal Aspects of Computing 1, 273–292, 1989.

    Google Scholar 

  14. G. Winskel, ‘Model checking the modal nu-Calculus', Proc. ICALP 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. C. M. Baeten J. W. Klop

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bradfield, J., Stirling, C. (1990). Verifying temporal properties of processes. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039055

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46395-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics