Skip to main content

A Non-probabilistic Relational Model of Probabilistic Kleene Algebras

  • Conference paper
Relations and Kleene Algebra in Computer Science (RelMiCS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4988))

Included in the following conference series:

Abstract

This paper studies basic properties of up-closed multirelations, and then shows that the set of finitary total up-closed multirelations over a set forms a probabilistic Kleene algebra. In Kleene algebras, the star operator is very essential. We investigate the reflexive transitive closure of a finitary up-closed multirelation and show that the closure operator plays a rôle of the star operator of a probabilistic Kleene algebra consisting of the set of finitary total up-closed multirelations as in the case of a Kozen’s Kleene algebra consisting of the set of (usual) binary relations.

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

Access this chapter

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. Cohen, E.: Separation and Reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM Trans. Comput. Log. 7(4), 798–833 (2006)

    MathSciNet  Google Scholar 

  3. Goranko, V.: The Basic Algebra of Game Equivalences. Studia Logica 75(2), 221–238 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Martin, C., Curtis, S., Rewitzky, I.: Modelling Nondeterminism. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 228–251. Springer, Heidelberg (2004)

    Google Scholar 

  5. Kozen, D.: A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Information and Computation 110, 366–390 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kozen, D.: Kleene Algebra with Tests. ACM Trans. Program. Lang. Syst. 19(3), 427–443 (1997)

    Article  Google Scholar 

  7. McIver, A., Weber, T.: Towards Automated Proof Support for Probabilistic Distributed Systems. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 534–548. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. McIver, A., Cohen, E., Morgan, C.: Using Probabilistic Kleene Algebra for Protocol Verification. In: Schmidt, R.A. (ed.) RelMiCS/AKA 2006. LNCS, vol. 4136, pp. 296–310. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Möller, B.: Lazy Kleene Algebra. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 252–273. Springer, Heidelberg (2004)

    Google Scholar 

  10. Pauly, M., Parikh, R.: Game Logic - An Overview. Studia Logica 75(2), 165–182 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Parikh, R.: The Logic of Games. Annals of Discrete Mathematics 24, 111–140 (1985)

    MathSciNet  Google Scholar 

  12. Rabin, M.: N-Process Mutual Exclusion with Bounded Waiting by 4 log2 N- Valued Shared Variable. JCSS 25(1), 66–75 (1982)

    MATH  MathSciNet  Google Scholar 

  13. Rewitzky, I.: Binary Multirelations. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 256–271. Springer, Heidelberg (2003)

    Google Scholar 

  14. Rewitzky, I., Brink, C.: Monotone Predicate Transformers as Up-Closed Multirelations. In: Schmidt, R.A. (ed.) RelMiCS/AKA 2006. LNCS, vol. 4136, pp. 311–327. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Venema, Y.: Representation of Game Algebras. Studia Logica 75(2), 239–256 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rudolf Berghammer Bernhard Möller Georg Struth

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Furusawa, H., Tsumagari, N., Nishizawa, K. (2008). A Non-probabilistic Relational Model of Probabilistic Kleene Algebras. In: Berghammer, R., Möller, B., Struth, G. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2008. Lecture Notes in Computer Science, vol 4988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78913-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78913-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78912-3

  • Online ISBN: 978-3-540-78913-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics