Abstract games for infinite state processes

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

Volumn 1466, Issue , 1998, Pages 147-162

  Stevens, Perdita ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

ABSTRACT GAMES; GENERIC ALGORITHM; INFINITE STATE; LEVEL OF ABSTRACTION; TIMED AUTOMATA; VALUE PASSING PROCESS; VERIFICATION PROBLEMS; WINNING STRATEGY;

MODEL CHECKING;

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

References (15)

1. R. Alur and D.L.Dill, Theory of Timed Automata, Theoretical Computer Science 126(2) pp 183-235, 1994
2. J. Bradfield and C. Stirling, Local model checking for infinite state spaces. Theoretical Computer Science, 96 pp 157-174 (1992).
3. K. Cerans, Decidability of bisimulation for parallel timer processes, CAV 92.
4. D. Clark, L. Errington and C. Hankin, Static Analysis of Value-Passing Process Calculi, in Theory and Formal Methods 1994.
5. R. Cleaveland, Optimality in Abstractions of Model Checking, LNCS 983 pp 51-63, 1995.
6. R. Cleaveland and J. Reily. Testing-based abstractions for value-passing systems. Proceedings of CONCUR’94, LNCS 836, pp4 17-432.
7. P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Logic and Computation 2(4) pp 511-547, 1992.
8. M. Dam, Model Checking Mobile Processes, Information and Computation 129, 35-51, 1996.
9. M. Hennessy and H. Lin, Symbolic Bisimulations. Theoretical Computer Science, 138: 353-389, 1995.
10. B. Jonsson and J. Parrow, Deciding bisimulation equivalences for a class of nonfinite- state programs. Information and Computation, 107(2) pp 272-302, Dec 1993.
11. H. Lin, Symbolic Transition Graph with Assignment. Proceedings of CONCUR’ 96, LNCS 1119, pp 50-65.
12. R. Milner, Communication and Concurrency. Prentice Hall 1989.
13. J. Rathke, Symbolic Techniques for Value-Passing Calculi. PhD. thesis, University of Sussex, 1997.
14. P. Stevens and C. Stifling, Practical Model-Checking using Games. Proceedings of TACAS’98, LNCS 1384, pp 85-101
15. C. Stifling, Modal and temporal logics for processes. LNCS 1043 pp 149-237. 1996.