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 language | English |
|---|---|
| Title of host publication | International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008 |
| Pages | 80-87 |
| Number of pages | 8 |
| Publication status | Published - 2008 |
| Event | 2008 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2008 - Orlando, FL, United States Duration: Jul 7 2008 → Jul 10 2008 |
Other
| Other | 2008 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2008 |
|---|---|
| Country | United States |
| City | Orlando, FL |
| Period | 7/7/08 → 7/10/08 |
Fingerprint
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Applied Mathematics
Cite this
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 proceeding › Conference contribution
}
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 -