Results 1  10
of
14
Abstract behavior types: A foundation model for components and their composition
 SCIENCE OF COMPUTER PROGRAMMING
, 2003
"... ..."
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 58 (25 self)
 Add to MetaCart
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.
Behavioural Differential Equations: A Coinductive Calculus of Streams, Automata, and Power Series
, 2000
"... Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduct ..."
Abstract

Cited by 50 (17 self)
 Add to MetaCart
Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive definitions take the shape of what we have called behavioural differential equations, after Brzozowski's notion of input derivative. A calculus is developed for coinductive reasoning about all of the afore mentioned structures, closely resembling (and at times generalising) calculus from classical analysis. 2000 Mathematics Subject Classification: 68Q10, 68Q55, 68Q85 1998 ACM Computing Classification System: F.1, F.3 Keywords & Phrases: Coalgebra, automaton, finality, coinduction, stream, formal language, formal power series, differential equation, input derivative, behaviour, semiring, maxplus algebra 1 Contents 1 Introductio...
A coinductive calculus of streams
, 2005
"... We develop a coinductive calculus of streams based on the presence of a final coalgebra structure on the set of streams (infinite sequences of real numbers). The main ingredient is the notion of stream derivative, which can be used to formulate both coinductive proofs and definitions. In close analo ..."
Abstract

Cited by 25 (9 self)
 Add to MetaCart
We develop a coinductive calculus of streams based on the presence of a final coalgebra structure on the set of streams (infinite sequences of real numbers). The main ingredient is the notion of stream derivative, which can be used to formulate both coinductive proofs and definitions. In close analogy to classical analysis, the latter are presented as behavioural differential equations. A number of applications of the calculus are presented, including difference equations, analytical differential equations, continued fractions, and some problems from discrete mathematics and combinatorics.
Specifying software connectors
 1st International Colloquium on Theorectical Aspects of Computing (ICTAC’04
, 2004
"... Abstract. Orchestrating software components, often independently supplied, has assumed a central role in software construction. Actually, as relevant as components themselves, are the ways in which they can be put together to interact and cooperate in order to achieve some common goal. Such is the r ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Abstract. Orchestrating software components, often independently supplied, has assumed a central role in software construction. Actually, as relevant as components themselves, are the ways in which they can be put together to interact and cooperate in order to achieve some common goal. Such is the role of socalled software connectors: external coordination devices which ensure both the flow of data and synchronization restrictions within a component’s network. This paper introduces a new model for software connectors, based on relations extended in time, which aims to provide support for light intercomponent dependency and effective external control. 1
F.S.: Coordination and composition in multiagent systems
 In: Proceedings of the 4rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), ACM
, 2005
"... In this paper we describe a channelbased exogenous coordination language, called Reo, and discuss its application to multiagent systems. Reo supports a specific notion of compositionality for multiagent systems that enables the composition and coordination of both individual agents as well as mul ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this paper we describe a channelbased exogenous coordination language, called Reo, and discuss its application to multiagent systems. Reo supports a specific notion of compositionality for multiagent systems that enables the composition and coordination of both individual agents as well as multiagent systems. Accordingly, a multiagent system consists of a set of individual and/or multiagent systems whose collective behavior is coordinated by a Reo expression. This coordination language can be used to specify and implement the organization of multiagent systems and their dynamic reconfiguration during system run. Categories and Subject Descriptors I.2.11 [Distributed Artificial Intelligence]: Muliagent
Coinductive Counting With Weighted Automata
, 2002
"... A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation; ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation; (3) the reduced automaton is used to compute an expression (in terms of stream constants and operators) that represents the stream of all counts.
Induction, Coinduction, and Adjoints
, 2002
"... We investigate the reasons for which the existence of certain right adjoints implies the existence of some nal coalgebras, and viceversa. In particular we prove and discuss the following theorem which has been partially available in the literature: let F a G be a pair of adjoint functors, and supp ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We investigate the reasons for which the existence of certain right adjoints implies the existence of some nal coalgebras, and viceversa. In particular we prove and discuss the following theorem which has been partially available in the literature: let F a G be a pair of adjoint functors, and suppose that an initial algebra F (X) of the functor H(Y ) = X + F (Y ) exists; then a right adjoint G(X) to F (X) exists if and only if a nal coalgebra G(X) of the functor K(Y ) = X G(Y ) exists. Motivated by the problem of understanding the structures that arise from initial algebras, we show the following: if F is a left adjoint with a certain commutativity property, then an initial algebra of H(Y ) = X + F (Y ) generates a subcategory of functors with inductive types where the functorial composition is constrained to be a Cartesian product.
An application of stream calculus to signal flow graphs. Lecture
"... The present paper can be seen as an exercise in the author’s stream calculus [Rut01] and gives a new proof for an existing result about stream circuits. Such circuits are also known under the name of signal flow graphs, and are built from (scalar) multipliers, copiers (fanout), adders (elementwise ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The present paper can be seen as an exercise in the author’s stream calculus [Rut01] and gives a new proof for an existing result about stream circuits. Such circuits are also known under the name of signal flow graphs, and are built from (scalar) multipliers, copiers (fanout), adders (elementwise sum), and registers (here: oneelement memory cells, aka delays). Because of the presence of memory, the inputoutput behaviour of these circuits is best described in terms of functions from streams to streams (of real numbers). The main statement of this paper (Theorem 6), gives a characterization of the inputoutput behaviour of finite stream circuits in terms of socalled rational streams. It is wellknown in the world of signal processing, where it is formulated and proved in terms of the Ztransform (a discrete version of the Laplace transform) and transfer functions (see for instance [Lah98, p.694]). These transforms are used as representations of streams of (real or complex) numbers. As a consequence, one has to deal with two different worlds, and some care is required when moving from the one to the other. In contrast, we use stream calculus to formulate and obtain
Incremental patternbased coinduction for process algebra and its Isabelle formalization
"... Abstract. We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building incrementally an a priori unknown bisimulation, and patternbased, in that it works on equalities of process patt ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building incrementally an a priori unknown bisimulation, and patternbased, in that it works on equalities of process patterns (i.e., universally quantified equations of process terms containing process variables), thus taking advantage of equational reasoning in a “circular ” manner, inside coinductive proof loops. The proof system has been formalized and proved sound in Isabelle/HOL. 1