| C. Hartonas, "Semantics for Finite Delay", Theoretical Computer Science 176, 4/1997. |
....ffl Gamma Delta Delta Delta are necessarily mapped to Omega by the corresponding unique decorations. Notice that, besides applications in the semantics of programming languages (eg, Aczel, 1988; Mukai, 1991; Rutten and Turi, 1993; Aczel, 1994; Baldamus, 1994; Honsell and Lenisa, 1995; Hartonas, 1997)) non well founded sets have been extensively used in Situation Theory (eg, Barwise and Etchemendy, 1987) where they are better known as hypersets. Correspondingly, models of the universe of non well founded sets are also called hyperuniverses. Foundations of Final Coalgebra Semantics ....
Hartonas, C. (1997). Semantics of finite delay. Theoretical Computer Science, 176(1--2):205--234.
....enough so that it can prove all the laws for the delay operators taken as axioms in the Finite Delay Calculus of Milner. Finally, we sketch a semantics for SCCS oe that is fully abstract for fair bisimilarity and fortification. The semantics is along the lines of Aczel s [4] and this author s [12] and it is defined as the largest solution P (in the category of classes) of the recursive equation X = Act Theta X) Theta (Act ) Keywords: Fairness, Finite Delay, Mixed Fixpoints, Antifoundation. 1 Introduction If A and B are processes defined by A j recx:ax; B j recy:by and j is an ....
.... terms under fairness constraints are usually regarded as pairs (p; E) where p is a process, typically a treelike structure, and E is an environment, typically a set of infinite sequences of actions (see Milner [21] Hennessy [14, 15, 17] Winskel [31] Hartonas and Kwiatkowska [11] Hartonas [12], Huth and Kwiatkowska [20] Our point of departure from the usual approach is that whereas the relativization of processes to environments is there made only at the level of semantics we seek to bring this down to the object language of the calculus. Environments (contexts, types) of processes ....
[Article contains additional citation context not shown here]
C. Hartonas, "Semantics for Finite Delay", Theoretical Computer Science 176, 4/1997.
No context found.
C. Hartonas, "Semantics for Finite Delay", Theoretical Computer Science 176, 4/1997.
....enough so that it can prove all the laws for the delay operators taken as axioms in the Finite Delay Calculus of Milner. Finally, we sketch a semantics for SCCS oe that is fully abstract for fair bisimilarity and fortification. The semantics is along the lines of Aczel s [4] and this author s [12] and it is defined as the largest solution P (in the category of classes) of the recursive equation X = Act Theta X) Theta (Act ) Keywords: Fairness, Finite Delay, Mixed Fixpoints, Antifoundation. 1 Introduction If A and B are processes defined by A j recx:ax; B j recy:by and j is an ....
.... terms under fairness constraints are usually regarded as pairs (p; E) where p is a process, typically a treelike structure, and E is an environment, typically a set of infinite sequences of actions (see Milner [21] Hennessy [14, 15, 17] Winskel [31] Hartonas and Kwiatkowska [11] Hartonas [12], Huth and Kwiatkowska [20] Our point of departure from the usual approach is that whereas the relativization of processes to environments is there made only at the level of semantics we seek to bring this down to the object language of the calculus. Environments (contexts, types) of processes ....
[Article contains additional citation context not shown here]
C. Hartonas, "Semantics for Finite Delay", Theoretical Computer Science 176, 4/1997.
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