Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Powerdomains, powerstructures and fairness

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 933))

Included in the following conference series:

Abstract

We introduce the framework of powerstructures for comparing models of non-determinism and concurrency, and we show that in this context the Plotkin powerdomain plot(D) [6] naturally occurs as a quotient of a refined and generalized player model ipf (D), following Moschovakis [2, 3]. On the other hand, Plotkin's domains for countable non-determinism plotĪ‰(D) [7] are not comparable with these structures, as they cannot be realized concretely in the powerset of D.

During the preparation of this paper, Moschovakis was partially supported by a NSF Grant and Whitney was supported by a Fellowship from the Fanny and John Hertz Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Hennessy and G. D. Plotkin, “Full abstraction for a simple parallel programming language,” Proceedings of MFCS, Lecture Notes in Computer Science 74, ed. J. Becvar, Berlin: Springer-Verlag (1979) 108–120.

    Google Scholar 

  2. Y. N. Moschovakis, “A game-theoretic modeling of concurrency,” Extended abstract, Proceedings of the fourth annual symposium on Logic in Computer Science, IEEE Computer Society Press (1989) 154–163.

    Google Scholar 

  3. Y. N. Moschovakis, “A model of concurrency with fair merge and full recursion,” Information and Computation 93 (1991) 114–171.

    Article  Google Scholar 

  4. Y. N. Moschovakis, “Computable, concurrent processes,” Theoretical Computer Science (to appear).

    Google Scholar 

  5. D. Park, “On the semantics of fair parallelism,” Proc. Copenhagen Winter School, Lecture Notes in Computer Science 104, Berlin: Springer-Verlag (1980) 504–526.

    Google Scholar 

  6. G. D. Plotkin, “A powerdomain construction,” SIAM J. of Comput. 5 (1976) 452–487.

    Article  Google Scholar 

  7. G. D. Plotkin, “A powerdomain for countable non-determinism,” Automata, Languages, and Programming 9th Colloquium, Lecture Notes in Computer Science 140, eds. M. Nielsen and E. Schmidt, Berlin: Springer-Verlag (1982) 418–428.

    Google Scholar 

  8. M. B. Smyth, “Power Domains,” J. Comput. System Sci. 16 (1978) 23–36.

    Article  Google Scholar 

  9. G. T. Whitney, “Recursion Structures for Non-Determinism and Concurrency, ” Ph.D. Thesis, University of California, Los Angeles (1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Math, UCLA, 90024, Los Angeles, CA

    Yiannis N. Moschovakis

  2. Dept. of Math, University of Michigan, 48109, Ann Arbor, MI

    Glen T. Whitney

Authors
  1. Yiannis N. Moschovakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Glen T. Whitney
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

Š 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moschovakis, Y.N., Whitney, G.T. (1995). Powerdomains, powerstructures and fairness. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022270

Download citation

  • DOI: https://doi.org/10.1007/BFb0022270

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60017-6

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation