Advertisement

Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines

  • Louis E. Rosier
  • Hsu-Chun Yen
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bentley, J., Ottmann, T. and Widmayer, P., The complexity of manipulating hierarchically defined sets of rectangles, Advances in Computing Research, JAI Press Inc., Vol. 1, 1983, pp. 127–158.Google Scholar
  2. [2]
    Chandra, A., Kozen, D. and Stockmeyer, L., Alternation, JACM, Vol. 28, No. 1, January 1981, pp. 114–133.CrossRefGoogle Scholar
  3. [3]
    Chang, C., Gouda, M. and Rosier, L., Deciding liveness for special classes of communicating finite state machines, Proc. of the 22nd Annual Allerton Conf. on Communication, Control, and Computing, 1984, pp. 931–939.Google Scholar
  4. [4]
    Cohen, R. and Gold, A., Theory of ω-languages. I: Characterizations of ω-Context-Free languages, J. of Computer and System Sciences, 15, 1977, pp. 169–184.Google Scholar
  5. [5]
    Cook, S., The classification of problems which have fast parallel algorithms, Fundamentals of Computation Theory, LNCS 158, 1983, pp. 78–93.Google Scholar
  6. [6]
    Cook, S., The complexity of theorem proving procedures, Proc. of the 3rd Annual ACM Symp. on Theory of Computing, 1971, pp. 151–158.Google Scholar
  7. [7]
    Emerson, E. and Lei, C., Modalities for model checking: branching time strikes back, Proc. of the 12th Annual ACM Symp. on Principles of Programming Languages, 1985, pp. 84–95.Google Scholar
  8. [8]
    Emerson, E. and Lei, C., Temporal model checking under generalized fairness constraints, Proc. of the 18th Annual Hawaii Int. Conf. on System Sciences, 1985, pp. 277–288.Google Scholar
  9. [9]
    Fischer, M. and Paterson, M., Storage requirements for fair scheduling, Information Processing Letters, 17, 1983, pp. 249–250.Google Scholar
  10. [10]
    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
  11. [11]
    Gouda, M. and Chang, C., A technique for proving liveness of communicating finite state machines with examples, Proc. of the 3rd Annual ACM Symp. on Principles of Distributed Computing, 1984, pp. 38–49.Google Scholar
  12. [12]
    Gouda, M. and Rosier, L., On deciding progress for a class of communication protocols, Proc. of the 18th Annual Conf. on Information Sciences and Systems, Princeton Univ., 1984, pp. 663–667.Google Scholar
  13. [13]
    Hopcroft, J. and Ullman, J., "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, Reading, Mass., 1979.Google Scholar
  14. [14]
    Jones, N. and Laaser, W., Complete problems for deterministic polynomial time, Theoretical Computer Science, 3, 1977, pp. 105–117.CrossRefGoogle Scholar
  15. [15]
    Jones, N., Lien, E. and Laaser, W., New problems complete for nondeterministic log space, Mathematical Systems Theory, 10, 1976, pp. 1–17.CrossRefGoogle Scholar
  16. [16]
    Karp, R., Reducibility among combinatorial problems, in Complexity of Computer Computations, edited by R. E. Miller and J. Thatcher, Plenum Press, New York, 1972, pp. 85–104.Google Scholar
  17. [17]
    Ladner, R. and Lynch, N., Relativization of questions about log space computability, Mathematical Systems Theory, 10, 1976, pp. 19–32.CrossRefGoogle Scholar
  18. [18]
    Landweber, L., Decision Problems for ω-automata, Mathematical Systems Theory, 3, 1969, pp. 376–384.CrossRefGoogle Scholar
  19. [19]
    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
  20. [20]
    Lewis, H. and Papadimitriou, C., Symmetric space-bounded computation, Automata, Languages and Programming, LNCS 85, 1980, pp. 374–384.Google Scholar
  21. [21]
    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
  22. [22]
    Lynch, N., Log space machines with multiple oracle tapes, Theoretical Computer Science, 6, 1978, pp. 25–39.Google Scholar
  23. [23]
    Papadimitriou, C., On the complexity of unique solutions, JACM, Vol. 31, No. 2, April 1984, pp. 392–400.MathSciNetGoogle Scholar
  24. [24]
    Papadimitriou, C. and Yannakakis, M., The complexity of facets (and some facets of complexity), J. of Computer and System Sciences, 28, 1984, pp. 244–259.Google Scholar
  25. [25]
    Reif, J., Symmetric complementation, JACM, Vol. 31, No. 2, April 1984, pp. 401–421.MathSciNetGoogle Scholar
  26. [26]
    Rosier, L. and Yen, H., Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines, Univ. of Texas at Austin, Dept. of Computer Sciences, Tech. Report No. 85-08, May 1985.Google Scholar
  27. [27]
    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
  28. [28]
    Stockmeyer, L., The polynomial-time hierarchy, Theoretical Computer Science, 3, 1977, pp. 1–22.CrossRefGoogle Scholar
  29. [29]
    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 1985

Authors and Affiliations

  • Louis E. Rosier
    • 1
  • Hsu-Chun Yen
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustin

Personalised recommendations