In this report we study the connection between two well known models for interactive systems. Reactive Systems à la Leifer and Milner allow to derive an interactive semantics from a reduction semantics guaranteeing, under rather restrictive conditions, thecompositionality of the abstract semantics (bisimilarity). Universal Coalgebra provides a categorical framework where bisimilarity can be characterized as final semantics, i.e., as the unique morphism to the final coalgebra. Moreover, if lifting a coalgebra to a structured setting is possible, then bisimilarity is compositional with respect to the lifted structure. Here we show that for every reactive system we can build a coalgebra. Further, if bisimilarity is compositional in the reactiv...
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transiti...
Reactive systems (RSs) represent a meta-framework aimed at deriving behavioral congruences for those...
International audienceThe operational semantics of interactive systems is usually described by label...
In this paper we investigate the connection between two well known models for interactive systems. R...
AbstractThe semantics of process calculi has traditionally been specified by labelled transition sys...
Reactive systems \`a la Leifer and Milner, an abstract categorical frameworkfor rewriting, provide a...
AbstractIn this paper we address the issue of providing a structured coalgebra presentation of trans...
AbstractThe semantics of process calculi has traditionally been specified by labelled transition sys...
The aim of this paper is to investigate the relation between two models of concurrent systems: tile ...
The semantics of process calculi has traditionally been specified by labelled transition systems (LT...
In this paper we address the issue of providing a structured coalgebra presentation of transition sy...
In this paper we address the issue of providing a structured coalgebra presentation of transition sy...
AbstractLabelled transition systems admit different but equivalent characterizations either as relat...
One of the research areas of great importance in Computer Science is the study of the semantics of c...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transiti...
Reactive systems (RSs) represent a meta-framework aimed at deriving behavioral congruences for those...
International audienceThe operational semantics of interactive systems is usually described by label...
In this paper we investigate the connection between two well known models for interactive systems. R...
AbstractThe semantics of process calculi has traditionally been specified by labelled transition sys...
Reactive systems \`a la Leifer and Milner, an abstract categorical frameworkfor rewriting, provide a...
AbstractIn this paper we address the issue of providing a structured coalgebra presentation of trans...
AbstractThe semantics of process calculi has traditionally been specified by labelled transition sys...
The aim of this paper is to investigate the relation between two models of concurrent systems: tile ...
The semantics of process calculi has traditionally been specified by labelled transition systems (LT...
In this paper we address the issue of providing a structured coalgebra presentation of transition sy...
In this paper we address the issue of providing a structured coalgebra presentation of transition sy...
AbstractLabelled transition systems admit different but equivalent characterizations either as relat...
One of the research areas of great importance in Computer Science is the study of the semantics of c...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transiti...
Reactive systems (RSs) represent a meta-framework aimed at deriving behavioral congruences for those...
International audienceThe operational semantics of interactive systems is usually described by label...