Verifying temporal properties of processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 458 LNCS, Issue , 1990, Pages 115-125

  Bradfield, Julian ^a   Stifling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0342321402     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0039055     Document Type: Conference Paper

References (14)

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