Modal logics for communicating systems

Theoretical Computer Science

Volumn 49, Issue 2-3, 1987, Pages 311-347

  Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - PROGRAMMING THEORY;

COMMUNICATING SYSTEMS; COMPOSITIONAL; CONCURRENT PROGRAMS; MODAL LOGICS; PROOF RULES;

COMPUTER PROGRAMMING;

EID: 0022322350     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(87)90012-0     Document Type: Article

References (39)

1. Experiments, powerdomains and fully abstract models for applicative multiprogramming
2. Now you may compose temporal logic specifications
3. Behavioural equivalence relations induced by programming logics
4. A fair calculus of communicating systems
5. Testing equivalences for processes
6. Sometimes and not never revisited: on branching versus linear time
7. Investigations into logic deduction
8. A modal characterization of observational congruence on finite terms of CCS
9. A logic for the description of nondeterministic programs and their properties
10. First-Order Dynamic Logic
11. Axiomatizing finite delay operators
12. Algebraic laws for nondeterminism and concurrency
13. The power of the future perfect in program logics
14. A theory of communicating sequential processes
15. A fundamental theory of asynchronous parallel computation
16. A context dependent equivalence between processes
17. Impartiality, justice and fairness: the ethics of concurrent terminations
18. Verification of concurrent programs: the temporal framework
19. How to cook a temporal proof system for your pet language
20. A Calculus of Communicating Systems
21. A modal characterisation of observable machine-behaviour
22. Calculi for synchrony and asynchrony
23. Gedanken-experiments on sequential machines
24. Specification oriented semantics for communicating processes
25. Concurrency and automata on infinite sequences
26. Linear and branching structures in the semantics and logics of reactive systems
27. Fairness and related properties in transition systems
28. The quest for compositionality
29. A unified approach for studying the properties of transition systems
30. Property preserving homomorphisms of transition systems
31. A complete modal proof system for a subset of SCCS
32. A complete compositional modal proof system for a subset of CCS
33. A compositional reformulation of Owicki-Gries partial correctness logic for a parallel while language
34. On the composition and decomposition of assertions
35. A complete proof system for SCCS with modal assertions
36. Compositionality and concurrent networks: soundness and completeness of a proof system