Results 1 
7 of
7
NonDeterministic Kleene Coalgebras
"... In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic finite automata) and Miln ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic finite automata) and Milner (on regular behaviours and finite labelled transition systems), and includes many other systems such as Mealy and Moore machines.
Observational Ultraproducts of Polynomial Coalgebras
, 2002
"... Coalgebras of polynomial functors constructed from sets of observable elements have been found useful in modelling various kinds of data types and statetransition systems. ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Coalgebras of polynomial functors constructed from sets of observable elements have been found useful in modelling various kinds of data types and statetransition systems.
A modal proof theory for final polynomial coalgebras. Theoret
 Comput. Sci
"... An infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maxim ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
An infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maximal ” sets of formulas that have natural syntactic closure properties. The syntax of these logics extends that of previously developed modal languages for polynomial coalgebras by adding formulas that express the “termination ” of certain functions induced by transition paths. A completeness theorem is proven for the logic of functors which have the Lindenbaum property that every consistent set of formulas has a maximal extension. This property is shown to hold if if the deducibility relation is generated by countably many inference rules. A counterexample to completeness is also given. This is a polynomial functor that is not Lindenbaum: it has an uncountable set of formulas that is deductively consistent but has no maximal extension and is unsatisfiable, even though all of its countable subsets are satisfiable. 1
Enlargements of Polynomial Coalgebras
 Proceedings of the 7th and 8th Asian Logic Conferences
"... This paper continues a series [GolOlc,a,b] of articles on the equational logic and model theory of coalgebras for certain functors T: Set  Set on the category of sets. A Tcoalgebra is a pair (A, () comprising a set A, thought of as a set of "states", and a function : A > TA called th ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This paper continues a series [GolOlc,a,b] of articles on the equational logic and model theory of coalgebras for certain functors T: Set  Set on the category of sets. A Tcoalgebra is a pair (A, () comprising a set A, thought of as a set of "states", and a function : A > TA called the transition structure. We study the case of functors T that are polynomial, i.e. constructed from constantvalued functors and the identity functor by forming products, coproducts, and exponential functors with constant exponent. Many data structures and systems of interest to computer science  such as lists, streams, trees, automata, and classes in objectoriented programming languages  can be modelled as coalgebras for polynomial functors [Rei95, Jac96, Rut95, Rut00]. This has motivated the development of a theory of "universal coalgebra" [Rut95, Rut00], by analogy with, and categorically dual to, the study of abstract algebras
Kleene Coalgebra  an overview
"... Coalgebras provide a uniform framework for the study of dynamical systems, including several types of automata. The coalgebraic view on systems has recently been proved relevant by the development of a number of expression calculi which generalize classical results by Kleene, on regular expressions, ..."
Abstract
 Add to MetaCart
Coalgebras provide a uniform framework for the study of dynamical systems, including several types of automata. The coalgebraic view on systems has recently been proved relevant by the development of a number of expression calculi which generalize classical results by Kleene, on regular expressions, and by Kozen, on Kleene algebra. This note contains an overview of the motivation and results of the generic framework we developed – Kleene Coalgebra – to uniformly derive the aforementioned calculi. We present an historical overview of work on regular expressions and axiomatizations, as well a discussion of related work. We show applications of the framework to three types of probabilistic systems: simple Segala, stratified and PnueliZuck.
A Modal Proof Theory for Polynomial Coalgebras
, 2004
"... The abstract mathematical structures known as coalgebras are of increasing interest in computer science for their use in modelling certain types of data structures and programs. Traditional algebraic methods describe objects in terms of their construction, whilst coalgebraic methods describe object ..."
Abstract
 Add to MetaCart
The abstract mathematical structures known as coalgebras are of increasing interest in computer science for their use in modelling certain types of data structures and programs. Traditional algebraic methods describe objects in terms of their construction, whilst coalgebraic methods describe objects in terms of their decomposition, or observational behaviour. The latter techniques are particularly useful for modelling infinite data structures and providing semantics for objectoriented programming languages, such as Java. There have been many different logics developed for reasoning about coalgebras of particular functors, most involving modal logic. We define a modal logic for coalgebras of polynomial functors, extending Rößiger’s logic [33], whose proof theory was limited to using finite constant sets, by adding an operator from Goldblatt [11]. From the semantics we define a canonical coalgebra that provides a natural construction of a final coalgebra for the relevant functor. We then give an infinitary axiomatization and syntactic proof relation that is sound and complete for functors constructed from countable constant sets. Acknowledgments I am deeply indebted to my supervisor, Professor Robert Goldblatt, for pointing me in the right direction and keeping my wheels on the tracks. His mathematical advice is the best anyone could hope for. I would like to thank Ranald Clouston for many discussions on logic and life in general. This thesis (and my life in general) are the better for them. I would like to thank all the people at the Centre for Logic, Language and Computation at Victoria who have taught me through my undergraduate years for introducing me to the exciting world of logic. Financially, I have been supported by a scholarship from the Logic and Computation programme of the New Zealand Institute for Mathematics and its Applications. I am grateful for the hospitality of the Institute for
Software ENgineering Regular expressions for polynomial coalgebras
, 2007
"... CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ..."
Abstract
 Add to MetaCart
CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms.