Results 1  10
of
32
Bisimulation from Open Maps
 Information and Computation
, 1994
"... An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction f ..."
Abstract

Cited by 116 (42 self)
 Add to MetaCart
An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction from Petri nets) and labelled event structures are considered. On transition systems the abstract definition readily specialises to Milner's strong bisimulation. On event structures it explains and leads to a revision of historypreserving bisimulation of Rabinovitch and Traktenbrot, Goltz and van Glabeek. A tieup with open maps in a (pre)topos, as they appear in the work of Joyal and Moerdijk, brings to light a promising new model, presheaves on categories of pomsets, into which the usual category of labelled event structures embeds fully and faithfully. As an indication of its promise, this new presheaf model has "refinement" operators, though further work is required to justify their appropriateness and understand their relation to previous attempts. The general approach yields a logic, generalising HennessyMilner logic, which is characteristic for the generalised notion of bisimulation.
Presheaf Models for Concurrency
, 1999
"... In this dissertation we investigate presheaf models for concurrent computation. Our aim is to provide a systematic treatment of bisimulation for a wide range of concurrent process calculi. Bisimilarity is defined abstractly in terms of open maps as in the work of Joyal, Nielsen and Winskel. Their wo ..."
Abstract

Cited by 45 (19 self)
 Add to MetaCart
In this dissertation we investigate presheaf models for concurrent computation. Our aim is to provide a systematic treatment of bisimulation for a wide range of concurrent process calculi. Bisimilarity is defined abstractly in terms of open maps as in the work of Joyal, Nielsen and Winskel. Their work inspired this thesis by suggesting that presheaf categories could provide abstract models for concurrency with a builtin notion of bisimulation. We show how
A Presheaf Semantics of ValuePassing Processes
, 1996
"... This paper investigates presheaf models for process calculi with value passing. Denotational semantics in presheaf models are shown to correspond to operational semantics in that bisimulation obtained from open maps is proved to coincide with bisimulation as defined traditionally from the operat ..."
Abstract

Cited by 33 (18 self)
 Add to MetaCart
This paper investigates presheaf models for process calculi with value passing. Denotational semantics in presheaf models are shown to correspond to operational semantics in that bisimulation obtained from open maps is proved to coincide with bisimulation as defined traditionally from the operational semantics. Both "early" and "late" semantics are considered, though the more interesting "late" semantics is emphasised. A presheaf model and denotational semantics is proposed for a language allowing process passing, though there remains the problem of relating the notion of bisimulation obtained from open maps to a more traditional definition from the operational semantics.
A Relational Model of NonDeterministic Dataflow
 In CONCUR'98, volume 1466 of LNCS
, 1998
"... . We recast dataflow in a modern categorical light using profunctors as a generalisation 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 ..."
Abstract

Cited by 27 (13 self)
 Add to MetaCart
. We recast dataflow in a modern categorical light using profunctors as a generalisation 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. 1 Introduction A fundament...
A Theory of Recursive Domains with Applications to Concurrency
 In Proc. of LICS ’98
, 1997
"... Marcelo Fiore , Glynn Winskel (1) BRICS , University of Aarhus, Denmark (2) LFCS, University of Edinburgh, Scotland December 1997 Abstract We develop a 2categorical theory for recursively defined domains. ..."
Abstract

Cited by 23 (14 self)
 Add to MetaCart
Marcelo Fiore , Glynn Winskel (1) BRICS , University of Aarhus, Denmark (2) LFCS, University of Edinburgh, Scotland December 1997 Abstract We develop a 2categorical theory for recursively defined domains.
A Categorical Axiomatics for Bisimulation
 In Proc. of CONCUR’98, LNCS 1466
, 1998
"... We give an axiomatic category theoretic account of bisimulation in process algebras based on the idea of functional bisimulations as open maps. We work with 2monads, T , on Cat. Operations on processes, such as nondeterministic sum, prefixing and parallel composition are modelled using functors in ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
We give an axiomatic category theoretic account of bisimulation in process algebras based on the idea of functional bisimulations as open maps. We work with 2monads, T , on Cat. Operations on processes, such as nondeterministic sum, prefixing and parallel composition are modelled using functors in the Kleisli category for the 2monad T .
Petri Nets and Bisimulations
 THEORETICAL COMPUTER SCIENCE
, 1995
"... Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the pres ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the present paper is to illustrate the use of such relationships by transferring to Petri nets a general concept of bisimulation.
Presheaf models of constructive set theories
, 2004
"... Abstract. We introduce a new kind of models for constructive set theories based on categories of presheaves. These models are a counterpart of the presheaf models for intuitionistic set theories defined by Dana Scott in the ’80s. We also show how presheaf models fit into the framework of Algebraic S ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
Abstract. We introduce a new kind of models for constructive set theories based on categories of presheaves. These models are a counterpart of the presheaf models for intuitionistic set theories defined by Dana Scott in the ’80s. We also show how presheaf models fit into the framework of Algebraic Set Theory and sketch an application to an independence result. 1. Variable sets in foundations and practice Presheaves are of central importance both for the foundations and the practice of mathematics. The notion of a presheaf formalizes well the idea of a variable set, that is relevant in all the areas of mathematics concerned with the study of indexed families of objects [19]. One may then readily see how presheaves are of interest also in foundations: both Cohen’s forcing models for classical set theories and Kripke models for intuitionistic logic involve the idea of sets indexed by stages. Constructive aspects start to emerge when one considers the internal logic of categories of presheaves. This logic, which does not include classical principles such as the law of the excluded middle, provides a useful language to manipulate objects
Open Maps, Behavioural Equivalences, and Congruences
, 1996
"... Spans of open maps have been proposed by Joyal, Nielsen, and Winskel as a way of adjoining an abstract equivalence, Pbisimilarity, to a category of models of computation M, where P is an arbitrary subcategory of observations. Part of the motivation was to recast and generalise Milner's wellkno ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Spans of open maps have been proposed by Joyal, Nielsen, and Winskel as a way of adjoining an abstract equivalence, Pbisimilarity, to a category of models of computation M, where P is an arbitrary subcategory of observations. Part of the motivation was to recast and generalise Milner's wellknown strong bisimulation in this categorical setting. An issue
Linearity in Process Languages
"... The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a pathbased model of processes which is also amodel of affinelinear logic. This connection yields an affinelinear language for processes, automatically respecting openmap bisim ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a pathbased model of processes which is also amodel of affinelinear logic. This connection yields an affinelinear language for processes, automatically respecting openmap bisimulation, in which a range of process operations can be expressed. An operational semantics isprovided for the tensor fragment of the language. Different ways to make assemblies of processes lead to differentchoices of exponential, some of which respect bisimulation.