Results 1  10
of
17
Abstract behavior types: A foundation model for components and their composition
 SCIENCE OF COMPUTER PROGRAMMING
, 2003
"... ..."
(Show Context)
A Coinductive Calculus of Component Connectors
, 2002
"... Reo is a recently introduced channelbased coordination model, wherein complex coordinators, called connectors, are compositionally built out of simpler ones. Using a more liberal notion of a channel, Reo generalises existing dataflow networks. In this paper, we present a simple and transparent sema ..."
Abstract

Cited by 64 (26 self)
 Add to MetaCart
(Show Context)
Reo is a recently introduced channelbased coordination model, wherein complex coordinators, called connectors, are compositionally built out of simpler ones. Using a more liberal notion of a channel, Reo generalises existing dataflow networks. In this paper, we present a simple and transparent semantical model for Reo, in which connectors are relations on timed data streams. Timed data streams constitute a characteristic of our model and consist of twin pairs of separate data and time streams. Furthermore, coinduction is our main reasoning principle and we use it to prove properties such as connector equivalence.
Towards a calculus of statebased software components
 Journal of Universal Computer Science
, 2003
"... Abstract: This paper introduces a calculus of statebased software components modelled as concrete coalgebras for some Set endofunctors, with specified initial conditions. The calculus is parametrized by a notion of behaviour, introduced as a strong (usually commutative) monad. The proposed componen ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
Abstract: This paper introduces a calculus of statebased software components modelled as concrete coalgebras for some Set endofunctors, with specified initial conditions. The calculus is parametrized by a notion of behaviour, introduced as a strong (usually commutative) monad. The proposed component model and calculus are illustrated through the characterisation of a particular class of components, classified as separable, which includes the ones arising in the socalled model oriented approach to systems’ design.
On Refinement of Generic Software Components
 In 10th Int. Conf. Algebraic Methods and Software Technology (AMAST
, 2003
"... This paper characterises refinement of statebased software components modelled as concrete coalgebras for some Set endofunctors. The resulting calculus is parametrized by a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and trans ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
(Show Context)
This paper characterises refinement of statebased software components modelled as concrete coalgebras for some Set endofunctors. The resulting calculus is parametrized by a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and transform) statebased software designs.
Coalgebraic Components in a ManySorted Microcosm
"... Abstract. The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe compositional behavior systematically. Here we further illustrate the usefulness of the approach by extending it to a ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Abstract. The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe compositional behavior systematically. Here we further illustrate the usefulness of the approach by extending it to a manysorted setting. Then we can show that the coalgebraic component calculi of Barbosa are examples, with compositionality of behavior following from microcosm structure. The algebraic structure on these coalgebraic components corresponds to variants of Hughes’ notion of arrow, introduced to organize computations in functional programming. 1
Coinductive Interpreters for Process Calculi
 In Sixth International Symposium on Functional and Logic Programming, volume 2441 of LNCS
, 2002
"... This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the dierent ingredients present in the design of any such calculi. In partic ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the dierent ingredients present in the design of any such calculi. In particular structural aspects of the underlying behaviour model become clearly separated from the interaction structure which de nes the synchronisation discipline. The approach is illustrated by the detailed development in Charity of an interpreter for a family of process languages.
Coalg_{KPF}: Towards a Coalgebraic Calculus for componentBased Systems
"... Coalgebras of Kripke Polynomial Functors have been widely used in modelling various kinds of systems. In this paper, we give a category Coalg KPF which consists of coalgebras of KPFs. Then we present a set of constructions like sequential and parallel composition in a subcategory of Coalg KPF for a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Coalgebras of Kripke Polynomial Functors have been widely used in modelling various kinds of systems. In this paper, we give a category Coalg KPF which consists of coalgebras of KPFs. Then we present a set of constructions like sequential and parallel composition in a subcategory of Coalg KPF for a restricted family of KPFs by exploiting the canonical operations in category theory. A family of algebraic laws for the properties being satisfied by these operations is provided. Sun Meng is a Fellow at UNU/IIST on leave from the School of Mathematical Science of Beijing University, China, where he is a Ph.D candidate. His research interest include category theory, coalgebra theory, ObjectOriented method, formal method in software development, and formal semantics for modeling languages. His email address is sm@iist.unu.edu.
Process Calculi à la BirdMeertens
, 2001
"... This paper is an attempt to apply the reasoning principles and calculational style underlying the socalled BirdMeertens formalism to the design of process calculi, parametrized by a behaviour model. In particular, basically equational and pointfree proofs of process properties are given, relying o ..."
Abstract
 Add to MetaCart
This paper is an attempt to apply the reasoning principles and calculational style underlying the socalled BirdMeertens formalism to the design of process calculi, parametrized by a behaviour model. In particular, basically equational and pointfree proofs of process properties are given, relying on the universal characterisation of anamorphisms and therefore avoiding the explicit construction of bisimulations. The developed calculi can be directly implemented on a functional language supporting coinductive types, which provides a convenient way to prototype processes and assess alternative design decisions.
Traces for Coalgebraic Components
 MATH. STRUCT. IN COMP. SCIENCE
, 2010
"... This paper contributes a feedback operator, in the form of a monoidal trace, to the theory of coalgebraic, statebased modelling of components. The feedback operator on components is shown to satisfy the trace axioms of Joyal, Street and Verity. We employ McCurdy’s tube diagrams, an extension of sta ..."
Abstract
 Add to MetaCart
This paper contributes a feedback operator, in the form of a monoidal trace, to the theory of coalgebraic, statebased modelling of components. The feedback operator on components is shown to satisfy the trace axioms of Joyal, Street and Verity. We employ McCurdy’s tube diagrams, an extension of standard string diagrams for monoidal categories, for representing and manipulating component diagrams. The microcosm principle then yields a canonical “inner” traced monoidal structure on the category of resumptions (elements of final coalgebras / components). This generalises an observation by Abramsky, Haghverdi and Scott.
A Coalgebraic Calculus for Component Based Systems ∗
"... In this paper we describe the coalgebraic models for statebased software components and componentbased systems. The behaviour patterns of components are specified by strong monads. A family of operators for combining components based on the category of coalgebras are defined and a set of algebraic ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper we describe the coalgebraic models for statebased software components and componentbased systems. The behaviour patterns of components are specified by strong monads. A family of operators for combining components based on the category of coalgebras are defined and a set of algebraic laws are also presented to specify the properties being satisfied by these operators. 1