Abstract
We consider three different meanings of a non-deterministic Ianov-scheme with respect to infinite computations: trace-semantics, Plotkin-semantics, and Smyth-semantics. The corresponding equivalence relations are shown to be decidable.
Get full access to this article
View all access options for this article.