Sciweavers

163
Voted
RTA
2005
Springer
16 years 28 days ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier