| Stephen L. Bloom and Zolt'an ' Esik. Iteration algebras of finite state process behaviors. Draft, February 1994. |
....this form. We mention two, deferring full definitions of the notation involved to later in this chapter. Firstly the unique fixed point rule schema from [Mil84] E = F [E=X] X guarded in F E = XF in which the guarded condition is not equational and secondly the functorial implication from [B E94] 8i 2 m : E i [Y ae(j) X j ] j2m = F ae(i) 8i 2 m : i X E = ae(i) Y F which has an instance for each pair m; n 1 of natural numbers and surjective function ae : m n. In summary, for both expressions and expressions we have a hierarchy of classes of ....
....applicable. In particular any pure equational (resp. horn clause) axiomatisation defines a variety (resp. quasi variety) containing an initial model. For the expressions there are several possible notions of model. Two, the preiteration algebras and strong preiteration algebras, are given in [B E94] together with an analogue of the variety theorem. They are specialized from work on iteration theories. These provide a general setting for the investigation of the equational logic of fixed point operators. We cannot do justice to the work here, but instead refer the reader to [B E93b] One can ....
[Article contains additional citation context not shown here]
Stephen L. Bloom and Zoltan Esik. Iteration algebras of finite state process behaviors. Draft, February 1994.
No context found.
Stephen L. Bloom and Zolt'an ' Esik. Iteration algebras of finite state process behaviors. Draft, February 1994.
No context found.
Stephen L. Bloom and Zoltan Esik. Iteration algebras of finite state process behaviors. Draft, February 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC