Submodule construction from concurrent system specifications ?
The submodule construction problem (SCP) as stated and formulated by Merlin and Bochmann [P. Merlin, G.V. Bochmann, On the construction of submodule specification and communication protocols, ACM Trans. Prog. Lang. Sys., 5(1) (1983) 125] is considered: given the specification of a system (module) and that of its n?1 submodules, determine the specification of the nth submodule that together with the given n?1 submodules will satisfy the given system specification. We recast SCP in a formal setting and proceed to present and prove the correctness of an algorithm for the solution of SCP where submodules are prefix-closed finite state machines.
concurrent systems submodule construction problem stepwise refinement