|Title:||Probabilistic Termination Versus Fair Termination
|Abstract:||In this paper we show that probabilistic termination of concurrent program is in many cases much simpler than the "fair" one. For a wide class of definitions of probabilistic termination we may express termination by rrf arithmetic formula, whereas the "fair" termination can be expressed only by rrf secqnd order arithmetic formula. Proof of "fair" termination usually needs induction on recursive ordinals, but proof of probabilistic termination has the complexity equivalent to that of detepninistic program termination.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1988/CS/CS0496), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1988
To the main CS technical reports page
Computer science department, Technion