Local model checking for value-passing processes

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

Volumn 1281, Issue , 1997, Pages 250-266

  Rathke, J ^a   Hennessy, M ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE; FORMAL LOGIC; TEMPORAL LOGIC;

CERTAIN RULE; LIVENESS PROPERTIES; LOCAL MODEL CHECKING; MODAL FORMULAS; MODAL MU CALCULUS; PROOF OBLIGATIONS; RECURSIVE DEFINITIONS; VALUE PASSING PROCESS;

MODEL CHECKING;

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

References (14)

1. R, Amadio and M. Dam, Toward a modal theory of types for the 7r-calculus, In Proc. Formal Techniques in Rea! Time (ini Fault Tolerant Systems, Uppsala 96, volume 1135 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
2. M. Dam, Model checking mobile processes. In E. Best, editor, Proceedings CONCUR 93, Hildesheim, volume 715 of Lecture Notes in Computer Science, pages 22-36. Springer-Verlag, 1993.
3. D. Gurov, S. Berezin, and B. Kapron. A modal of calculus and a proof system for value-passing processes. In Proc. Infinity Workshop on Verification of Infinite State Systems, Pisa, pages 149-163, 1996.
4. M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138: 353-389, 1995.
5. M. Hennessy and H. Lin. Proof systems for message-passing process algebras. Formal Aspects of Computer Science, pages 379-407, 1996.
6. M. Hennessy and H. Liu. A modal logic for message passing processes. Acta Informatica, 32:375-393, 1995.
7. K.G.Larsen. Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoretical Computer Science, 72:265-288, 1990.
8. R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
9. R. Milner, J. Parrow, andD. Walker. A calculus of mobile processes, Part I + II. Information and Computation, 100(l):1-77,1992.
10. J. Rathke. Symbolic techniques for value-passing calculi. PhD thesis, University of Sussex, 1997. To appear.
11. J. Rathke and M. Hennessy. Local model checking for a value-based modal μ-calculus. Technical Report 05/96, University of Sussex, 1996.
12. C. Stirling. Modal and temporal logics. In S. Abramsky, D. Gabbay, and T.Maibaum, editors, Handbook of Logic in Computer Science, Vol I. Oxford University Press, 1990.
13. C. Stirling and D. Walker. Local model checking in the modal μ-calculus. Theoretical Computer Science, 89:161-177, 1991.
14. G. Winskel. A note on model checking the modal ^-calculus. Theoretical Computer Science, 83:157-167,1991.