Verifying temporal properties of processes

  • Julian Bradfield
  • Colin Stirling
Selected Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 458)


Temporal Logic Relay Station Safety Property Slot Machine Propositional Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Bradfield, ‘Proving temporal properties of Petri Nets', Proc. 11th Int. Conf. on Theory and Application of Petri Nets, 1990.Google Scholar
  2. [2]
    J. Bradfield, C. Stirling, ‘Local model checking for infinite state spaces', Technical Report LFCS-90-115, University of Edinburgh 1990.Google Scholar
  3. [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. [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. [5]
    M. Hennessy, R. Milner, ‘Algebraic laws for nondeterminism and concurrency', J. Assoc. Comput. Mach. 32, 137–161, 1985.Google Scholar
  6. [6]
    D. Kozen, ‘Results on the propositional mu-calculus', Theoretical Computer Science 27, 333–354, 1983.Google Scholar
  7. [7]
    K. Larsen, ‘Proof systems for Hennessy-Milner logic with recursion', Proc. CAAP 1988. (To appear in Inf. and Comp.)Google Scholar
  8. [8]
    R. Milner, Communication and Concurrency, Prentice-Hall 1989.Google Scholar
  9. [9]
    V. Pratt, ‘A decidable μ-calculus', Proc. 22nd. FOCS, 421–27, 1981.Google Scholar
  10. [10]
    C. Stirling, ‘Temporal logics for CCS', LNCS 354, 660–672, 1989.Google Scholar
  11. [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. [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. [13]
    D. J. Walker, ‘Automated analysis of mutual exclusion algoritms using CCS', Formal Aspects of Computing 1, 273–292, 1989.Google Scholar
  14. [14]
    G. Winskel, ‘Model checking the modal nu-Calculus', Proc. ICALP 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Julian Bradfield
    • 1
  • Colin Stirling
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghEdinburghUK

Personalised recommendations