Results 1  10
of
28
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 456 (20 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Automata with group actions
 In LICS
, 2011
"... Abstract—Our motivating question is a MyhillNerode theorem for infinite alphabets. We consider several kinds of those: alphabets whose letters can be compared only for equality, but also ones with more structure, such as a total order or a partial order. We develop a framework for studying such alp ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
Abstract—Our motivating question is a MyhillNerode theorem for infinite alphabets. We consider several kinds of those: alphabets whose letters can be compared only for equality, but also ones with more structure, such as a total order or a partial order. We develop a framework for studying such alphabets, where the key role is played by the automorphism group of the alphabet. This framework builds on the idea of nominal sets of Gabbay and Pitts; nominal sets are the special case of our framework where letters can be only compared for equality. We use the framework to uniformly generalize to infinite alphabets parts of automata theory, including decidability results. In the case of letters compared for equality, we obtain automata equivalent in expressive power to finite memory automata, as defined by Francez and Kaminski. I.
Automata and fixed point logics: a coalgebraic perspective
 Electronic Notes in Theoretical Computer Science
, 2004
"... This paper generalizes existing connections between automata and logic to a coalgebraic level. Let F: Set → Set be a standard functor that preserves weak pullbacks. We introduce various notions of Fautomata, devices that operate on pointed Fcoalgebras. The criterion under which such an automaton a ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
This paper generalizes existing connections between automata and logic to a coalgebraic level. Let F: Set → Set be a standard functor that preserves weak pullbacks. We introduce various notions of Fautomata, devices that operate on pointed Fcoalgebras. The criterion under which such an automaton accepts or rejects a pointed coalgebra is formulated in terms of an infinite twoplayer graph game. We also introduce a language of coalgebraic fixed point logic for Fcoalgebras, and we provide a game semantics for this language. Finally we show that any formula p of the language can be transformed into an Fautomaton Ap which is equivalent to p in the sense that Ap accepts precisely those pointed Fcoalgebras in which p holds.
Coalgebraic automata theory: Basic results
 Logical Methods in Computer Science
"... Vol. 4 (4:10) 2008, pp. 1–43 www.lmcsonline.org ..."
On Tree Coalgebras and Coalgebra Presentations
, 2002
"... For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an element of the final coalgebra) turns out to represent a new coalgebra A t . The universal property of these coalgebras, resembling freeness, is that for every state s of every system S there exists a uniqu ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an element of the final coalgebra) turns out to represent a new coalgebra A t . The universal property of these coalgebras, resembling freeness, is that for every state s of every system S there exists a unique coalgebra homomorphism from a unique A t which takes the root of t to s. Moreover, the tree coalgebras are finitely presentable and form a strong generator. Thus, these categories of coalgebras are locally finitely presentable; in particular every system is a filtered colimit of finitely presentable systems.
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
On the construction of free algebras for equational systems
 IN: SPECIAL ISSUE FOR AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP 2007). VOLUME 410 OF THEORETICAL COMPUTER SCIENCE
, 2009
"... The purpose of this paper is threefold: to present a general abstract, yet practical, notion of equational system; to investigate and develop the finitary and transfinite construction of free algebras for equational systems; and to illustrate the use of equational systems as needed in modern applica ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
The purpose of this paper is threefold: to present a general abstract, yet practical, notion of equational system; to investigate and develop the finitary and transfinite construction of free algebras for equational systems; and to illustrate the use of equational systems as needed in modern applications.
Free modal algebras: a coalgebraic perspective
"... Abstract. In this paper we discuss a uniform method for constructing free modal and distributive modal algebras. This method draws on works by (Abramsky 2005) and (Ghilardi 1995). We revisit the theory of normal forms for modal logic and derive a normal form representation for positive modal logic. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. In this paper we discuss a uniform method for constructing free modal and distributive modal algebras. This method draws on works by (Abramsky 2005) and (Ghilardi 1995). We revisit the theory of normal forms for modal logic and derive a normal form representation for positive modal logic. We also show that every finitely generated free modal and distributive modal algebra axiomatised by equations of rank 1 is a reduct of a temporal algebra. 1
Modal Predicates and Coequations
, 2002
"... We show how coalgebras can be presented by operations and equations. We discuss the basic properties of this presentation and compare it with the usual approach. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We show how coalgebras can be presented by operations and equations. We discuss the basic properties of this presentation and compare it with the usual approach.
Minimal Realization in Bicategories of Automata
 Math. Structures in Computer Science
, 1998
"... The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The objective here is to study reachability, minimization and minimal realization in these bicategories. In this setting the auto ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The objective here is to study reachability, minimization and minimal realization in these bicategories. In this setting the automata are 1cells in contrast with previous studies where they appeared as objects. As a consequence we are able to study the relation of minimization and minimal realization to serial composition of automata using (co)lax (co)monads. We are led to define suitable behaviour categories and prove minimal realization theorems which extend classical results. This work has been supported by NSERC Canada, Italian MURST and the Australian Research Council 1 Introduction Katis, Sabadini, Walters, and Weld have described bicategories equipped with operations of serial and parallel composition, and feedback modelled as, respectively, composition of 1cells, a tensor product and an operation called...