Results 1  10
of
19
Full abstraction for a shared variable parallel language
 In Proceedings, 8th Annual IEEE Symposium on Logic in Computer Science
, 1993
"... We give a new denotational semantics for a shared variable parallel programming language and prove full abstraction: the semantics gives identical meanings to commands if and only if they induce the same partial correctness behavior in all program contexts. The meaning of a command is a set of “tran ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
(Show Context)
We give a new denotational semantics for a shared variable parallel programming language and prove full abstraction: the semantics gives identical meanings to commands if and only if they induce the same partial correctness behavior in all program contexts. The meaning of a command is a set of “transition traces”, which record the ways in which a command may interact with and be affected by its environment. We show how to modify the semantics to incorporate new program constructs, to allow for different levels of granularity or atomicity, and to model fair infinite computation, in each case achieving full abstraction with respect to an appropriate notion of program behavior. 1
Stochastic processes as concurrent constraint programs
 In Symposium on Principles of Programming Languages
, 1999
"... ) Vineet Gupta Radha Jagadeesan Prakash Panangaden y vgupta@mail.arc.nasa.gov radha@cs.luc.edu prakash@cs.mcgill.ca Caelum Research Corporation Dept. of Math. and Computer Sciences School of Computer Science NASA Ames Research Center Loyola UniversityLake Shore Campus McGill University Moffe ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
(Show Context)
) Vineet Gupta Radha Jagadeesan Prakash Panangaden y vgupta@mail.arc.nasa.gov radha@cs.luc.edu prakash@cs.mcgill.ca Caelum Research Corporation Dept. of Math. and Computer Sciences School of Computer Science NASA Ames Research Center Loyola UniversityLake Shore Campus McGill University Moffett Field CA 94035, USA Chicago IL 60626, USA Montreal, Quebec, Canada Abstract This paper describes a stochastic concurrent constraint language for the description and programming of concurrent probabilistic systems. The language can be viewed both as a calculus for describing and reasoning about stochastic processes and as an executable language for simulating stochastic processes. In this language programs encode probability distributions over (potentially infinite) sets of objects. We illustrate the subtleties that arise from the interaction of constraints, random choice and recursion. We describe operational semantics of these programs (programs are run by sampling random choices), deno...
The algebra of stream processing functions
, 1996
"... Dataflow networks are a model of concurrent computation. They consist of a collection of concurrent asynchronous processes which communicate by sending data over FIFO channels. In this paper we study the algebraic structure of the data ow networks and base their semantics on stream processing funct ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Dataflow networks are a model of concurrent computation. They consist of a collection of concurrent asynchronous processes which communicate by sending data over FIFO channels. In this paper we study the algebraic structure of the data ow networks and base their semantics on stream processing functions. The algebraic theory is provided by the calculus of flownomials which gives a unified presentation of regular algebra and iteration theories. The kernel of the calculus is an equational axiomatization called Basic Network Algebra (BNA) for flowgraphs modulo graph isomorphism. We show that the algebra of stream processing functions called SPF (used for deterministic networks) and the algebra of sets of stream processing functions called PSPF (used for nondeterministic networks) are BNA algebras. As a byproduct this shows that both semantic models are compositional. We also identify the additional axioms satisfied by the branching components that correspond to constants in these two algebraic theories. For the deterministic case we study in addition the coarser equivalence relation on networks given by the inputoutput behaviour and provide a correct and complete axiomatization.
Relational Semantics of NonDeterministic Dataflow
, 1997
"... We recast dataflow in a modern categorical light using profunctors as a generalization of relations. The well known causal anomalies associated with relational semantics of indeterminate dataflow are avoided, but still we preserve much of the intuitions of a relational model. The development fit ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
We recast dataflow in a modern categorical light using profunctors as a generalization of relations. The well known causal anomalies associated with relational semantics of indeterminate dataflow are avoided, but still we preserve much of the intuitions of a relational model. The development fits with the view of categories of models for concurrency and the general treatment of bisimulation they provide. In particular it fits with the recent categorical formulation of feedback using traced monoidal categories. The payoffs are: (1) explicit relations to existing models and semantics, especially the usual axioms of monotone IO automata are read off from the definition of profunctors, (2) a new definition of bisimulation for dataflow, the proof of the congruence of which benefits from the preservation properties associated with open maps and (3) a treatment of higherorder dataflow as a biproduct, essentially by following the geometry of interaction programme.
A Simple Generalization of Kahn's Principle to Indeterminate Dataflow Networks
 Semantics for Concurrency, Leicester
, 1990
"... Kahn's principle states that if each process in a dataflow network computes a continuous input/output function, then so does the entire network. Moreover, in that case the function computed by the network is the least fixed point of a continuous functional determined by the structure of the net ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Kahn's principle states that if each process in a dataflow network computes a continuous input/output function, then so does the entire network. Moreover, in that case the function computed by the network is the least fixed point of a continuous functional determined by the structure of the network and the functions computed by the individual processes. Previous attempts to generalize this principle in a straightforward way to "indeterminate" networks, in which processes need not compute functions, have been either too complex or have failed to give results consistent with operational semantics. In this paper, we give a simple, direct generalization of Kahn's fixedpoint principle to a large class of indeterminate dataflow networks, and we prove that results obtained by the generalized principle are in agreement with a natural operational semantics. 1 Introduction Dataflow networks are a parallel programming paradigm in which a collection of concurrently and asynchronously executing s...
Categorical Models for Concurrency: Independence, Fairness and Dataflow
 BRICS DISSERTATION SERIES DS001
, 2000
"... This thesis is concerned with formal semantics and models for concurrent computational systems, that is, systems consisting of a number of parallel computing sequential systems, interacting with each other and the environment. A formal semantics gives meaning to computational systems by describing t ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
This thesis is concerned with formal semantics and models for concurrent computational systems, that is, systems consisting of a number of parallel computing sequential systems, interacting with each other and the environment. A formal semantics gives meaning to computational systems by describing their behaviour in a mathematical model. For concurrent systems the interesting aspect of their computation is often how they interact with the environment during a computation and not in which state they terminate, indeed they may not be intended to terminate at all. For this reason they are often referred to as reactive systems, to distinguish them from traditional calculational systems, as e.g. a program calculating your income tax, for which the interesting behaviour is the answer it gives when (or if) it terminates, in other words the (possibly partial) function it computes between input and output. Church's thesis tells us that regardless of whether we choose the lambda calculus, Turing machines, or almost any modern programming language such as C or Java to describe calculational systems, we are able to describe exactly the same class of functions. However, there is no agreement on observable behaviour for concurrent reactive systems, and consequently there is no correspondent to Church's thesis. A result of this fact is that an overwhelming number of different and often competing notions of observable behaviours, primitive operations, languages and mathematical models for describing their semantics, have been proposed in the litterature on concurrency. The work
Towards a Complete Hierarchy of Compositional Dataflow Models
 IN: PROC. THEORETICAL ASPECTS OF COMPUTER SOFTWARE, LNCS 526
, 1991
"... A dataflow network consists of nodes that communicate by passing data over unbounded FIFO channels. For dataflow networks containing only deterministic nodes, Kahn has presented a simple and elegant semantic model. However, the generalization of this model is not compositional for nondeterministi ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A dataflow network consists of nodes that communicate by passing data over unbounded FIFO channels. For dataflow networks containing only deterministic nodes, Kahn has presented a simple and elegant semantic model. However, the generalization of this model is not compositional for nondeterministic networks. Past work has
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...
Discrete Time Network Algebra for a Semantic Foundation of SDL
, 1997
"... We propose a process algebra model of asynchronous dataflow networks as a semantic foundation for the specification language SDL. The model, which extends a model of network algebra, is close to the concepts around which SDL has been set up. It is able to cover all behavioural aspects of SDL except ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We propose a process algebra model of asynchronous dataflow networks as a semantic foundation for the specification language SDL. The model, which extends a model of network algebra, is close to the concepts around which SDL has been set up. It is able to cover all behavioural aspects of SDL except process creation. More abstract models are derived as well. Jan Bergstra is a Professor of Programming and Software Engineering at the University of Amsterdam and a Professor of Applied Logic at Utrecht University, both in the Netherlands. His research interest is in mathematical aspects of software and system development, in particular in the design of algebras that can contribute to a better understanding of the relevant issues at a conceptual level. He is perhaps best known for his contributions to the field of process algebra. Email: janb@fwi.uva.nl Kees Middelburg is a Senior Research Fellow at UNU/IIST. He is on a two year leave (19961997) from KPN Research and Utrecht University,...
Event structures with persistence
, 2008
"... Increasingly, the style of computation is changing. Instead of one machine running a program sequentially, we have systems with many individual agents running in parallel. The need for mathematical models of such computations is therefore ever greater. There are many models of concurrent computation ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Increasingly, the style of computation is changing. Instead of one machine running a program sequentially, we have systems with many individual agents running in parallel. The need for mathematical models of such computations is therefore ever greater. There are many models of concurrent computations. Such models can, for example, provide a semantics to process calculi and thereby suggest behavioural equivalences between processes. They are also key to the development of automated tools for reasoning about concurrent systems. In this thesis we explore some applications and generalisations of one particular model – event structures. We describe a variety of kinds of morphism between event structures. Each kind expresses a different sort of behavioural relationship. We demonstrate the way in which event structures can model both processes and types of processes by recalling a semantics for Affine HOPLA, a higher order process language. This is given in terms of asymmetric spans of event structures. We show that such spans support a trace construction. This allows the modelling of feedback and suggests a semantics for nondeterministic dataflow processes in terms of spans. The semantics given is shown to be consistent with Kahn’s fixed point construction when we consider spans modelling deterministic processes. A generalisation of event structures to include persistent events is proposed. Based on previously described morphisms between classical event structures, we define several categories of event structures with persistence. We show that, unlike for the corresponding categories of classical event structures, all are isomorphic to Kleisli categories of monads