Title: Reducing Model Checking from Multi-Valued CTL* to CTL*
<P>

Speaker:
 Beata Konikowsks
<BR>
Computing Systems Theory Group
<BR>
Institute of Computer Science
<BR>
Polish Academy of Sciences
<P>
Abstract
<BR>
========
<P>

A multi-valued version of CTL* (mv-CTL*), where
both the propositions and the accessibility relation
are multi-valued taking values in a finite quasi-boolean algebra,
is considered. A general translation from mv-CTL* to CTL* model checking is 
defined. An application of the translation is shown for the most commonly
used quasi-boolean algebras.