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.
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.
References
A.Arnold — M.Nivat, "Comportements de processus", L.I.T.P. internal report no 82-12, 1982
E.A. Bender, "Asymptotic methods in enumeration", SIAM review vol.16 no4, p. 485–515, October 1974
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
N. Chomsky — M.P.Schützenberger, "The algebraic theory of context-free languages", Computer Programming and Formal Systems, pp 118–161, North Holland 1963
S.Eilenberg, "Automata Languages and machines", vol. A, Academic press 1976
J.Françon, "A quantitative approach of mutual exclusion", R.A.I.R.O. theoretical Informatics and Applications no 20, 1986, pp 275–289
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
I. Goulden — D. Jackson, "Combinatorial Enumerations", J. Wiley, New york 1983
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
C.Pair — R.Mohr — R.Schott, "Construire les algorithmes", Dunod informatique 1988
Author information
Authors and Affiliations
Editor information
Rights 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