@inproceedings{1b13db1249ec4d50add30f4cc068f550,
title = "Proving positive almost sure termination under strategies",
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.",
author = "Olivier Bournez and Florent Garnier",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11805618\_27",
language = "English",
isbn = "3540368345",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "357--371",
booktitle = "Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings",
note = "17th International Conference on Term Rewriting and Applications, RTA 2006 ; Conference date: 12-08-2006 Through 14-08-2006",
}