Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

LIFTED MULTIRELATIONS AND PROGRAM SEMANTICS

Soudamini, Jidesh

Abstract Details

2006, MS, Kent State University, College of Arts and Sciences / Department of Computer Science.
Using predicate transformers one can simultaneously model angelic and demonic nondetermin- ism. However, using standard relations one cannot simultaneously model both kinds of nonde- terminism. Recently, in [5], I. Rewitzky has shown that by using up-closed binary multirelations both kinds of nondeterminism can be simultaneously modeled. In [6], Rewitzky and C. Brink note that many of the operations associated with binary multirelations are extensions of lifted operations. In this thesis, we propose a new relational model, the lifted binary multirelational model. We prove that the set of up-closed binary multirelations is embedded in the domain of relations between powersets. For that we use a Galois connection to show that there exists an isomorphism between lifted multirelations and up-closed binary multirelations. We show three porperties that exist when upclosed binary multirelations are lifted to relations between powersets.
Austin Melton (Advisor)
26 p.

Recommended Citations

Citations

  • Soudamini, J. (2006). LIFTED MULTIRELATIONS AND PROGRAM SEMANTICS [Master's thesis, Kent State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=kent1164077672

    APA Style (7th edition)

  • Soudamini, Jidesh. LIFTED MULTIRELATIONS AND PROGRAM SEMANTICS. 2006. Kent State University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=kent1164077672.

    MLA Style (8th edition)

  • Soudamini, Jidesh. "LIFTED MULTIRELATIONS AND PROGRAM SEMANTICS." Master's thesis, Kent State University, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=kent1164077672

    Chicago Manual of Style (17th edition)