Where academic tradition
meets the exciting future

On Two Dually Nondeterministic Refinement Algebras

Kim Solin, On Two Dually Nondeterministic Refinement Algebras . 2006-05, 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:

@TECHREPORT{tSolin06a,
  title = {On Two Dually Nondeterministic Refinement Algebras },
  author = {Solin, Kim},
  number = {2006-05},
  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

Edit publication