Distribution of Sequential Processes

We present a solution to the distribution problem, in a particular framework: how to transform a set of sequential processes into a set of respectively equivalent concurrent processes? The models of systems are finite automata in the non-distributed case and some collection of finite automata with synchronization in the distributed case. The concurrency criterion is commutativity.

[1]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[2]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[3]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[4]  Maurice Nivat,et al.  APPLICATION OF FORMAL LANGUAGE THEORY TO PROBLEMS OF SECURITY AND SYNCHRONIZATION , 1980 .

[5]  Maurice Nivat,et al.  Controlling Behaviours of Systems: Some Basic Concepts and some Applications , 1980, MFCS.

[6]  Peter H. Starke,et al.  Multiprocessor Systems and Their Concurrency , 1984, J. Inf. Process. Cybern..

[7]  Rainer Prinoth.  Construction of Distributed Systems from Cycle-Free Finite Automata , 1982, European Workshop on Applications and Theory of Petri Nets.

[8]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.