Skip to main content
SpringerLink
Log in

Realization of Probabilistic Automata: Categorical Approach

  • Conference paper
Recent Trends in Algebraic Development Techniques (WADT 1999)

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

Included in the following conference series:

Abstract

We present a categorical framework to study probabilistic automata starting by obtaining aggregation and interconnection as universal constructions. We also introduce the notion of probabilistic behavior in order to get adjunctions between probabilistic behavior and probabilistic automata. Thus we are able to extend to the probabilistic setting free and minimal realization as universal constructions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adámek, J., Trnková, V.: Automata and Algebras in Categories. Kluwer Academic Publishers, Dordrecht (1989)

    Google Scholar 

  2. Barr, M., Wells, C.: Category Theory for Computing Science. Prentice-Hall International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1990)

    MATH  Google Scholar 

  3. Bénabou, J.: Fibred categories and the foundations of naive category theory. Journal of Symbolic Logic 50, 10–37 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blute, R., Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labeled Markov processes. In: Proceedings, Twelth Annual IEEE Symposium on Logic in-Computer Science, Warsaw, Poland, pp. 149–158. IEEE Computer Society Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  5. Coppey, L.: Quelques problèmes typiques concernant les graphes. Diagrammes 3, C1–C46 (1980)

    Google Scholar 

  6. Ehresmann, C.: Catégories et structures. Dunod (1965)

    Google Scholar 

  7. Goguen, J.: Realization is universal. Mathematical Systems Theory 6, 359–374 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  8. Halmos, P.: Measure Theory. Van Nostrand, New York (1969) (July 1969 reprinting)

    Google Scholar 

  9. Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94(1), 1–28 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mateus, P., Sernadas, A., Sernadas, C.: Precategories for combining probabilistic automata. Electronic Notes in Theoretical Computer Science (1999); Early version presented at FIREworks Meeting, Magdeburg, May 15-16 (1998); Presented at CTCS 1999, Edinburgh, September 10-12 (1999) (in print)

    Google Scholar 

  11. Paz, A.: Some aspects of probabalistic automata. Information and Control 9(1), 26–60 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  12. Rabin, M.: Probabilistic automata. Information and Control 6(3), 230–245 (1963)

    Article  Google Scholar 

  13. Schröder, L., Mateus, P.: Universal aspects of probabilistic automata. Research report, Section of Computer Science, Department of Mathematics, Instituto Superior Técnico, 1049-001 Lisboa, Portugal (1999) (submitted for publication)

    Google Scholar 

  14. van Glabbeek, R., Smolka, S., Steffen, B., Tofts, C.: Reactive, generativem and stratified models for probabilistic processes. Information and Computation 121(1), 59–80 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  15. Winskel, G., Nielsen, M.: Models of concurrency. In: Gabbay, D., Abramsky, S., Maibaum, T. (eds.) Handbook of Logic in Computer Science 4, pp. 1–148. Oxford Science Publications, Oxford (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CMA – Departamento de Matemática, Instituto Superior Técnico, Av. Rovisco Pais, 1049-001, Lisboa, Portugal

    Paulo Mateus, Amílcar Sernadas & Cristina Sernadas

Authors
  1. Paulo Mateus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amílcar Sernadas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cristina Sernadas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire Logiciels, Systèmes, Réseaux - IMAG, B.P. 72, F-38402, Saint Martin d’Hères Cedex, France

    Didier Bert

  2. LIPN, Institut Galilée, Université Paris XIII, France

    Christine Choppy

  3. Department of Computer Science, Swansea University, UK

    Peter D. Mosses

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mateus, P., Sernadas, A., Sernadas, C. (2000). Realization of Probabilistic Automata: Categorical Approach. In: Bert, D., Choppy, C., Mosses, P.D. (eds) Recent Trends in Algebraic Development Techniques. WADT 1999. Lecture Notes in Computer Science, vol 1827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44616-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44616-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67898-4

  • Online ISBN: 978-3-540-44616-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation