Skip to main content
SpringerLink
Log in

Proving Positive Almost Sure Termination Under Strategies

  • Conference paper
Term Rewriting and Applications (RTA 2006)

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

Included in the following conference series:

Abstract

In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps.

Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems.

This is often natural or more useful to restrict policies to a subclass. We introduce the notion of positive almost sure termination under strategies, and we provide sufficient criteria to prove termination of a given probabilitic rewrite system under strategies. This is illustrated with several examples.

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. Ieee csma/ca 802.11 working group home page, http://www.ieee802.org/11/

  2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  3. Balbo, G.: Introduction to stochastic Petri nets. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol. 2090, p. 84. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Borovanský, P., Kirchner, C., Kirchner, H.: Controlling Rewriting by Rewriting. In: Meseguer, J. (ed.) Proceedings of 1st International Workshop on Rewriting Logic, Asilomar (CA, USA), September 1996. Electronic Notes in Theoretical Computer Science, vol. 4 (1996)

    Google Scholar 

  5. Bournez, O., Garnier, F.: Proving positive almost sure termination. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 323–337. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Bournez, O., Hoyrup, M.: Rewriting logic and probabilities. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 61–75. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Bournez, O., Kirchner, C.: Probabilistic rewrite strategies: Applications to ELAN. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 252–266. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Bournez, O., Garnier, F., Kirchner, C.: Termination in finite mean time of a csma/ca rule-based model. Technical report, LORIA, Nancy (2005)

    Google Scholar 

  9. Brémaud, P.: Markov Chains, Gibbs Fields, Monte Carlo Simulation, and Queues. Springer, New York (2001)

    Google Scholar 

  10. de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (1998)

    Google Scholar 

  11. Fayolle, G., Malyshev, V.A., Menshikov, M.V.: Topics in constructive theory of countable Markov chains. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  12. Fissore, O., Gnaedig, I., Kirchner, H.: Simplification and termination of strategies in rule-based languages. In: PPDP 2003: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, pp. 124–135. ACM Press, New York (2003)

    Chapter  Google Scholar 

  13. Fissore, O., Gnaedig, I., Kirchner, H.: A proof of weak termination providing the right way to terminate. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 356–371. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Foster, F.G.: On the stochastic matrices associated with certain queuing processes. The Annals of Mathematical Statistics 24, 355–360 (1953)

    Article  MATH  MathSciNet  Google Scholar 

  15. Frühwirth, T., Pierro, A.D., Wiklicky, H.: Toward probabilistic constraint handling rules. In: Abdennadher, S., Frühwirth, T. (eds.) Proceedings of the third Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP 2001), Paphos, Cyprus (December 2001); Under the hospice of the International Conferences in Constraint Programming and Logic Programming

    Google Scholar 

  16. Hansson, H.: Time and Probability in Formal Design of Distributed Systems. Series in Real-Time Safety Critical Systems. Elsevier, Amsterdam (1994)

    Google Scholar 

  17. Hart, S., Sharir, M.: Concurrent probabilistic programs, or: How to schedule if you must. SIAM Journal on Computing 14(4), 991–1012 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hart, S., Sharir, M., Pnueli, A.: Termination of probabilistic concurrent program. ACM Transactions on Programming Languages and Systems 5(3), 356–380 (1983)

    Article  MATH  Google Scholar 

  19. Hérault, T., Lassaigne, R., Magniette, F., Peyronnet, S.: Approximate probabilistic model checking. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 73–84. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, p. 200. Springer, Heidelberg (2002)

    Google Scholar 

  21. Kwiatkowska, M.Z.: Model checking for probability and time: from theory to practice. In: LICS, p. 351 (2003)

    Google Scholar 

  22. Nirman, K., Sen, K., Meseguer, J., Agha, G.: A rewriting based model for probabilistic distributed object systems. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 32–46. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  23. Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: STOC: ACM Symposium on Theory of Computing (STOC) (1983)

    Google Scholar 

  24. Pnueli, A., Zuck, L.D.: Probabilistic verification. Information and Computation 103(1), 1–29 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  25. Puternam, M.L.: Markov Decision Processes - Discrete Stochastic Dynamic Programming. Wiley series in probability and mathematical statistics. John Wiley & Sons, Chichester (1994)

    Google Scholar 

  26. Sanders, W.H., Meyer, J.F.: Stochastic Activity Networks: Formal Definitions and Concepts. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol. 2090, p. 315. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, October 21–23, pp. 327–338 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LORIA/INRIA, 615 Rue du Jardin Botanique, 54602 Cedex, Villers lès Nancy, France

    Olivier Bournez & Florent Garnier

Authors
  1. Olivier Bournez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florent Garnier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carnegie Mellon University,  

    Frank Pfenning

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bournez, O., Garnier, F. (2006). Proving Positive Almost Sure Termination Under Strategies. In: Pfenning, F. (eds) Term Rewriting and Applications. RTA 2006. Lecture Notes in Computer Science, vol 4098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11805618_27

Download citation

  • DOI: https://doi.org/10.1007/11805618_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36834-2

  • Online ISBN: 978-3-540-36835-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation