Skip to main content
SpringerLink
Log in

Distribution of Sequential Processes

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

VII Bibliography

  1. 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).

    Google Scholar 

  2. 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).

    Google Scholar 

  3. 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).

    Google Scholar 

  4. COFFMAN E.G. and P.J. DENNING, Operating Systems Theory, Prentice Hall (1973).

    Google Scholar 

  5. 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).

    Google Scholar 

  6. HARRISON M., Introduction to Formal Language Theory, Addison Wesley.

    Google Scholar 

  7. HOPCROFT J.E. and J.D. ULLMAN, Formal languages and their relation to automata, Addison Wesley (1969).

    Google Scholar 

  8. PRINOTH R., Construction of distributed systems from cycle-free finite automata, Lecture Notes in Computer Science 66, p. 199–220 (1985).

    Google Scholar 

  9. STARKE P.H., Multiprocessor systems and their concurrency, Journal of Information Processing and Cybernetics (EIK), Vol.20 (1984).

    Google Scholar 

  10. ZIELONKA W., Notes on finite asynchronous automata, R.A.I.R.O. Informatique théorique et applications, Vol. 21-2, p. 99–135 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.R.I., Université de Paris-Sud, 91405, Orsay Cedex, France

    J. Beauquier

  2. L.I.F.O., Université d'Orléans, 45067, Orléans Cedex 2, France

    A. Petit

  3. L.R.I., Université de Paris-Sud, 91405, Orsay Cedex, France

    A. Petit

Authors
  1. J. Beauquier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation