Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Mathematica Slovaca

Editor-in-Chief: Pulmannová, Sylvia

6 Issues per year


IMPACT FACTOR 2016: 0.346
5-year IMPACT FACTOR: 0.412

CiteScore 2017: 0.46

SCImago Journal Rank (SJR) 2017: 0.339
Source Normalized Impact per Paper (SNIP) 2017: 0.845

Mathematical Citation Quotient (MCQ) 2016: 0.24

Online
ISSN
1337-2211
See all formats and pricing
More options …
Volume 62, Issue 4

Issues

Partial information systems and the Smyth powerdomain

James Hart
Published Online: 2012-07-18 | DOI: https://doi.org/10.2478/s12175-012-0035-8

Abstract

The dual of the join semilattice of proper compact Scott open subsets of a domain D is called the Smyth powerdomain of D. The Smyth powerdomain is used in programming semantics as a model for demonic nondeterminism. In this paper, we introduce the concept of partial information systems; and, as an application, show that the Smyth powerdomain of any domain can be realized in terms of the sub partial information systems of the domain’s corresponding information system.

MSC: Primary 06A06, 06F30, 68Q55

Keywords: powerdomain; information system; programming semantics; Scott topology

  • [1] DAVEY, B. A.— PRIESTLEY, H. A.: Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990. Google Scholar

  • [2] CALLEJAS BEDREGAL, B. R.: Representing some categories of domains as information system structures. In: Abstracts Collection, International Symposium on Domain Theory, Chengdu, P. R. China, 2001, pp. 51–62. Google Scholar

  • [3] DROSTE, M.— GÖBEL, R.: Effectively given information systems and domains. In: Lecture Notes in Comput. Sci. 440, Springer, Berlin-Heidelberg, 1990, pp. 116–142. Google Scholar

  • [4] DROSTE, M. — GÖBEL, R.: Non-deterministic information systems and their domains, Theoret. Comput. Sci. 75 (1990), 289–309. http://dx.doi.org/10.1016/0304-3975(90)90097-2CrossrefGoogle Scholar

  • [5] HART, J.— TSINAKIS, C.: A concrete realization of the hoare powerdomain, Soft Comput. 11 (2007), 1059–1063. http://dx.doi.org/10.1007/s00500-007-0153-3CrossrefWeb of ScienceGoogle Scholar

  • [6] PLOTKIN, G. D.: A powerdomain construction, SIAM J. Comput. 5 (1976), 452–487. http://dx.doi.org/10.1137/0205035CrossrefGoogle Scholar

  • [7] PLOTKIN, G. D.: Post-graduate Lecture Notes in Advanced Domain Theory. Technical Report, Dept. of Computer Science, Univ. of Edinburgh, 1981 (Incorporating the Pisa Lecture Notes). Google Scholar

  • [8] SCOTT, D. S.: Domains for denotational semantics. In: Lecture Notes in Comput. Sci. 140, Springer, Berlin. 1982, pp. 577–613. Google Scholar

  • [9] SPREEN, D. — XU, L. — MAO, X.: Information systems revisited — the general continuous case, Theoret. Comput. Sci. 405 (2008), 176–187. http://dx.doi.org/10.1016/j.tcs.2008.06.032CrossrefGoogle Scholar

  • [10] VICKERS, S.: Topology via Logic, Cambridge University Press, Cambridge, 1989. Google Scholar

  • [11] XU, L. — MAO, X.: Various constructions of continuous information systems. In: Electron. Notes Theor. Comput. Sci. 212, Elsevier, Amsterdam, 2008, pp. 299–311. Google Scholar

About the article

Published Online: 2012-07-18

Published in Print: 2012-08-01


Citation Information: Mathematica Slovaca, Volume 62, Issue 4, Pages 621–632, ISSN (Online) 1337-2211, ISSN (Print) 0139-9918, DOI: https://doi.org/10.2478/s12175-012-0035-8.

Export Citation

© 2012 Mathematical Institute, Slovak Academy of Sciences. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. BY-NC-ND 3.0

Comments (0)

Please log in or register to comment.
Log in