On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs

Louis E. Rosier, Hsu-Chun Yen. On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs. In Laurent Kott, editor, Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings. Volume 226 of Lecture Notes in Computer Science, pages 334-343, Springer, 1986.

Abstract

Abstract is missing.