# On the complexity of deciding fair termination of probabilistic concurrent finite-state programs

Conference paper

First Online:

## Keywords

Turing Machine Fair Termination Concurrent Program Termination Problem Deterministic Time
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- [1]Adachi, A. and Iwata, S., Some combinatorial game problems require Ω(n
^{k}) time,*JACM,*Vol. 31, No. 2, April 1984, pp. 361–376.Google Scholar - [2]Chandra, A., Kozen, D. and Stockmeyer, L., Alternation,
*JACM,*Vol. 28, No. 1, January 1981, pp. 114–133.Google Scholar - [3]Garey, M. and Johnson, D., "Computers and Intractability: A Guide to the Theory of NP-Completeness", W. H. Freeman and Company, San Francisco, 1979.Google Scholar
- [4]Hart, S., Sharir, M. and Pnueli, A., Termination of probabilistic concurrent programs,
*ACM Trans. on Programming Languages and Systems,*Vol. 5, No. 3, July 1983, pp. 356–380.Google Scholar - [5]Hart, S., Sharir, M. and Pnueli, A., Verification of probabilistic systems,
*SIAM J. of Computing,*13, 1984, pp. 292–314.Google Scholar - [6]Hopcroft, J. and Ullman, J., "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, Reading, Mass., 1979.Google Scholar
- [7]Iwata, S. and Kasai, T., Problem requiring k*log n deterministic space,
*Proc. 15th Southeastern Conf. on Combinatorics, Graph Theory and Computing,*Baton Rouge, 1984.Google Scholar - [8]Jones, N. and Laaser, W., Complete problems for deterministic polynomial time,
*Theoretical Computer Science,*3, 1977, pp. 105–117.Google Scholar - [9]Kasai, T. and Iwata, S., Gradually intractable problems and nondeterministic log-space lower bounds,
*Mathematical Systems Theory,*Vol. 18, No. 2, 1985, pp. 153–170.Google Scholar - [10]Kemeny, J., Snell, J. and Knapp, A., "Denumerable Markov Chains", D. van Nostrad Company, 1966.Google Scholar
- [11]Ladner, R., The complexity of problems in systems of communicating sequential processes,
*J. of Computer and System Sciences,*21, 1980, pp. 179–194.Google Scholar - [12]Lehmann, D., Pnueli, A and Stavi, J., Impartiality, justice and fairness: The ethics of concurrent termination,
*Automata, Languages and Programming,*LNCS 115, 1981, pp. 264–277.Google Scholar - [13]Lehmann, D. and Rabin, M., On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem,
*Proc. of the 10th ACM Symp. on Principles of Programming Languages,*1981, pp. 133–138.Google Scholar - [14]Lichtenstein, O. and Pnueli, A., Checking that finite state concurrent programs satisfy their linear specification,
*Proc. of the 12th Annual ACM Symp. on Principles of Programming Languages,*1985, pp. 97–107.Google Scholar - [15]Pnueli, A., On the extremely fair treatment of probabilistic algorithms,
*Proc. of the 15th Annual ACM Symp. on Theory of Computing,*1983, pp. 278–290.Google Scholar - [16]Rabin, M., N-process synchronization by 4*log
_{2}N-valued shared variable,*Proc. of the 21st Annual Symp. on Foundations of Computer Science,*1980, pp. 407–410.Google Scholar - [17]Rabin, M., The choice coordination problem,
*Acta Informatica,*17, 1982, pp. 121–134.Google Scholar - [18]Rosier, L. and Yen, H., A multiparameter analysis of the boundedness problem for vector addition systems,
*Fundamentals of Computation Theory,*LNCS 199, 1985, pp. 361–370. (To appear in*J. of Computer and System Sciences,*1986.)Google Scholar - [19]Rosier, L. and Yen, H., Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines,
*Proc. of 3rd Annual Symp. on Theoretical Aspects of Computer Science,*LNCS 210, 1986, pp. 306–320.Google Scholar - [20]Rosier, L. and Yen, H., On the complexity of deciding fair termination of probabilistic concurrent finite-state programs, Univ. of Texas at Austin, Dept. of Computer Sciences, Tech. Report No. 85-22, October 1985.Google Scholar
- [21]Ruzzo, W., Simon, J. and Tompa, M., Space-bounded hierarchies and probabilistic computations,
*J. of Computer and System Sciences,*28, 1984, pp. 216–230.Google Scholar - [22]Vardi, M., Automatic verification of probabilistic concurrent finite-state programs,
*Proc. of the 26th Annual Symposium on Foundations of Computer Science,*1985, pp. 327–338.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1986