Submodule construction as equation solving in CCS

Theoretical Computer Science

Volumn 68, Issue 2, 1989, Pages 175-202

  Parrow, Joachim ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

EQUATION SOLVING; PARALLEL PROCESSING; SUBMODULE CONSTRUCTION;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024751090     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(89)90128-X     Document Type: Article

References (16)

1. The synthesis of communication protocols
2. A note on reliable full-duplex transmissions over half duplex links
3. Deriving protocol specifications from service specifications
4. A theory of communicating sequential processes
5. Using branching time temporal logic to synthesize synchronization skeletons
6. Synthesis of communicating finite-state machines with guaranteed progress
7. Towards deductive synthesis of dataflow networks
8. A deductive approach to program synthesis
9. Synthesis of communicating processes from temporal logic specifications
10. On the construction of submodule specifications and communication protocols
11. A Calculus of Communicating Systems
12. A complete inference system for a class of regular behaviours
13. Proof Techniques for CCS
14. Extending the Interface Equation
15. Solving the Interface Equation
16. Towards analyzing and synthesizing protocols