Compositional verification of CCS processes

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

Volumn 1755, Issue , 2000, Pages 247-256

  Dam, Mads ^a   Gurov, Dilian ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; TEMPORAL LOGIC;

COMPOSITIONAL REASONING; COMPOSITIONAL VERIFICATION; FIXED POINTS; MODAL MU CALCULUS; OPERATIONAL SEMANTICS; PROCESS LANGUAGES; PROOF SYSTEM; SIMPSON;

CALCULATIONS;

EID: 84943275699     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46562-6_22     Document Type: Conference Paper

References (12)

1. R. Amadio and M. Dam. Reasoning about higher-order processes. In Proc. CAAP'95, Lecture Notes in Computer Science, 915:202-217, 1995.
2. R. Amadio and M. Dam. A modal theory of types for the π-calculus. In Proc. FTRTFT'96, Lecture Notes in Computer Science, 1135:347-365, 1996.
3. M. Dam. Proving properties of dynamic process networks. Information and Com-putation, 140:95-114, 1998.
4. M. Dam, L.-å. Fredlund, and D. Gurov. Toward parametric verification of open dis-tributed systems. In Compositionality: the Significant Difference, H. Langmaack, A. Pnueli and W.-P. de Roever (eds.), Lecture Notes Notes in Computer Science, Springer-Verlag, 1536:150-185, 1998.
5. M. Dam and D. Gurov. π-calculus with explicit points and approximations. In preparation, 1999.
6. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137-162, 1985.
7. D. Kozen. Results on the propositional π-calculus. Theoretical Computer Science, 27:333-354, 1983.
8. R. Milner. Communication and Concurrency. Prentice Hall International, 1989.
9. A. Simpson. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS. In Proceedings, Tenth Annual IEEE Symposium on Logic in Com-puter Science, pages 420-430, San Diego, California, 26-29 1995. IEEE Computer Society Press.
10. C. Stirling. Modal logics for communicating systems. Theoretical Computer Sci-ence, 49:311-347, 1987.
11. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. The-oretical Computer Science, 89:161-177, 1991.
12. P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72-99, 1983.