A model of higher-order concurrent programs based on graph rewriting

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This article presents a formal model of concurrent systems with higher-order communication to transfer program codes as data between processes. A number of models [1,14,15] are reported as models of higher-order communication and most of them are based on process algebra. However as we reported [7, 8], it is not easy to represent the scopes of names of communication channels precisely using process algebra. We present a model of concurrent programs with higher order communication that can represent the scopes of names precisely. The model presented here is an extension of the model reported in [8] that is based on graph rewriting. We define the equivalence relation such that if the equivalence holds on two programs then they are equivalent not only on their behaviors but on the scopes of names also. This article also presents a compilation of higher-order concurrent programs into first-order name passing programs on the graph rewriting model.

Original languageEnglish
Title of host publicationEmerging Topics on Differential Geometry and Graph Theory
PublisherNova Science Publishers, Inc.
Pages373-394
Number of pages22
ISBN (Print)9781607410119
Publication statusPublished - Jan 2011

Fingerprint

Graph Rewriting
Concurrent
Higher Order
Process Algebra
Model
Concurrent Systems
Communication Channels
Formal Model
Compilation
Equivalence relation
Equivalence
First-order
Communication

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Murakami, M. (2011). A model of higher-order concurrent programs based on graph rewriting. In Emerging Topics on Differential Geometry and Graph Theory (pp. 373-394). Nova Science Publishers, Inc..

A model of higher-order concurrent programs based on graph rewriting. / Murakami, Masaki.

Emerging Topics on Differential Geometry and Graph Theory. Nova Science Publishers, Inc., 2011. p. 373-394.

Research output: Chapter in Book/Report/Conference proceedingChapter

Murakami, M 2011, A model of higher-order concurrent programs based on graph rewriting. in Emerging Topics on Differential Geometry and Graph Theory. Nova Science Publishers, Inc., pp. 373-394.
Murakami M. A model of higher-order concurrent programs based on graph rewriting. In Emerging Topics on Differential Geometry and Graph Theory. Nova Science Publishers, Inc. 2011. p. 373-394
Murakami, Masaki. / A model of higher-order concurrent programs based on graph rewriting. Emerging Topics on Differential Geometry and Graph Theory. Nova Science Publishers, Inc., 2011. pp. 373-394
@inbook{9d85b982cdb945eba8c849b98aa06f4d,
title = "A model of higher-order concurrent programs based on graph rewriting",
abstract = "This article presents a formal model of concurrent systems with higher-order communication to transfer program codes as data between processes. A number of models [1,14,15] are reported as models of higher-order communication and most of them are based on process algebra. However as we reported [7, 8], it is not easy to represent the scopes of names of communication channels precisely using process algebra. We present a model of concurrent programs with higher order communication that can represent the scopes of names precisely. The model presented here is an extension of the model reported in [8] that is based on graph rewriting. We define the equivalence relation such that if the equivalence holds on two programs then they are equivalent not only on their behaviors but on the scopes of names also. This article also presents a compilation of higher-order concurrent programs into first-order name passing programs on the graph rewriting model.",
author = "Masaki Murakami",
year = "2011",
month = "1",
language = "English",
isbn = "9781607410119",
pages = "373--394",
booktitle = "Emerging Topics on Differential Geometry and Graph Theory",
publisher = "Nova Science Publishers, Inc.",

}

TY - CHAP

T1 - A model of higher-order concurrent programs based on graph rewriting

AU - Murakami, Masaki

PY - 2011/1

Y1 - 2011/1

N2 - This article presents a formal model of concurrent systems with higher-order communication to transfer program codes as data between processes. A number of models [1,14,15] are reported as models of higher-order communication and most of them are based on process algebra. However as we reported [7, 8], it is not easy to represent the scopes of names of communication channels precisely using process algebra. We present a model of concurrent programs with higher order communication that can represent the scopes of names precisely. The model presented here is an extension of the model reported in [8] that is based on graph rewriting. We define the equivalence relation such that if the equivalence holds on two programs then they are equivalent not only on their behaviors but on the scopes of names also. This article also presents a compilation of higher-order concurrent programs into first-order name passing programs on the graph rewriting model.

AB - This article presents a formal model of concurrent systems with higher-order communication to transfer program codes as data between processes. A number of models [1,14,15] are reported as models of higher-order communication and most of them are based on process algebra. However as we reported [7, 8], it is not easy to represent the scopes of names of communication channels precisely using process algebra. We present a model of concurrent programs with higher order communication that can represent the scopes of names precisely. The model presented here is an extension of the model reported in [8] that is based on graph rewriting. We define the equivalence relation such that if the equivalence holds on two programs then they are equivalent not only on their behaviors but on the scopes of names also. This article also presents a compilation of higher-order concurrent programs into first-order name passing programs on the graph rewriting model.

UR - http://www.scopus.com/inward/record.url?scp=84896554760&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896554760&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:84896554760

SN - 9781607410119

SP - 373

EP - 394

BT - Emerging Topics on Differential Geometry and Graph Theory

PB - Nova Science Publishers, Inc.

ER -