Compositionality of Hennessy-Milner logic through structural operational semantics

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

Volumn 2751, Issue , 2003, Pages 412-422

  Fokkink, Wan ^a,b   Van Glabbeek, Rob ^a   De Wind, Paulien ^b  

^a CWI   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

COMPOSITIONALITY; DECOMPOSITION METHODS; HENNESSY-MILNER LOGICS; LARS-EN; PROCESS ALGEBRAS; STRUCTURAL OPERATIONAL SEMANTICS; SUBTERMS;

COMPUTATION THEORY;

EID: 21144433766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_38     Document Type: Article

References (27)

1. H. R. ANDERSEN, C. STIRLING & G. WINSKEL (1994): A compositional proof system for the modal μ-calculus. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Paris, France, pp. 144-153.
2. H. R. ANDERSEN & G. WINSKEL (1992): Compositional checking of satisfaction. Formal Methods in System Design 1(4), pp. 323-354.
3. H. BARRINGER, R. KUIPER & A. PNUELI (1984): Now you may compose temporal logic specifications. In ACM Symposium on Theory of Computing (STOC '84), ACM Press, Baltimore, USA, pp. 51-63.
4. B. BLOOM, W. J. FOKKINK & R. J. VAN GLABBEEK (2003): Precongruence formats for decorated trace semantics. ACM Transactions on Computational Logic. To appear.
5. R. BOL & J. F. GROOTE (1996): The meaning of negative premises in transition system specifications. Journal of the ACM 43(5), pp. 863-914.
6. S. D. BROOKES, C. A. R. HOARE Sc A. W. ROSCOE (1984): A theory of communicating sequential processes. Journal of the ACM 31(3), pp. 560-599.
7. R. J. VAN GLABBEEK (1996): The meaning of negative premises in transition system specifications II. In F. Meyer auf der Heide & B. Monien, editors: Automata, Languages and Programming, 23rd Colloquium (ICALP '96), Lecture Notes in Computer Science 1099, Springer-Verlag, Paderborn, Germany, pp. 502-513.
8. R. J. VAN GLABBEEK (2001): The linear time - branching time spectrum I: The semantics of concrete, sequential processes. In J. A. Bergstra, A. Ponse & S. A. Smolka, editors: Handbook of Process Algebra, chapter 1, Eisevier, pp. 3-99.
9. J. F. GROOTE (1993): Transition system specifications with negative premises. Theoretical Computer Science 118(2), pp. 263-299.
10. D. HAREL, D. KOZEN & R. PARIKH (1982): Process logic: Expressiveness, decidability, completeness. Journal of Computer and System Sciences 25(2), pp. 144-170.
11. M. C. B. HENNESSY & R. MILNER (1985): Algebraic laws for non-determinism and concurrency. Journal of the ACM 32(1), pp. 137-161.
12. M. C. B. HENNESSY & C. STIRLING (1985): The power of the future perfect in program logics. Information and Control 67(1-3), pp. 23-52.
13. D. KOZEN (1983): Results on the prepositional μ-calculus. Theoretical Computer Science 27(3), pp. 333-354.
14. K. G. LARSEN (1986): Context-Dependent Bisimulation between Processes. PhD thesis, University of Edinburgh, Edinburgh.
15. K. G. LARSEN & L. XINXIN (1991): Compositionality through an operational semantics of contexts. Journal of Logic and Computation 1(6), pp. 761-795.
16. R. MILNER (1980): A Calculus of Communicating Systems. Springer-Verlag. Volume 92 of Lecture Notes in Computer Science.
17. R. MILNER (1981): A modal characterization of observable machine-behaviour. In E. Astesiano & C. Böhm, editors: CAAP '81: Trees in Algebra and Programming, 6th Colloquium, Lecture Notes in Computer Science 112, Springer-Verlag, Genoa, pp. 25-34.
18. R. MILNER (1983): Calculi for synchrony and asynchrony. Theoretical Computer Science 25(3), pp. 267-310.
19. G. D. PLOTKIN (1981): A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark.
20. A. PNUELI (1981): The temporal logic of concurrent programs. Theoretical Computer Science 13, pp. 45-60.
21. R. DE SIMONE (1985): Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science 37(3), pp. 245-267.
22. C. STIRLING (1985): A proof-theoretic characterization of observational equivalence. Theoretical Computer Science 39(1), pp. 27-45.
23. C. STIRLING (1985): A complete compositional modal proof system for a subset of CCS. In W. Brauer, editor: Automata, Languages and Programming, 12th Colloquium (ICALP '85), Lecture Notes in Computer Science 194, Springer-Verlag, pp. 475-486.
24. C. STIRLING (1985): A complete modal proof system for a subset of SCCS. In H. Ehrig, C. Floyd, M. Nivat & J. W. Thatcher, editors: Mathematical Foundations of Software Development: Proceedings of the Joint Conference on Theory and Practice of Software Development (TAPSOFT), Volume 1: Colloquium on Trees in Algebra and Programming (CAAP '85), Lecture Notes in Computer Science 185, Springer-Verlag, pp. 253-266.
25. C. STIRLING (1987): Modal topics for communicating systems. Theoretical Computer Science 49(2-3), pp. 311-347.
26. G. WINSKEL (1986): A complete proof system for SCCS with modal assertions. Fundamenta Informaticae IX, pp. 401-420.
27. G. WINSKEL (1990): On the compositional checking of validity (extended abstract). In J. C. M. Baeten & J. W. Klop, editors: CONCUR '90: Theories of Concurrency: Unification and Extension, Lecture Notes in Computer Science 458, Springer-Verlag, Amsterdam, The Netherlands, pp. 481-501.