The paper refers to the question how programs can be executed concurrently. To answer this question the following problem will be considered.
Given some programs according to which some instructions are to be performed in a given environment. Does exist a program any performance of which runs accordantly with all the given programs simultaneously? How many programs with this property do exist? How to find them?
To make this problem precise some ideas similar to those of BURSTALL
KeywordsNatural Transformation Concurrent Program Canonical Morphism Environment State Change Categorical Language
Unable to display preview. Download preview PDF.
- BURSTALL, R.M. An Algebraic Description of Programs with Assertions, Verification and Simulation. Proc. of an ACM Conf. on Proving Ass. about Prog., Las Cruces, N. Mexico, 1972Google Scholar
- GOGUEN, J.A. On Homomorphisms, Simulations, Correctness, and Subroutines of Programs and Program Schemes. Proc. of 1972 IEEE Symp. on Switching and Automata Theory, 1972Google Scholar
- GOGUEN, J.A. On Homomorphisms, Correctness, Termination, Unfoldments, and Equivalence of Flow Diagram Programs. Technical Report, Computer Science Dep., School of Engin. and Appl. Sc., University of California, Los Angeles, 1973Google Scholar