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 - Dec 1 2008
Event2008 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2008 - Orlando, FL, United States
Duration: Jul 7 2008Jul 10 2008

Publication series

NameInternational Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008

Other

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

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A graph rewriting model of concurrent programs with higher-order communication'. Together they form a unique fingerprint.

  • 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). (International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008).