Results 11  20
of
36
Causality for Mobile Processes
 In Proceedings of ICALP'95, LNCS 944
, 1995
"... Abstract. We study causality in the ßcalculus. Our notion of causality combines the dependencies given by the syntactic structure of processes with those originated by passing names. It turns out that two transitions not causally related may although occur in a fixed ordering in any computation, i. ..."
Abstract

Cited by 29 (18 self)
 Add to MetaCart
(Show Context)
Abstract. We study causality in the ßcalculus. Our notion of causality combines the dependencies given by the syntactic structure of processes with those originated by passing names. It turns out that two transitions not causally related may although occur in a fixed ordering in any computation, i.e., ßcalculus may express implicitly a priority between actions. Our causality relation still induces the same partial order of transitions for all the computations that are obtained by shuffling transitions that are concurrent (= related neither by causality nor by priority). The presentation takes advantage from a parametric definition of process behaviour that highlights the essence of the topic. All the results on bisimulation based equivalences, congruences, axiomatizations and logics are taken (almost) for free from the interleaving theory. 1 Introduction The study of the behaviour of a distributed system may benefit from knowledge on the causal relation between its events. For examp...
Composing Processes
, 1996
"... We present a theory of types for concurrency based on a simple notion of typed algebras, and discuss its applications. The basic idea is to determine a partial algebra of processes by a partial algebra of types, thus controlling process composability, just as types in a typed applicative structure [ ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
We present a theory of types for concurrency based on a simple notion of typed algebras, and discuss its applications. The basic idea is to determine a partial algebra of processes by a partial algebra of types, thus controlling process composability, just as types in a typed applicative structure [25] determine composability of elements of the underlying applicative structure. A class of typed algebras with a simple operator for process composition are introduced, which are shown to encompass a wide range of type disciplines for processes, placing extant theories such as Milner's sorting [22] and Lafont's typed nets [20] on a uniform technical footing, suggesting generalisations, and offering a secure basis for integration. We also prove that the class of typable operations in the underlying partial algebras is completely characterised by a certain modularity principle in process composition, which gives us the basic understanding on the nature of the type disciplines representable in...
Elementary Structures in Process Theory (1) Sets with Renaming
, 1997
"... We study a general algebraic framework which underlies a wide range of computational formalisms... ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
We study a general algebraic framework which underlies a wide range of computational formalisms...
From Action Calculi to Linear Logic
, 1998
"... . Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a typetheoretic account of action calculi using the propositionsastypes paradigm; the type theory has a sound and complete interpretation in Power's categorical models. We go on to ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
(Show Context)
. Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a typetheoretic account of action calculi using the propositionsastypes paradigm; the type theory has a sound and complete interpretation in Power's categorical models. We go on to give a sound translation of our type theory in the (type theory of) intuitionistic linear logic, corresponding to the relation between Benton's models of linear logic and models of action calculi. The conservativity of the syntactic translation is proved by a modelembedding construction using the Yoneda lemma. Finally, we briefly discuss how these techniques can also be used to give conservative translations between various extensions of action calculi. 1 Introduction Action calculi arose directly from the ßcalculus [MPW92]. They were introduced by Milner [Mil96], to provide a uniform notation for capturing many calculi of interaction such as the ßcalculus, the calculus, models of distribut...
Strategic Directions in Concurrency Research
 ACM COMPUTING SURVEYS
, 1996
"... Concurrency is concerned with the fundamental aspects of systems of multiple, simultaneously active computing agents that interact with one another. This notion is ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Concurrency is concerned with the fundamental aspects of systems of multiple, simultaneously active computing agents that interact with one another. This notion is
Integrated Formal Methods with Richer Methodological Profiles for the Development of MultiPerspective Systems
, 1996
"... The thesis investigates some of the traditional problems with the established formal methods, such as requirements elicitation, the validation problem, divergence from current industrial practice, adverse effects on early problem solving and the incompleteness of perspective. Recent approaches to so ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
The thesis investigates some of the traditional problems with the established formal methods, such as requirements elicitation, the validation problem, divergence from current industrial practice, adverse effects on early problem solving and the incompleteness of perspective. Recent approaches to solving some of these problems are reviewed, including structured and formal methods integration, hybrid formal methods and multiparadigmed approaches. The definition of a method first used by Kronlof is adopted and two reasons for integrating methods are hypothesised: ffl The integration of methods which result in a richer methodological profile, such as methods which address different stages of the lifecycle, and; ffl The integration of methods which result in a wider overall perspective, and are thus effective over a wider number of prospective problems, such as methods which consider different orthogonal aspects of requirements. Two pieces of work are then presented, one for each hypot...
Programming in the picalculus: A tutorial introduction to Pict (Pict Version 3.8d)
, 1996
"... Pict is a programming language in the ML tradition, formed by adding highlevel derived forms and a powerful static type system to a tiny core language. The core, Milner's picalculus, has been used as a theoretical foundation for a broad class of concurrent computations. The goal in Pict is to ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Pict is a programming language in the ML tradition, formed by adding highlevel derived forms and a powerful static type system to a tiny core language. The core, Milner's picalculus, has been used as a theoretical foundation for a broad class of concurrent computations. The goal in Pict is to identify idioms that arise naturally when these primitives are used to build working programs  idioms such as basic data structures, protocols for returning results, higherorder programming, selective communication, and concurrent objects. The type system integrates a number of features found in recent work on theoretical foundations for typed objectoriented languages: higherorder polymorphism, simple recursive types, subtyping, and a useful partial type inference algorithm. This is a tutorial introduction to Pict, with examples and exercises. Consumer Safety Warning Pict is an evolving language design and the current implementation is experimental software. You are welcome to use Pict in...
Symmetric Action Calculi
 Theoretical Computer Science
, 1999
"... Many calculi for describing interactive behaviour involve names, nameabstraction and namerestriction. Milner's reflexive action calculi provide a framework for exploring such calculi. It is based on names and nameabstraction. We introduce an alternative framework, the symmetric action calcul ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Many calculi for describing interactive behaviour involve names, nameabstraction and namerestriction. Milner's reflexive action calculi provide a framework for exploring such calculi. It is based on names and nameabstraction. We introduce an alternative framework, the symmetric action calculi, based on names, conames and namerestriction (or hiding). Nameabstraction is intepreted as a derived operator. The symmetric framework conservatively extends the reflexive framework. It allows for a natural intepretation of a variety of calculi: we give interpretations for the calculus, the I calculus and a variant of the fusion calculus. We then give a combinatory version of the symmetric framework, in which namerestriction also is expressed as a derived operator. This combinatory account provides an intermediate step between our nonstandard use of names in graphs, and the more standard graphical structure arising from category theory. To conclude, we briey illustrate the connection ...
Shallow Linear Action Graphs and their Embeddings
 FORMAL ASPECTS OF COMPUTING
, 2000
"... ... This paper presents the category of embeddings of shallow linear action graphs (those without nesting), using a novel form of graphical reasoning which simplifies some otherwise complex manipulations in regular algebra. The work is done for undirected graphs, and adapted in a few lines to direct ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
... This paper presents the category of embeddings of shallow linear action graphs (those without nesting), using a novel form of graphical reasoning which simplifies some otherwise complex manipulations in regular algebra. The work is done for undirected graphs, and adapted in a few lines to directed graphs. The graphical reasoning used here will be applied in future work to develop behavioural congruences for action calculi.
Axioms for Definability and Full Completeness
 in Proof, Language and Interaction: Essays in Honour of Robin
, 2000
"... ion problem for PCF (see [BCL86, Cur93, Ong95] for surveys). The importance of full abstraction for the semantics of programming languages is that it is one of the few quality filters we have. Specifically, it provides a clear criterion for assessing how definitive a semantic analysis of some langu ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
ion problem for PCF (see [BCL86, Cur93, Ong95] for surveys). The importance of full abstraction for the semantics of programming languages is that it is one of the few quality filters we have. Specifically, it provides a clear criterion for assessing how definitive a semantic analysis of some language is. It must be admitted that to date the quest for fully abstract models has not yielded many obvious applications; but it has generated much of the deepest work in semantics. Perhaps it is early days yet. Recently, game semantics has been used to give the first syntaxindependent constructions of fully abstract models for a number of programming languages, including PCF [AJM96, HO96, Nic94], richer functional languages [AM95, McC96b, McC96a, HY97], and languages with nonfunctional features such as reference types and nonlocal control constructs [AM97c, AM97b, AM97a, Lai97]. A noteworthy feature is that the key definability results for the richer languages are proved by a reduction to...