Results 1  10
of
51
The SheafTheoretic Structure Of NonLocality and Contextuality
, 2011
"... Locality and noncontextuality are intuitively appealing features of classical physics, which are contradicted by quantum mechanics. The goal of the classic nogo theorems by Bell, KochenSpecker, et al. is to show that nonlocality and contextuality are necessary features of any theory whose predic ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
Locality and noncontextuality are intuitively appealing features of classical physics, which are contradicted by quantum mechanics. The goal of the classic nogo theorems by Bell, KochenSpecker, et al. is to show that nonlocality and contextuality are necessary features of any theory whose predictions agree with those of quantum mechanics. We use the mathematics of sheaf theory to analyze the structure of nonlocality and contextuality in a very general setting. Starting from a simple experimental scenario, and the kind of probabilistic models familiar from discussions of Bell’s theorem, we show that there is a very direct, compelling formalization of these notions in sheaftheoretic terms. Moreover, on the basis of this formulation, we show that the phenomena of nonlocality and contextuality can be characterized precisely in terms of obstructions to the existence of global sections. We give linear algebraic methods for computing these obstructions, and use these methods to obtain a number of new insights into nonlocality and contextuality. For example, we distinguish a proper hierarchy of strengths of nogo theorems, and show that three leading examples — due to Bell, Hardy, and Greenberger, Horne and Zeilinger, respectively — occupy successively higher levels of this hierarchy. We show how our abstract setting can be represented in quantum mechanics. In doing so, we uncover a strengthening of the usual nosignalling theorem, which shows that quantum mechanics obeys nosignalling for arbitrary families of commuting observables, not just those represented on different factors of a tensor product.
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.
Models for NamePassing Processes: Interleaving and Causal
 In Proceedings of LICS 2000: the 15th IEEE Symposium on Logic in Computer Science (Santa Barbara
, 2000
"... We study syntaxfree models for namepassing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual picalculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we de ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
(Show Context)
We study syntaxfree models for namepassing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual picalculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we define Indexed Labelled Asynchronous Transition Systems, smoothly generalizing both our interleaving model and the standard Asynchronous Transition Systems model for CCSlike calculi. In each case we relate a denotational semantics to an operational view, for bisimulation and causal bisimulation respectively. We establish completeness properties of, and adjunctions between, categories of the two models. Alternative indexing structures and possible applications are also discussed. These are first steps towards a uniform understanding of the semantics and operations of namepassing calculi.
Domain theory for concurrency
, 2003
"... Concurrent computation can be given an abstract mathematical treatment very similar to that provided for sequential computation by domain theory and denotational semantics of Scott and Strachey. ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
Concurrent computation can be given an abstract mathematical treatment very similar to that provided for sequential computation by domain theory and denotational semantics of Scott and Strachey.
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 28 (13 self)
 Add to MetaCart
(Show Context)
. 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 25 (14 self)
 Add to MetaCart
(Show Context)
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 Fully Abstract Presheaf Semantics of SCCS with Finite Delay
 Department of Computer Science, University of Aarhus
, 1999
"... We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equatio ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
(Show Context)
We present a presheaf model for the observation of infinite as well as finite computations. We apply it to give a denotational semantics of SCCS with finite delay, in which the meanings of recursion are given by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. This can be viewed as a first step in representing fairness in presheaf semantics. We give a concrete representation of the presheaf model as a category of generalised synchronisation trees and show that it is coreflective in a category of generalised transition systems, which are a special case of the general transition systems of Hennessy and Stirling. The open map bisimulation is shown to coincide with the extended bisimulation of Hennessy and Stirling. Finally we formulate Milners operational semantics of SCCS with finite delay in terms of generalised transition systems and prove that the presheaf semantics is fully abstract with respect to extended bisimulation
Complete Cuboidal Sets in Axiomatic Domain Theory (Extended Abstract)
 In Proceedings of 12th Annual Symposium on Logic in Computer Science
, 1997
"... ) Marcelo Fiore !mf@dcs.ed.ac.uk? Gordon Plotkin y !gdp@dcs.ed.ac.uk? John Power !ajp@dcs.ed.ac.uk? Department of Computer Science Laboratory for Foundations of Computer Science University of Edinburgh, The King's Buildings Edinburgh EH9 3JZ, Scotland Abstract We study the enrichme ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
) Marcelo Fiore !mf@dcs.ed.ac.uk? Gordon Plotkin y !gdp@dcs.ed.ac.uk? John Power !ajp@dcs.ed.ac.uk? Department of Computer Science Laboratory for Foundations of Computer Science University of Edinburgh, The King's Buildings Edinburgh EH9 3JZ, Scotland Abstract We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, viz. that of complete cuboidal set, that complies with the axiomatic requirements. We show that the category of complete cuboidal sets provides a general notion of enrichment for a wide class of axiomatic domaintheoretic structures. Introduction The aim of Axiomatic Domain Theory (ADT) is to provide a conceptual understanding of why domains are adequate as mathematical models of computation. (For a discussion see [12, x Axiomatic Domain Theory ].) The approach taken is to axiomatise the structure needed on a category so that its objects can be considered as domains, and its maps as continuous...
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
(Show Context)
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 .
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 14 (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.