A Presheaf Semantics of Value-Passing Processes

This paper investigates presheaf models for process calculi withvalue passing. Denotational semantics in presheaf models are shownto correspond to operational semantics in that bisimulation obtainedfrom open maps is proved to coincide with bisimulation as definedtraditionally from the operational semantics. Both "early" and "late"semantics are considered, though the more interesting "late" semanticsis emphasised. A presheaf model and denotational semantics is proposedfor a language allowing process passing, though there remainsthe problem of relating the notion of bisimulation obtained from openmaps to a more traditional definition from the operational semantics.A tentative beginning is made of a "domain theory" supportingpresheaf models

A Presheaf Semantics of Value-Passing Processes

This paper investigates presheaf models for process calculi withvalue passing. Denotational semantics in presheaf models are shownto correspond to operational semantics in that bisimulation obtainedfrom open maps is proved to coincide with bisimulation as definedtraditionally from the operational semantics. Both "early" and "late"semantics are considered, though the more interesting "late" semanticsis emphasised. A presheaf model and denotational semantics is proposedfor a language allowing process passing, though there remainsthe problem of relating the notion of bisimulation obtained from openmaps to a more traditional definition from the operational semantics.A tentative beginning is made of a "domain theory" supportingpresheaf models

Bisimulations for Asynchronous Mobile Processes

Within the past few years there has been renewed interest in thestudy of value-passing process calculi as a consequence of the emergence of the pi-calculus. Here, [MPW89] have determined two variants of the notion of bisimulation, late and early bisimilarity. Most recently [San93] has proposed the new notion of open bisimulation equivalence. In this paper we consider Plain LAL, a mobile process calculus which differs from the pi-calculus in the sense that the communication of data values happens asynchronously. The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide - this in contrast to the pi-calculus where they are distinct. The result allows us to formulate a common equational theory which is sound and complete for finite terms of Plain LAL

Formal Models for Concurrent Communicating Systems

This report was originally written to fulfill in part the requirements of the author\u27s WPE examinations, part of the qualifying examinations for the University of Pennsylvania\u27a Computer Science Ph.D program. The report first introduces CCS and uses it to illustrate various features of established methods of modelling concurrent, communicating systems. The report then goes on to describe and investigate two new models for such systems: The Chemical Abstract Machine, a simple yet predominant in most models for such systems; and the π-calculus, a calculus similar in many respects to CCS, but able to model mobile processes and other, more difficult phenomena

Verification of Linear Optical Quantum Computing using Quantum Process Calculus

We explain the use of quantum process calculus to describe and analyse linear optical quantum computing (LOQC). The main idea is to define two processes, one modelling a linear optical system and the other expressing a specification, and prove that they are behaviourally equivalent. We extend the theory of behavioural equivalence in the process calculus Communicating Quantum Processes (CQP) to include multiple particles (namely photons) as information carriers, described by Fock states or number states. We summarise the theory in this paper, including the crucial result that equivalence is a congruence, meaning that it is preserved by embedding in any context. In previous work, we have used quantum process calculus to model LOQC but without verifying models against specifications. In this paper, for the first time, we are able to carry out verification. We illustrate this approach by describing and verifying two models of an LOQC CNOT gate.Comment: In Proceedings EXPRESS/SOS 2014, arXiv:1408.127

A Process Calculus for Dynamic Networks

In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery computations and it contains features for broadcasting at multiple transmission ranges and for viewing networks at different levels of abstraction. We develop a theory of confluence for the calculus and we use the machinery developed towards the verification of a leader-election algorithm for mobile ad hoc networks