A graph rewriting model of concurrent programs with higher-order communication

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

This paper presents a formal model of concurrent systems with higher-order communication to transfer program codes as data between processes. A number of models [1, 9] are reported as models of higher-order communication and most of them are based on process algebra. However as we reported [7], 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 [7] 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.

Original languageEnglish
Title of host publicationInternational Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008
Pages80-87
Number of pages8
Publication statusPublished - 2008
Event2008 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2008 - Orlando, FL, United States
Duration: Jul 7 2008Jul 10 2008

Other

Other2008 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2008
CountryUnited States
CityOrlando, FL
Period7/7/087/10/08

Fingerprint

Graph Rewriting
Concurrent
Higher Order
Communication
Process Algebra
Algebra
Model
Concurrent Systems
Communication Channels
Formal Model
Equivalence relation
Equivalence

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Murakami, M. (2008). A graph rewriting model of concurrent programs with higher-order communication. In International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008 (pp. 80-87)

A graph rewriting model of concurrent programs with higher-order communication. / Murakami, Masaki.

International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008. 2008. p. 80-87.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Murakami, M 2008, A graph rewriting model of concurrent programs with higher-order communication. in International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008. pp. 80-87, 2008 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2008, Orlando, FL, United States, 7/7/08.
Murakami M. A graph rewriting model of concurrent programs with higher-order communication. In International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008. 2008. p. 80-87
Murakami, Masaki. / A graph rewriting model of concurrent programs with higher-order communication. International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008. 2008. pp. 80-87
@inproceedings{648d8899041043c798b5a883876ce4fb,
title = "A graph rewriting model of concurrent programs with higher-order communication",
abstract = "This paper presents a formal model of concurrent systems with higher-order communication to transfer program codes as data between processes. A number of models [1, 9] are reported as models of higher-order communication and most of them are based on process algebra. However as we reported [7], 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 [7] 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.",
author = "Masaki Murakami",
year = "2008",
language = "English",
isbn = "9781615677207",
pages = "80--87",
booktitle = "International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008",

}

TY - GEN

T1 - A graph rewriting model of concurrent programs with higher-order communication

AU - Murakami, Masaki

PY - 2008

Y1 - 2008

N2 - This paper presents a formal model of concurrent systems with higher-order communication to transfer program codes as data between processes. A number of models [1, 9] are reported as models of higher-order communication and most of them are based on process algebra. However as we reported [7], 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 [7] 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.

AB - This paper presents a formal model of concurrent systems with higher-order communication to transfer program codes as data between processes. A number of models [1, 9] are reported as models of higher-order communication and most of them are based on process algebra. However as we reported [7], 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 [7] 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.

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

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

M3 - Conference contribution

AN - SCOPUS:84878159974

SN - 9781615677207

SP - 80

EP - 87

BT - International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008

ER -