Results 1 
8 of
8
Enhanced Coalgebraic Bisimulation
, 2013
"... We present a systematic study of bisimulationupto techniques for coalgebras. This enhances the bisimulation proof method for a large class of state based systems, including labelled transition systems but also stream systems and weighted automata. Our approach allows for compositional reasoning ab ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
We present a systematic study of bisimulationupto techniques for coalgebras. This enhances the bisimulation proof method for a large class of state based systems, including labelled transition systems but also stream systems and weighted automata. Our approach allows for compositional reasoning about the soundness of enhancements. Applications include the soundness of bisimulation up to bisimilarity, up to equivalence and up to congruence. All in all, this gives a powerful and modular framework for simplified coinductive proofs of equivalence. 1.
Coalgebraic characterizations of contextfree languages
 Logical Methods in Computer Science
"... Abstract. In this article, we provide three coalgebraic characterizations of the class of contextfree languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying outputderivative pairs. Final coalgebra semantics then gives an interpretation fu ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In this article, we provide three coalgebraic characterizations of the class of contextfree languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying outputderivative pairs. Final coalgebra semantics then gives an interpretation function into the final coalgebra of all languages with the usual output and derivative operations. The first characterization is based on systems, where each derivative is given as a finite language over the set of nonterminals; the second characterization on systems where derivatives are given as elements of a termalgebra; and the third characterization is based on adding coalgebraic structure to a class of closed (unique) fixed point expressions. We prove equivalences between these characterizations, discuss the generalization from languages to formal power series, as well as the relationship to the generalized powerset construction. 1.
Stream Differential Equations: Specification Formats and Solution Methods
, 2014
"... Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream differential equations are a coinductive method for specifying streams and stream operations, and their theory has been dev ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream differential equations are a coinductive method for specifying streams and stream operations, and their theory has been developed in many papers over the past two decades. In this paper we present a survey of the many results in this area. Our focus is on the classification of different formats of stream differential equations, their solution methods, and the classes of streams they can define. Moreover, we describe in detail the connection between the socalled syntactic solution method and abstract GSOS.
On language equations and grammar coalgebras for contextfree languages?
"... Introduction. In [3], a coalgebraic presentation of contextfree grammars and languages was given based on behavioural differential equation, yielding final coalgebra semantics via the functor 2 × (−)A of deterministic automata. There, the correspondence was given via the wellknown notion of deriva ..."
Abstract
 Add to MetaCart
(Show Context)
Introduction. In [3], a coalgebraic presentation of contextfree grammars and languages was given based on behavioural differential equation, yielding final coalgebra semantics via the functor 2 × (−)A of deterministic automata. There, the correspondence was given via the wellknown notion of derivations in a grammar. Another classical approach to the semantics of contextfree gram
A completeness result for finite λbisimulations
"... Abstract. We show that finite λbisimulations (closely related to bisimulations up to context) are sound and complete for finitely generated λbialgebras for distributive laws λ of a monad T on Set over an endofunctor F on Set, such that F preserves weak pullbacks and finitely generated Talgebras ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We show that finite λbisimulations (closely related to bisimulations up to context) are sound and complete for finitely generated λbialgebras for distributive laws λ of a monad T on Set over an endofunctor F on Set, such that F preserves weak pullbacks and finitely generated Talgebras are closed under taking kernel pairs. This result is used to infer the decidability of weighted language equivalence when the underlying semiring is a subsemiring of an effectively presentable Noetherian semiring. These results are closely connected to [ÉM10] and [BMS13], concerned with respectively the decidability and axiomatization of weighted language equivalence w.r.t. Noetherian semirings. 1
1 Errata 1. p. 4, fourth line above Section 1.2: ‘abstract GSOS format, based on the SOS format
"... from [TP97] ’ should be ‘abstract GSOS format introduced in [TP97], generalizing the (concrete) GSOS format from [BIM95]’. 2. p. 5, point 3 of the enumeration in Subsection 1.2.2: ‘KleeneSchützenbergerEilenberg theorem ’ should be ‘KleeneSchützenberger theorem’. 3. p. 7, second paragraph of Sec ..."
Abstract
 Add to MetaCart
(Show Context)
from [TP97] ’ should be ‘abstract GSOS format introduced in [TP97], generalizing the (concrete) GSOS format from [BIM95]’. 2. p. 5, point 3 of the enumeration in Subsection 1.2.2: ‘KleeneSchützenbergerEilenberg theorem ’ should be ‘KleeneSchützenberger theorem’. 3. p. 7, second paragraph of Section 1.3: ‘due to Kleene, Schützenberger, and Eilenberg’ should be ‘due to Kleene and Schützenberger’. 4. p. 7, l.5: ‘bisimulations up to linear combinations ’ should be ‘bisimulations up to linearity ’. 5. p. 7, l.3: ‘linear weighted simulations ’ should be ‘linear weighted bisimulations’. 6. p. 11, l. 5: ‘and have been used’, should be ‘which have been used’. 7. p. 11, last paragraph: ‘KleeneSchützenbergerEilenberg theorem ’ should be ‘Kleene
COALGEBRAIC CHARACTERIZATIONS OF CONTEXTFREE LANGUAGES
, 2012
"... Vol. 9(3:14)2013, pp. 1–39 www.lmcsonline.org ..."
(Show Context)