Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
VII Bibliography
ARNOLD A, and M. NIVAT, Controlling behaviour of systems, some basic concepts and some applications, Lecture Notes in Computer Science 88, p. 113–122, (1980).
BEAUQUIER J. and M. NIVAT, Application of formal language theory to problems of security and synchronization, in Formal language theory (R. Book ed.), Academic Press, p. 407–454 (1980).
BEAUQUIER J. and A.PETIT, Distribution of sequential processes, rapports internes no87-5 L.I.F.O. Université d'Orléans and no379 L.R.I. Université d'Orsay (France).
COFFMAN E.G. and P.J. DENNING, Operating Systems Theory, Prentice Hall (1973).
CORI R. and D. PERRIN, Sur la reconnaissabilite dans les monoides partiellement commutatifs, R.A.I.R.O. Informatique. Theorique, Vol. 19-1, p. 21–32 (1983).
HARRISON M., Introduction to Formal Language Theory, Addison Wesley.
HOPCROFT J.E. and J.D. ULLMAN, Formal languages and their relation to automata, Addison Wesley (1969).
PRINOTH R., Construction of distributed systems from cycle-free finite automata, Lecture Notes in Computer Science 66, p. 199–220 (1985).
STARKE P.H., Multiprocessor systems and their concurrency, Journal of Information Processing and Cybernetics (EIK), Vol.20 (1984).
ZIELONKA W., Notes on finite asynchronous automata, R.A.I.R.O. Informatique théorique et applications, Vol. 21-2, p. 99–135 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, J., Petit, A. (1988). Distribution of Sequential Processes. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017141
Download citation
DOI: https://doi.org/10.1007/BFb0017141
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive