Skip to main content
SpringerLink
Log in

Speedup of recognizable trace languages

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1993 (MFCS 1993)

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

Abstract

Traces have been defined by A.Mazurkiewicz in order to modelize concurrent processes. The decomposition of a trace in Foata normal form gives the “best” parallel execution of a trace. We define naturally the speedup of a trace as the quotient of its sequential execution time by its parallel execution time. We generalize this definition to trace languages and we prove that this speedup can be computed in a modular way for any recognizable trace language.

This work was partially supported by “Conseil Régional de Picardie, Pôle Modélisation”

This work was partially supported by ESPRIT WG 6317 (ASMICS2) and WG 6067 (CALIBAN)

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. I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1–82, 1988.

    Google Scholar 

  2. J. Berstel. Transductions and Context Free Languages. Taubner, Stuttgart, 1979.

    Google Scholar 

  3. C. Cérin. Application de la théorie des traces à l'implantation et à la mesure d'algorithmes de distribution. Thèse, Université de Paris-Sud, 1992.

    Google Scholar 

  4. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements, volume 85 of Lecture Notes in Mathematics. Springer, Berlin-Heidelberg-New York, 1969.

    Google Scholar 

  5. R. Cori and D. Perrin. Automates et commutations partielles. R.A.I.R.O.-Informatique Théorique et Applications, 19:21–32, 1985.

    Google Scholar 

  6. V. Diekert. Combinatorics on Traces, volume 454 of Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990.

    Google Scholar 

  7. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.

    Google Scholar 

  8. A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, volume 255 of Lecture Notes in Computer Science, pages 279–324. Springer, Berlin-Heidelberg-New York, 1987.

    Google Scholar 

  9. E. Ochmanski. On morphisms onf trace monoids. In STACS'88, volume 294 of Lecture Notes in Computer Science, pages 346–355. Springer, Berlin-Heidelberg-New York, 1988.

    Google Scholar 

  10. D. Perrin. Partial commutations. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89), Stresa (Italy) 1989, volume 372 of Lecture Notes in Computer Science, pages 637–651. Springer, Berlin-Heidelberg-New York, 1989.

    Google Scholar 

  11. N. Saheb. Concurrency measure in commutation monoids. Discrete Applied Mathematics, 24:223–236, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UFR de mathématiques et d'informatique, Université de Picardie Jules Verne, LAMIFA, 33 rue St Leu, F-80039, Amiens Cedex

    Christophe Cérin

  2. URA CNRS 410, Université Paris Sud, LRI, Bât. 490, F-91405, Orsay Cedex

    Christophe Cérin & Antoine Petit

Authors
  1. Christophe Cérin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antoine Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cérin, C., Petit, A. (1993). Speedup of recognizable trace languages. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation