• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

On Two Dually Nondeterministic Refinement Algebras

Kim Solin, On Two Dually Nondeterministic Refinement Algebras. In: Relations and Kleene Algebra in Computer Science, Lecture Notes in Computer Science 4136, 373–387, Springer, 2006.

Abstract:

A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facilitates reasoning about total-correctness preserving program transformations and nondeterministic programs. The negation operator is used to express enabledness and termination operators through a useful explicit definition. As a small application, a property of action systems is proved employing the algebra. A dually nondeterministic refinement algebra without the negation operator is also discussed.

BibTeX entry:

@INPROCEEDINGS{inpSolin06a,
  title = {On Two Dually Nondeterministic Refinement Algebras},
  booktitle = {Relations and Kleene Algebra in Computer Science},
  author = {Solin, Kim},
  volume = {4136},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  pages = {373–387},
  year = {2006},
  keywords = {refinement algebra, dual nondeterminism, enabledness and termination, action systems},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 1

Edit publication