Skip to main content
SpringerLink
Log in

Recognizable trace languages, distributed automata and the distribution problem

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

We introduce new finite state “parallel machines,” the (ℕ-)distributed automata, for trace languages. We prove that these machines give a new characterization of recognizable trace languages: a trace language is recognizable if and only if it is recognized by a (ℕ-)distributed automaton. At last, we show how the classical problem of distribution of uninterpreted tasks on several processors can be straightforward modelized by recognizable trace languages and solved using (ℕ-)distributed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aalbersberg, I.J., Rozenberg, G.: Theory of traces. Theor. Comput. Sci.60, 1–82 (1988)

    Google Scholar 

  2. Beauquier, J., Petit, A.: Distribution of sequential processes. MFCS'88, (Lect. Notes Comput. Sci., vol. 324, pp. 180–189). Berlin Heidelberg New York: Springer 1988

    Google Scholar 

  3. Berstel, J.: Transductions and context free languages. (Teubner Studienbücher Informatik). Stuttgart: B.G. Teubner 1979

    Google Scholar 

  4. Bruchi, D., Pighizzini, G., Sabadini, N.: On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages, STACS'88 (Lect. Notes Comput. Sci., Vol. 294, pp. 334–345). Berlin Heidelberg New York: Springer 1988

    Google Scholar 

  5. Cartier, P., Foata, D.: Problèmes combinatoires de commutation et réarrangements (Lect. Notes Math., vol. 85). Berlin Heidelberg New York: Springer 1969

    Google Scholar 

  6. Coffman, E.G., Denning, P.J.: Operating Systems Theory. Englewood Cliffs, MA: Prentice-Hall 1973

    Google Scholar 

  7. Cori, R., Latteux, M., Roos, Y., Sopena, E.: 2-asynchronous automata. Theor. Comput. Sci.61, 93–102 (1988)

    Google Scholar 

  8. Cori, R., Métivier, Y.: Recognizable subsets of some partially abelian monoids. Theor. Comput. Sci.35, 179–189 (1985)

    Google Scholar 

  9. Cori, R., Perrin, D.: Automates et commutations partielles. RAIRO Theor. Inf. Appl.19, 21–32 (1985)

    Google Scholar 

  10. Cori, R., Metivier, Y., Zielonka, W.: Asynchronous mappings and asynchonous cellular automata. Tech. Rep. 89-97, LaBri, Université de Bordeaux, France, 1989 (To appear in Inf. Comput.)

    Google Scholar 

  11. Diekert, V.: Combinatorics on traces (Lect. Notes Comput. Sci., vol. 454). Berlin Heidelberg New York: Springer 1990

    Google Scholar 

  12. Diekert, V., Gastin, P., Petit, A.: Recognizable complex trace languages. MFCS'91 (Lect. Notes Comput. Sci., vol. 520, pp. 131–140). Berlin Heidelberg New York: Springer 1991

    Google Scholar 

  13. Ebinger, W.: On logical definability of infinite trace languages. Proceedings of the ASMICS Workshop on Infinite Traces. Tech. Rep. 4/92, Universität Stuttgart, Allemagne, 1992

    Google Scholar 

  14. Gastin, P.: Recognizable and rational languages of finite and infinite traces. STACS'91 (Lect. Notes Comput. Sci., vol. 480, pp. 89–104) Berlin Heidelberg New York: Springer 1991

    Google Scholar 

  15. Gastin, P., Petit, A.: Asynchronous cellular automata for infinite traces. ICALP'92. (Lect. Notes Comput. Sci., vol. 623, pp. 583–594). Berlin Heidelberg New York: Springer 1992

    Google Scholar 

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

  17. Mazurkiewicz, A.: Trace theory. Advanced course on Petri nets (Lect. Notes Comput. Sci., vol. 255, pp. 279–324). Berlin Heidelberg New York: Springer 1986

    Google Scholar 

  18. Métivier, Y.: On recognizable subsets in free partially commutative monoids. ICALP'86 (Lect. Notes Comput. Sci., vol. 226, pp. 254–264). Berlin Heidelberg New York: Springer 1986

    Google Scholar 

  19. Métivier, Y.: An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs. ICALP'87 (Lect. Notes Comput. Sci., vol. 267, pp. 226–236). Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  20. Ochmanski, E.: Regular behaviour of concurrent systems. Bull. EATCS27, 56–67 (1985)

    Google Scholar 

  21. Perrin, D.: Partial commutations. ICALP'89 (Lect. Notes Comput. Sci., vol. 372, pp. 637–651). Berlin Heidelberg New York: Springer 1989

    Google Scholar 

  22. Petit, A.: Distribution and synchronized automata. Theor. Comput. Sci.76, 285–308 (1990)

    Google Scholar 

  23. Pighizzini, G.: On the iteration of trace languages. Proceedings of the ASMICS Workshop on Infinite Traces. Tech. Rep. 4/92, Universität Stuttgart, Allemagne, 1992

    Google Scholar 

  24. Prinoth, R.: Construction of distributed systems from cycle-free finite automata (Lect. Notes Comput. Sci., vol. 60, pp. 199–220). Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  25. Rozoy, B.: Le théorème de Zielonka... encore. Tech. Rep. no 87-52, LITP, Université de Paris 7, 1987

  26. Sakarovitch, J.: On regular trace languages. Theor. Comput. Sci.52, 59–75 (1987)

    Google Scholar 

  27. Starke, P.H.: Multiprocessors systems and their concurrency. J. Inf. Process. Cybern. (EIK)20, 207–227 (1984)

    Google Scholar 

  28. Zielonka, W.: Notes on finite asynchronous automata and trace languages. RAIRO Theor. Inf. Appl.21, 99–135 (1987)

    Google Scholar 

  29. Zielonka, W.: Safe execution of recognizable trace languages by asynchronous automata (Lect. Notes Comput. Sci., vol. 363, pp. 278–289). Berlin Heidelberg New York: Springer 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRI, URA 410 CNRS, Bât. 490, F-91450, Orsay Cedex, France

    Antoine Petit

Authors
  1. Antoine Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been partly supported by the ESPRIT Basic Research Actions No 3148 (DEMON) and by the PRC C3 and Math-Info

Rights and permissions

Reprints and permissions

About this article

Cite this article

Petit, A. Recognizable trace languages, distributed automata and the distribution problem. Acta Informatica 30, 89–101 (1993). https://doi.org/10.1007/BF01200264

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01200264

Keywords

Search

Navigation