Mathematical systems theory

, Volume 29, Issue 1, pp 5–31 | Cite as

Probabilistic asynchronous automata

  • S. Jesi
  • G. Pighizzini
  • N. Sabadini
Article
Received:
Accepted:
  • 45 Downloads

Abstract

Asynchronous automata were introduced by W. Zielonka as an algebraic model of distributed systems, showing that the class of trace languages recognizable by automata over free partially commutative monoids coincides with the class of trace languages recognizable by deterministic asynchronous automata. In this paper we extend the notion of asynchronous automata to the probabilistic case. Our main result is a nontrivial generalization to Zielonka's theorem: we prove that the sets of behaviors of probabilistic automata and of probabilistic asynchronous automata coincide in the case of concurrent alphabets with acyclic dependency graphs.

Keywords

Global State Dependency Graph Probabilistic Case Deterministic Case Stochastic Matrix 
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 to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [A]
    A. Arnold. An extension of the notions of traces and of asynchronous automata.RAIRO Inform. Théor., 25:355–393, 1991.MATHGoogle Scholar
  2. [AB]
    M. Anselmo and A. Bertoni. Two-way probabilistic automata and rational power series.Theoretical Computer Science-Proceedings of the Fourth Italian Conference, pp. 9–23. World Scientific, Singapore, 1992.Google Scholar
  3. [AR]
    IJ. J. Aalbersberg and G. Rozenberg. Theory of traces.Theoret. Comput. Sci., 60:1–82, 1988.MATHCrossRefMathSciNetGoogle Scholar
  4. [BMS1]
    A. Bertoni, G. Mauri, and N. Sabadini. Concurrency and commutativity. Technical Report, University of Milan, 1982. Presented at the 3rd European Workshop on Applications and Theory of Petri Nets, Varenna, 1982.Google Scholar
  5. [BMS2]
    A. Bertoni, G. Mauri, and N. Sabadini. Membership problem for regular and context-free trace languages.Inform. and Comput., 82:135–150, 1989.MATHCrossRefMathSciNetGoogle Scholar
  6. [BPS]
    D. Bruschi, G. Pighizzini, and N. Sabadini. On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages.Inform. and Comput., 108:262–285, 1994.MATHCrossRefMathSciNetGoogle Scholar
  7. [CF]
    P. Cartier and M. Foata.Problèmes combinatorics de commutation et rearrangements. Lecture Notes in Mathematics, Vol. 85. Springer-Verlag, Berlin, 1969.Google Scholar
  8. [CM]
    R. Cori and Y. Mètivier. Approximation of a trace, asynchronous automata, and the ordering of events in a distributed system.Proc. 15th ICALP, pp. 147–161. Lecture Notes in Computer Science, Vol. 317. Springer-Verlag, Berlin, 1988.Google Scholar
  9. [D]
    V. Diekert.Combinatorics on Traces. Lecture Notes in Computer Science, Vol. 454. Springer-Verlag, Berlin, 1990.Google Scholar
  10. [DM]
    V. Diekert and A. Muscholl. Deterministic asynchronous automata for infinite traces.Proc. 10th STACS, pp. 617–628. Lecture Notes in Computer Science, Vol. 665. Springer-Verlag, Berlin, 1993.Google Scholar
  11. [GP]
    P. Gastin and A. Petit. Asynchronous automata for infinite traces.Proc. 19th ICALP, pp. 583–594. Lecture Notes in Computer Science, Vol. 623. Springer-Verlag, Berlin, 1992.Google Scholar
  12. [KF]
    J. Kaneps and R. Freivalds. Running time to recognize nonregular languages by two-way probabilistic automata.Proc. ICALP 91, pp. 174–185. Lecture Notes in Computer Science, Vol. 510. Springer-Verlag, Berlin, 1991.Google Scholar
  13. [Mal]
    A. Mazurkiewicz. Concurrent program schemes and their interpretations. Technical Report DAIMI Rep. PB-78, Aarhus University, 1977.Google Scholar
  14. [Ma2]
    A. Mazurkiewicz. Trace theory. InAdvances in Petri Nets 1986 (W. Brauer, W. Reisig, and G. Rosenberg, eds.), pp. 279–324. Lecture Notes in Computer Science, Vol. 255. Springer-Verlag, Berlin, 1986.Google Scholar
  15. [Me]
    Y. Mètivier. An algorithm for computing asynchronous automata in the case of acyclic noncommutation graphs.Proc. 14th ICALP, pp. 226–236. Lecture Notes in Computer Science, Vol. 267. Springer-Verlag, Berlin, 1987.Google Scholar
  16. [Pa]
    A. Paz.Introduction to Probabilistic Automata. Academic Press, New York, 1971.MATHGoogle Scholar
  17. [Pe]
    D. Perrin. Partial commutations.Proc. 16th ICALP, pp. 637–651. Lecture Notes in Computer Science, Vol. 372. Springer-Verlag, Berlin, 1989.Google Scholar
  18. [R]
    M. O. Rabin. Probabilistic automata.Inform. and Control, 6:230–245, 1963. Also in E. F. Moore.Sequential Machines. Addison-Wesley, Reading, MA, 1964.CrossRefGoogle Scholar
  19. [S]
    A. Salomaa. Onm-adic probabilistic automata.Inform. and Control, 10:215–219, 1967.MATHCrossRefMathSciNetGoogle Scholar
  20. [Zl]
    W. Zielonka. Notes on finite asynchronous automata.RAIRO Inform. Theor., 21:99–135, 1987.MathSciNetGoogle Scholar
  21. [Z2]
    W. Zielonka. Asynchronous automata.Proceedings of the Workshop: Free Partially Commutative Monoids, pp. 183–197. Institut für Informatic, Technische Universität, München, TUM-I9002, 1990.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1996

Authors and Affiliations

  • S. Jesi
    • 1
  • G. Pighizzini
    • 1
  • N. Sabadini
    • 1
  1. 1.Dipartimento di Scienze dell'InformazioneUniversità degli Studi di MilanoMilanoItaly

Personalised recommendations