Skip to main content
SpringerLink
Log in

Using generating functions to compute concurrency

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

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

Included in the following conference series:

Abstract

The aim of this work is the improvement of the computation of the concurrency measure defined by Beauquier, Bérard and Thimonier in [BT87]. First, we present the Arnold-Nivat's model for the synchronization of sequential processes, and we recall the formal definition of the concurrency measure. Then, we present a new technique for the computation of this measure often avoiding a very expensive part of the computation. The mutual exclusion example illustrates this method.

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.

References

  1. A.Arnold — M.Nivat, "Comportements de processus", L.I.T.P. internal report no 82-12, 1982

    Google Scholar 

  2. E.A. Bender, "Asymptotic methods in enumeration", SIAM review vol.16 no4, p. 485–515, October 1974

    Article  Google Scholar 

  3. B. Berard — L. Thimonier, "On a concurrency measure", 2nd I.S.C.I.S. proceeding, Istanbul 1987, pp 211–225 & Nova Science Publishers, New York 1988

    Google Scholar 

  4. N. Chomsky — M.P.Schützenberger, "The algebraic theory of context-free languages", Computer Programming and Formal Systems, pp 118–161, North Holland 1963

    Google Scholar 

  5. S.Eilenberg, "Automata Languages and machines", vol. A, Academic press 1976

    Google Scholar 

  6. J.Françon, "A quantitative approach of mutual exclusion", R.A.I.R.O. theoretical Informatics and Applications no 20, 1986, pp 275–289

    Google Scholar 

  7. D.Geniet, "Automaf: un systemes de construction d'automates synchronises et de calcul de mesure du parallelisme", Thesis, Univ. Paris XI, to appear in 1989

    Google Scholar 

  8. I. Goulden — D. Jackson, "Combinatorial Enumerations", J. Wiley, New york 1983

    Google Scholar 

  9. R.Mac Naughton — Yamada, "Regular expressions and state graphs for automata", I.E.E.E. transactions on electronic computers, EC-9, pp 39–47, 1960

    Google Scholar 

  10. C.Pair — R.Mohr — R.Schott, "Construire les algorithmes", Dunod informatique 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.R.I. Orsay, Bât. 490, Université Paris XI, 91405, Orsay Cedex, France

    Dominique Geniet & Loÿs Thimonier

  2. Université de Picardie, 33 rue Saint Leu, 80039, Amiens Cedex, France

    Dominique Geniet & Loÿs Thimonier

Authors
  1. Dominique Geniet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Loÿs Thimonier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geniet, D., Thimonier, L. (1989). Using generating functions to compute concurrency. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation