## Asynchronous Communication Model Based on Linear Logic (1995)

Venue: | Formal Aspects of Computing |

Citations: | 47 - 6 self |

### BibTeX

@ARTICLE{Kobayashi95asynchronouscommunication,

author = {Naoki Kobayashi and Akinori Yonezawa},

title = {Asynchronous Communication Model Based on Linear Logic},

journal = {Formal Aspects of Computing},

year = {1995},

volume = {7},

pages = {3--279}

}

### OpenURL

### Abstract

We propose a new framework called ACL for concurrent computation based on linear logic. ACL is a kind of linear logic programming framework, where its operational semantics is described in terms of proof construction in linear logic. We also give a model-theoretic semantics as a natural extension of phase semantics, a model of linear logic. Our framework well captures concurrent computation based on asynchronous communication. It will, therefore, provide us with a new insight into other models of concurrent computation from a logical point of view. We also expect ACL to become a formal framework for verification, reasoning, and transformation of concurrent programs by the use of techniques for traditional logic programming. ACL's attractive features for concurrent programming paradigms are also discussed. 1 Introduction For future massively parallel processing environments, concurrent programming languages based on asynchronous communication would become more and more important. Due ...

### Citations

3399 | Communicating sequential process
- Hoare
- 1985
(Show Context)
Citation Context ...ic. 8 j (m ? j\Omega A j ) in rule (C2) represents a receiver process which waits any one of messages m 1 ; : : : ; m k and becomes A i when receiving m i . This corresponds to the input guard in CSP =-=[7]-=-. ` m i ; m ? i in rule (C2) is an axiom, hence a proof tree ends at this leaf. Computation, therefore, goes to the direction of up-right. ?m, which we call a modal message, is a message which can be ... |

3203 |
Communication and concurrency
- Milner
- 1989
(Show Context)
Citation Context ...synchronous communication. It 1 will, therefore, provide us a new insight into other models of concurrent computation from a logical point of view. In fact, the actor model[2] and asynchronous CCS[18]=-=[19]-=- can be directly translated into our ACL framework. We also expect ACL to become a formal framework for verification, reasoning, and transformation of concurrent programs with techniques used in tradi... |

1855 |
Foundations of Logic Programming
- Lloyd
- 1987
(Show Context)
Citation Context ...e corresponds exactly to an identifier creation. 4.1.3 Model for First-Order Extension We briefly overview the model for the first order extension in the analogy of Herbrand model in logic programming=-=[15]-=-. Herbrand model is given as a mapping from Herbrand base (a set of ground atomic formulas) to the truth values ftrue; falseg. In ACL model, each ground atomic formula is mapped to a fact in phase mod... |

1097 |
Actors: A Model of Concurrent Computation in Distributed Systems
- Agha
- 1986
(Show Context)
Citation Context ...rrent computation based on asynchronous communication. It 1 will, therefore, provide us a new insight into other models of concurrent computation from a logical point of view. In fact, the actor model=-=[2]-=- and asynchronous CCS[18][19] can be directly translated into our ACL framework. We also expect ACL to become a formal framework for verification, reasoning, and transformation of concurrent programs ... |

751 | Rewrite systems
- Dershowitz, Jouannaud
- 1992
(Show Context)
Citation Context ...llows processes to send values in messages. Arithmetic operations (for example) can be included in ACL by providing rewriting systems on first order terms. We consider convergent term rewriting system=-=[9]-=- R, and add the following inference rule: ffl Rewriting Rule (R1) ` p(t); 0 ` p(s); 0 if s ! t 2 R where `a' in Rule (C2 0 ) is restricted to the normal form in R. Generally, R can be any programming ... |

615 | Linear logic
- Girard
- 1987
(Show Context)
Citation Context ...mers for transforming and verifying of concurrent programs, hence the role of formal frameworks for concurrent computation would be significant. Recently, several applications of Girard's linear logic=-=[12]-=- to logic programming were proposed and shown that they correspond to reactive paradigms[4][5][17]. We propose a new framework called ACL (Asynchronous Communication based on Linear logic) for concurr... |

436 | Concurrent Constraint Programming
- Saraswat, Rinard
- 1990
(Show Context)
Citation Context ...ework, including value passing, hiding, and identifier creation. The concurrent definitional constraint programming(DCP) proposed in [8] is formulated in the style of concurrent constraint programming=-=[23]-=-, and the logical semantics is given by linear logic. Our model theoretic semantics would also be applied to concurrent DCP, although in DCP A transits to B if A entails B while in ACL A transits to B... |

404 | Testing equivalences for processes
- Nicola, Hennessy
- 1984
(Show Context)
Citation Context ...ovable by ACL inference rules A 3 i , therefore, gives a set of testers which succeed when running with A i in parallel, hence this specific model derives an equivalence similar to testing equivalence=-=[22]-=-. From the another point of view, A 3 i represents `what interaction A i performs with its environment', because A 3 i contains only message predicates. For example, fm ?\Omega ?g 2 A 3 i implies that... |

311 |
Calculi for Synchrony and Asynchrony
- Milner
- 1983
(Show Context)
Citation Context ...on asynchronous communication. It 1 will, therefore, provide us a new insight into other models of concurrent computation from a logical point of view. In fact, the actor model[2] and asynchronous CCS=-=[18]-=-[19] can be directly translated into our ACL framework. We also expect ACL to become a formal framework for verification, reasoning, and transformation of concurrent programs with techniques used in t... |

269 |
The Family of Concurrent Logic Programming Languages
- Shapiro
- 1989
(Show Context)
Citation Context ...ga : : :\Omega m ? n\Omega P This mechanism is useful for synchronization between multiple processes and for splitting large data into multiple messages. It is provided in concurrent logic programming=-=[24]-=- by a head unification mechanism, whereas it is not provided in the actor model[2], CCS[19] and CSP[7]. Example 1. A process sync(i) ?\Omega sync(j) ?\Omega (go(i) + go(j)), which receives messages sy... |

207 | Linear Objects: logical processes with built-in inheritance
- Andreoli, Pareschi
- 1990
(Show Context)
Citation Context ...rks for concurrent computation would be significant. Recently, several applications of Girard's linear logic[12] to logic programming were proposed and shown that they correspond to reactive paradigms=-=[4]-=-[5][17]. We propose a new framework called ACL (Asynchronous Communication based on Linear logic) for concurrent computation along this line. Computation in ACL is described in terms of proof construc... |

189 | A calculus of mobile processes, parts
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...iversal Quantification for Identifier Creation First-order universal quantification works as a mechanism for identifier creation. Identifier creation is often very important in concurrent computing[2]=-=[20]-=-[25][26]. Identifiers work as pointers to access resources including processes such that resources can be accessed only by acquaintances, i.e., processes which know their pointers. By passing identifi... |

163 |
Interaction nets
- Lafont
- 1990
(Show Context)
Citation Context ...ogic[12] has been drawing great attentions in recent years. There are two major approaches to modelling concurrent computation by using linear logic. One is the approach from functional programming[1]=-=[14]-=- which is based on `Formulae as Types' notion of CurryHoward Isomorphism[13] where computation is described in terms of proof normalization. The other is `Formulae as States, Proofs as Computations' a... |

122 |
ABCL: An Object-Oriented Concurrent System
- Yonezawa, editor
- 1990
(Show Context)
Citation Context ...sal Quantification for Identifier Creation First-order universal quantification works as a mechanism for identifier creation. Identifier creation is often very important in concurrent computing[2][20]=-=[25]-=-[26]. Identifiers work as pointers to access resources including processes such that resources can be accessed only by acquaintances, i.e., processes which know their pointers. By passing identifiers ... |

109 | A calculus of mobile processes, parts i and ii
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...fore, must use the original rules. The introduction of second-order existential quantification allows us to pass names of messages, hence may lead to the asynchronous version of Milner's -calculus[20]=-=[21]-=-, though we do not investigate it here. 10 4.3 Stratified Process --- Processes as Resources Up to now, we distinguished messages and processes completely and forbidden from receiving processes (proce... |

104 |
Proofs and types. Cambridge Tracts
- Girard, Lafont, et al.
- 1989
(Show Context)
Citation Context ...jor approaches to modelling concurrent computation by using linear logic. One is the approach from functional programming[1][14] which is based on `Formulae as Types' notion of CurryHoward Isomorphism=-=[13]-=- where computation is described in terms of proof normalization. The other is `Formulae as States, Proofs as Computations' approach[16]. In this approach, connections between Petri Nets and linear log... |

101 | The π-calculus as a theory in linear logic: Preliminary results
- Miller
- 1993
(Show Context)
Citation Context ...r concurrent computation would be significant. Recently, several applications of Girard's linear logic[12] to logic programming were proposed and shown that they correspond to reactive paradigms[4][5]=-=[17]-=-. We propose a new framework called ACL (Asynchronous Communication based on Linear logic) for concurrent computation along this line. Computation in ACL is described in terms of proof construction in... |

67 |
From Petri nets to linear logic
- Martí-Oliet, Meseguer
- 1991
(Show Context)
Citation Context ...is based on `Formulae as Types' notion of CurryHoward Isomorphism[13] where computation is described in terms of proof normalization. The other is `Formulae as States, Proofs as Computations' approach=-=[16]-=-. In this approach, connections between Petri Nets and linear logic have been investigated[16][11][10][6]. They relate Petri Nets to theories in linear logic using only\Omega . Later, [6] extended thi... |

60 |
Object-oriented concurrent programming
- Yonezawa, Tokoro
- 1990
(Show Context)
Citation Context ... ( ) ? ; ?; 8; 9)) to intuitionistic meaning of computation, (3)to give a logical point of view to other frameworks of concurrent programming languages including object-oriented concurrent programming=-=[26]-=- and (4)to introduce new concepts on concurrent programming. The rest of this paper is organized as follows. Section 2 describes the syntax and operational semantics of the basic fragment of ACL. Sect... |

48 |
The structure and semantics of actor languages,” in The
- Agha
- 1990
(Show Context)
Citation Context ...\Omega ?; : : :g This model means that a process A accepts an integer via p, then returns an integer via q. 11 5 Translations of Actors, CCS and -calculus In this section, we show that the actor model=-=[3]-=- and asynchronous CCS[18] can be directly translated into the ACL framework. 5.1 Actor In the actor model[3], computation is performed by concurrent agents, called actors, communicating each other by ... |

45 | Communication as Fair Distribution of Knowledge
- Andreoli, Pareschi
- 1991
(Show Context)
Citation Context ... for concurrent computation would be significant. Recently, several applications of Girard's linear logic[12] to logic programming were proposed and shown that they correspond to reactive paradigms[4]=-=[5]-=-[17]. We propose a new framework called ACL (Asynchronous Communication based on Linear logic) for concurrent computation along this line. Computation in ACL is described in terms of proof constructio... |

33 | Petri nets as models of linear logic
- Engberg, Winskel
- 1990
(Show Context)
Citation Context ...n terms of proof normalization. The other is `Formulae as States, Proofs as Computations' approach[16]. In this approach, connections between Petri Nets and linear logic have been investigated[16][11]=-=[10]-=-[6]. They relate Petri Nets to theories in linear logic using only\Omega . Later, [6] extended this approach to the implication(0ffi). The latter approach, `Proofs as Computations', is also investigat... |

31 |
Normal process representatives
- Gehlot, Gunter
- 1990
(Show Context)
Citation Context ...ed in terms of proof normalization. The other is `Formulae as States, Proofs as Computations' approach[16]. In this approach, connections between Petri Nets and linear logic have been investigated[16]=-=[11]-=-[10][6]. They relate Petri Nets to theories in linear logic using only\Omega . Later, [6] extended this approach to the implication(0ffi). The latter approach, `Proofs as Computations', is also invest... |

3 |
Definitional Constraint Programming for Parallel Computing: An Introduction
- Darlington, Guo
- 1992
(Show Context)
Citation Context ...he implication(0ffi). The latter approach, `Proofs as Computations', is also investigated in a rather different way, in the context of logic programming[4][5][17] and concurrent constraint programming=-=[8]-=-. Andreoli and Pareschi[4][5] pointed out that `Proof search as computation' analogy for linear logic corresponds to a reactive paradigm. Our ACL follows this line and gives a connection between concu... |

2 |
Computational Interpretations of Linear Logic," Theoretical Computer Science(to appear
- Abramsky
- 1993
(Show Context)
Citation Context ...r logic[12] has been drawing great attentions in recent years. There are two major approaches to modelling concurrent computation by using linear logic. One is the approach from functional programming=-=[1]-=-[14] which is based on `Formulae as Types' notion of CurryHoward Isomorphism[13] where computation is described in terms of proof normalization. The other is `Formulae as States, Proofs as Computation... |

1 | Implicative Formulae in the "Proofs as Computations Analogy - Asperti, Ferrari, et al. - 1990 |