Results 1  10
of
13
A Survey Of Stream Processing
, 1995
"... Stream processing is a term that is used widely in the literature to describe a variety of systems. We present an overview of the historical development of stream processing and a detailed discussion of the different languages and techniques for programming with streams that can be found in the lite ..."
Abstract

Cited by 119 (2 self)
 Add to MetaCart
Stream processing is a term that is used widely in the literature to describe a variety of systems. We present an overview of the historical development of stream processing and a detailed discussion of the different languages and techniques for programming with streams that can be found in the literature. This includes an analysis of dataflow, specialized functional and logic programming with streams, reactive systems, signal processing systems, and the use of streams in the design and verification of hardware. The aim of this survey is an analysis of the development of each of these specialized topics to determine if a general theory of stream processing has emerged. As such, we discuss and classify the different classes of stream processing systems found in the literature from the perspective of programming primitives, implementation techniques, and computability issues, including a comparison of the semantic models that are used to formalize stream based computation.
An Algebraic Presentation of Term Graphs, via GSMonoidal Categories
 Applied Categorical Structures
, 1999
"... . We present a categorical characterisation of term graphs (i.e., finite, directed acyclic graphs labeled over a signature) that parallels the wellknown characterisation of terms as arrows of the algebraic theory of a given signature (i.e., the free Cartesian category generated by it). In particula ..."
Abstract

Cited by 39 (25 self)
 Add to MetaCart
(Show Context)
. We present a categorical characterisation of term graphs (i.e., finite, directed acyclic graphs labeled over a signature) that parallels the wellknown characterisation of terms as arrows of the algebraic theory of a given signature (i.e., the free Cartesian category generated by it). In particular, we show that term graphs over a signature \Sigma are onetoone with the arrows of the free gsmonoidal category generated by \Sigma. Such a category satisfies all the axioms for Cartesian categories but for the naturality of two transformations (the discharger ! and the duplicator r), providing in this way an abstract and clear relationship between terms and term graphs. In particular, the absence of the naturality of r and ! has a precise interpretation in terms of explicit sharing and of loss of implicit garbage collection, respectively. Keywords: algebraic theories, directed acyclic graphs, gsmonoidal categories, symmetric monoidal categories, term graphs. Mathematical Subject Clas...
An Inductive View of Graph Transformation
 In Workshop on Algebraic Development Techniques
, 1998
"... . The dynamic behavior of rulebased systems (like term rewriting systems [24], process algebras [27], and so on) can be traditionally determined in two orthogonal ways. Either operationally, in the sense that a way of embedding a rule into a state is devised, stating explicitly how the result i ..."
Abstract

Cited by 34 (13 self)
 Add to MetaCart
(Show Context)
. The dynamic behavior of rulebased systems (like term rewriting systems [24], process algebras [27], and so on) can be traditionally determined in two orthogonal ways. Either operationally, in the sense that a way of embedding a rule into a state is devised, stating explicitly how the result is built: This is the role played by (the application of) a substitution in term rewriting. Or inductively, showing how to build the class of all possible reductions from a set of basic ones: For term rewriting, this is the usual definition of the rewrite relation as the minimal closure of the rewrite rules. As far as graph transformation is concerned, the operational view is by far more popular: In this paper we lay the basis for the orthogonal view. We first provide an inductive description for graphs as arrows of a freely generated dgsmonoidal category. We then apply 2categorical techniques, already known for term and term graph rewriting [29, 7], recasting in this framework the...
Rewriting On Cyclic Structures: Equivalence Between The Operational And The Categorical Description
, 1999
"... . We present a categorical formulation of the rewriting of possibly cyclic term graphs, based on a variation of algebraic 2theories. We show that this presentation is equivalent to the wellaccepted operational definition proposed by Barendregt et aliibut for the case of circular redexes, fo ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
. We present a categorical formulation of the rewriting of possibly cyclic term graphs, based on a variation of algebraic 2theories. We show that this presentation is equivalent to the wellaccepted operational definition proposed by Barendregt et aliibut for the case of circular redexes, for which we propose (and justify formally) a different treatment. The categorical framework allows us to model in a concise way also automatic garbage collection and rules for sharing/unsharing and folding/unfolding of structures, and to relate term graph rewriting to other rewriting formalisms. R'esum'e. Nous pr'esentons une formulation cat'egorique de la r'e'ecriture des graphes cycliques des termes, bas'ee sur une variante de 2theorie alg'ebrique. Nous prouvons que cette pr'esentation est 'equivalente `a la d'efinition op'erationnelle propos'ee par Barendregt et d'autres auteurs, mais pas dons le cas des radicaux circulaires, pour lesquels nous proposons (et justifions formellem...
Normal Forms for Partitions and Relations
 Recent Trends in Algebraic Development Techniques, volume 1589 of Lect. Notes in Comp. Science
, 1999
"... Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, treelike presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
(Show Context)
Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, treelike presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" field, but an exhaustive comparison between them is difficult because their presentations can be quite dissimilar. This work is a first step towards a unified view, which is able to recast all those formalisms into a more general one, where they can be easily compared. We introduce a general schema for describing a characteristic normal form for many algebraic formalisms, and show that those normal forms can be thought of as arrows of suitable concrete monoidal categories.
Algebra of Networks  Modeling simple networks, as well as complex interactive systems
 In: Proof and SystemReliability, Proc. Marktoberdorf Summer School 2001, Kluwer (2002), 4978. A., Sofronia A., Stefanescu G.: Highlevel Structured Interactive
"... The rst part of the paper contains an overview of Network Algebra (NA) book [35]. The second part introduces nite interactive systems as an abstract mathematical model of agents' behaviour and their interaction. ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
The rst part of the paper contains an overview of Network Algebra (NA) book [35]. The second part introduces nite interactive systems as an abstract mathematical model of agents' behaviour and their interaction.
Rewriting on Cyclic Structures
 EXTENDED ABSTRACT IN FIXED POINTS IN COMPUTER SCIENCE, SATELLITE WORKSHOP OF MFCS'98
, 1998
"... We present a categorical formulation of the rewriting of possibly cyclic term graphs, and the proof that this presentation is equivalent to the wellaccepted operational definition proposed in [3]  but for the case of circular redexes, for which we propose (and justify formally) a different treatm ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We present a categorical formulation of the rewriting of possibly cyclic term graphs, and the proof that this presentation is equivalent to the wellaccepted operational definition proposed in [3]  but for the case of circular redexes, for which we propose (and justify formally) a different treatment. The categorical framework, based on suitable 2categories, allows to model also automatic garbage collection and rules for sharing/unsharing and folding/unfolding of structures. Furthermore, it can be used for defining various extensions of term graph rewriting, and for relating it to other rewriting formalisms.
Network Algebra for Asynchronous Dataflow
, 1997
"... Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory of networks, called BNA (Basic Network Algebra), is presented. BNA, which is essentially a part of the algebra of flownomials, captures the basic algebraic prop ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory of networks, called BNA (Basic Network Algebra), is presented. BNA, which is essentially a part of the algebra of flownomials, captures the basic algebraic properties of networks. For asynchronous dataflow networks, additional constants and axioms are given; and a corresponding process algebra model is introduced. This process algebra model is compared with previous models for asynchronous dataflow. Keywords & Phrases: dataflow networks, network algebra, process algebra, asynchronous dataflow, feedback, merge anomaly, history models, oracle based models, trace models. 1994 CR Categories: F.1.1, F.1.2, F.3.2., D.1.3., D.3.1. This paper is an abridged version of [1]. The full version covers synchronous dataflow networks as well. y Partially supported by ESPRIT BRA 8533 (NADA) and ESPRIT BRA 6454 (CONFER). x On leave (19961997) at Unit...
Stream Processing I: A Survey
, 1995
"... Stream processing is a term that is used widely in the literature to describe a variety of systems. We present an overview of the historical development of stream processing and a detailed discussion of the different languages and techniques for programming with streams that can be found in the lite ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Stream processing is a term that is used widely in the literature to describe a variety of systems. We present an overview of the historical development of stream processing and a detailed discussion of the different languages and techniques for programming with streams that can be found in the literature. This includes an analysis of reactive systems, specialized logic and functional programming, dataflow and the use of streams in the design and verification of hardware. In particular, we discuss and classify stream processing techniques from the perspective of programming primitives, implementation techniques, and computability issues. This includes a comparison of the different semantic models that are used to formalize stream based computation. 1 INTRODUCTION 2 1 Introduction Within computer science the term stream processing is used generically to refer to the study of a number of disparate systems. For example, dataflow systems, reactive systems, synchronous concurrent algorit...
Network Algebra for Synchronous and Asynchronous Dataflow
"... Network algebra (NA) is proposed as a uniform algebraic framework for the description (and analysis) of data ow networks. The core of this algebraic setting is provided by an equational theory called Basic Network Algebra (BNA). It constitutes a selection of primitives and identities from the algebr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Network algebra (NA) is proposed as a uniform algebraic framework for the description (and analysis) of data ow networks. The core of this algebraic setting is provided by an equational theory called Basic Network Algebra (BNA). It constitutes a selection of primitives and identities from the algebra of flownomials due to [Ste86] and [CaS88&89]. Both synchronous and asynchronous data ow networks are then investigated from the viewpoint of network algebra. To this end the NA primitives are defined such that the identities of BNA hold. These axioms are particularly strict about the role of the connections, which will be called flows of data. We describe three interpretations of the connections that satisfy the BNA identities: minimal stream delayers, stream delayers and stream retimers. Each of the above possibilities leads to a class of data ow networks: synchronous data ow networks, asynchronous data ow networks and fully asynchronous data ow networks, respectively. For each case stream transformer and process algebra models are introduced and compared.