Toward a modal theory of types for the π-calculus

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

Volumn 1135, Issue , 1996, Pages 347-365

  Amadio, Roberto M ^a   Dam, Mads ^b  

^a CNRS   (France)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; REAL TIME SYSTEMS; SEMANTICS; SPECIFICATION LANGUAGES; SPECIFICATIONS; TEMPORAL LOGIC;

BISIMULATION RELATIONS; BISIMULATIONS; LOGICAL LANGUAGE; MODAL MU CALCULUS; PI CALCULUS; PROOF SYSTEM; PROPERTY SPECIFICATION LANGUAGE; RECURSIVE PROPERTY;

CALCULATIONS;

EID: 84876879170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61648-9_50     Document Type: Conference Paper

References (14)

1. R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP 95, Aarhus. SLNCS 915, 1995. Preliminary version appeared as SICS RR 94-18, available at http://wwwi3s.unice.fr/~amadio/.
2. R. Amadio and M. Dam. Toward a modal theory of types for the π-calculus. Technical Report 95-18, Swedish Institute for Computer Science, Stockholm, 1995. Available at ftp://sics.se/pub/fdt/mfd/tmttpc.ps.Z.
3. M. Dam. Model checking mobile processes. In Proc. CONCUR'93, Lecture Notes in Computer Science, 715:22-36, 1993. Full version in SICS report RR94:1, 1994.
4. M. Dam. Compositional proof systems for model checking infinite state processes. In Proc. CONCUR'95, Lecture Notes in Computer Science, 962:12-26, 1995.
5. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137-162, 1985.
6. D. Kozen. Results on the propositional π-calculus. Theoretical Computer Science, 27:333-354, 1983.
7. U. Montanari and M. Pistore. Checking bisimilarity for finitary π-calculus. In CONCUR '95, SLNCS 962, 1995.
8. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Process, Parts 1-2. Information and Computation, 100(1):1-77, 1992.
9. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science, 114:149-171, 1993.
10. F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, pages 497-543, 1992.
11. C. Stifling. Modal logics for communicating systems. Theoretical Computer Science, 49:311-347, 1987.
12. C. Stifling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89:161-177, 1991.
13. D. Van Daalen. The language theory of Automath. PhD thesis, Technological University of Eindhoven, 1980. PhD thesis.
14. G. Winskel. Model checking the modal ν-calculus. Springer Lecture Notes in Computer Science, 372, 1989.