Submodule construction as equation solving in CCS

DOI10.1016/0304-3975(89)90128-XzbMath0686.68017MaRDI QIDQ1262748

Joachim Parrow

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

alternating-bit protocolsCCS equationssemi-automatic programtop-down design methodology

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (10)

Factorization for Component-Interaction Automata ⋮ An improvement of algorithms for solving interface equations ⋮ Using logic to solve the submodule construction problem ⋮ Factorisation of finite state machines under strong and observational equivalences ⋮ Automatic synthesis of real time systems ⋮ Progressive Solutions to a Parallel Automata Equation ⋮ The expressive power of implicit specifications ⋮ Automatic verification of distributed systems: the process algebra approach. ⋮ Interface synthesis and protocol conversion ⋮ Progressive solutions to a parallel automata equation

Cites Work

• Unnamed Item
• Using branching time temporal logic to synthesize synchronization skeletons
• A complete inference system for a class of regular behaviours
• A calculus of communicating systems
• Synthesis of Communicating Finite-State Machines with Guaranteed Progress
• Synthesis of Communicating Processes from Temporal Logic Specifications
• A Theory of Communicating Sequential Processes
• A Deductive Approach to Program Synthesis
• On the Construction of Submodule Specifications and Communication Protocols

This page was built for publication: Submodule construction as equation solving in CCS