Results 1 
7 of
7
Equational axioms for probabilistic bisimilarity
 IN PROCEEDINGS OF 9TH AMAST, LECTURE NOTES IN COMPUTER SCIENCE
, 2002
"... This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational properties of the fixed point operator on (#)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity.
The logic of recursive equations
 the Journal of Symbolic Logic
, 1998
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JS ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.
The category theoretic solution of recursive program schemes
 Proc. First Internat. Conf. on Algebra and Coalgebra in Computer Science (CALCO 2005), Lecture Notes in Computer Science
, 2006
"... Abstract. This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the categorytheoretic version of the classical area of algebraic semantics. The overall assumptions needed are small indeed: worki ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the categorytheoretic version of the classical area of algebraic semantics. The overall assumptions needed are small indeed: working only in categories with “enough final coalgebras ” we show how to formulate, solve, and study recursive program schemes. Our general theory is algebraic and so avoids using ordered, or metric structures. Our work generalizes the previous approaches which do use this extra structure by isolating the key concepts needed to study substitution in infinite trees, including secondorder substitution. As special cases of our interpreted solutions we obtain the usual denotational semantics using complete partial orders, and the one using complete metric spaces. Our theory also encompasses implicitly defined objects which are not usually taken to be related to recursive program schemes. For example, the classical Cantor twothirds set falls out as an interpreted
Iteration Monads
 Proceedings CMCS'01. Electronic Notes in Theoretical Computer Science 44
, 2000
"... . It has already been noticed by C. Elgot and his collaborators that the algebra of (nite and innite) trees is completely iterative, i.e., every system of ideal recursive equations has a unique solution. We prove that this is a special case of a very general coalgebraic phenomenon: suppose that an e ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. It has already been noticed by C. Elgot and his collaborators that the algebra of (nite and innite) trees is completely iterative, i.e., every system of ideal recursive equations has a unique solution. We prove that this is a special case of a very general coalgebraic phenomenon: suppose that an endofunctor
On iterable endofunctors
 Category Theory and Computer Science 2002, number 69 in Elect. Notes in Theor. Comp. Sci
, 2003
"... Completely iterative monads of Elgot et al. are the monads such that every guarded iterative equation has a unique solution. Free completely iterative monads are known to exist on every iteratable endofunctor H, i. e., one with final coalgebras of all functors H ( ) + X. We show that conversely, if ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Completely iterative monads of Elgot et al. are the monads such that every guarded iterative equation has a unique solution. Free completely iterative monads are known to exist on every iteratable endofunctor H, i. e., one with final coalgebras of all functors H ( ) + X. We show that conversely, if H generates a free completely iterative monad, then it is iteratable. Key words: monad, completely iterative, iterable 1
Dynamics of Algorithms
"... This paper represents an extended version of [16]. In the next section we describe partially additive categories. In section 3 we present the execution of pseudoalgorithms in the framework of the partially additive categories as a kind of iteration of endomorphisms. Moreover, we consider deadlock fr ..."
Abstract
 Add to MetaCart
This paper represents an extended version of [16]. In the next section we describe partially additive categories. In section 3 we present the execution of pseudoalgorithms in the framework of the partially additive categories as a kind of iteration of endomorphisms. Moreover, we consider deadlock free pseudoalgorithms as to be characterized by a summability condition; concepts about structural aspects are organized via type discipline and type compatible dynamics.
FINAL COALGEBRAS IN ACCESSIBLE CATEGORIES
, 905
"... Abstract. We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring an explicit construction of the final coalgebra in ..."
Abstract
 Add to MetaCart
Abstract. We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring an explicit construction of the final coalgebra in this case. On the other hand, there are interesting examples of final coalgebras beyond the realm of l.f.p. categories to which our results apply. We rely on ideas developed by Tom Leinster for the study of selfsimilar objects in topology. 1.