An Algebra of Data Flows

Authors:
Józef Winkowski
Affiliations:
(Correspd.) Instytut Podstaw Informatyki PAN, Ordona 21, 01-237 Warszawa, Poland. wink@ipipan.waw.pl
Venue:
Fundamenta Informaticae
Year:
2000

Citing 8
Cited 0

A fixpoint semantics for nondeterministic data flow

Journal of the ACM (JACM)
Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends

Current trends in concurrency. Overviews and tutorials
Event structures

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
An algebra of processes

Journal of Computer and System Sciences
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Event Structure Semantics for CCS and Related Languages

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Scenarios: A Model of Non-Determinate Computation

Proceedings of the International Colloquium on Formalization of Programming Concepts
K-density, N-density and finiteness properties

Proceedings of the European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algebra of processes is proposed in which processes are modelled in terms of data rather than events. Structures representing processes are similar to the labelled event structures of Winskel (1982), but they denote flows of data. For processes represented in such a way operations similar to those of CCS (the Calculus of Communicating Systems as developed by Milner (1980)) are defined and their fundamental properties are stated.