A Presheaf Semantics of Value-Passing Processes

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 tentative beginning is made of a “domain theory” supporting presheaf models.

[1]  Matthew Hennessy,et al.  A Term Model for CCS , 1980, MFCS.

[2]  I. Stark,et al.  A fully abstract domain model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[3]  Anna Ingólfsdóttir.  Weak Semantics Based on Lighted Button Pressing Experiments. An Alternative Characterization of the Readiness Semantics , 1996 .

[4]  H Huttel,et al.  On the Complexity of Deciding Behavioural Equivalences and Preorders , 1996 .

[5]  Steven Vickers,et al.  Applications of Categories in Computer Science: Geometric theories and databases , 1992 .

[6]  Glynn Winskel,et al.  Presheaf Models for Concurrency , 1996, CSL.

[7]  Ieke Moerdijk,et al.  Algebraic set theory , 1995 .

[8]  Glynn Winskel.  A Presheaf Semantics of Value-Passing Processes , 1996 .

[9]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[10]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[11]  Samson Abramsky,et al.  On Semantic Foundations for Applicative Multiprogramming , 1983, ICALP.

[12]  ProcessesLate ApproachAnna Ing,et al.  A Semantic Theory for Value { Passing , 1995 .

[13]  Jaikumar Radhakrishnan,et al.  The Randomized Complexity of Maintaining the Minimum , 1996, Nord. J. Comput..

[14]  Anna Ingólfsdóttir,et al.  A Semantic Theory for Value – Passing Processes Late Approach Part II : A Behavioural Semantics , 1995 .

[15]  Daniel J. Lehmann.  Categories for fixpoint-semantics , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[16]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[17]  Ieke Moerdijk,et al.  A Completeness Theorem for Open Maps , 1994, Ann. Pure Appl. Log..

[18]  Sven Skyum,et al.  The Complexity of Computing the k-ary Composition of a Binary Associative Operator , 1996 .

[19]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[20]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[21]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[22]  Anna Ingólfsdóttir,et al.  A Theory of Communicating Processes with Value-Passing , 1990, ICALP.

[23]  Stefan Dziembowski,et al.  The Fixpoint Bounded-Variable Queries are PSPACE-Complete , 1996 .