Abstract
This paper presents congruence results of a weak equivalence on a graph rewriting model of concurrent processes with higher-order communication. A bipartite directed acyclic graph represents a concurrent system that consists of a number of processes and messages in our model. The model presented here makes it possible to represent local names that their scopes are not nested. We show that weak bisimulation equivalence is a congruence relation w.r.t. operations that correspond to τ-prefix, input prefix, new-name, replication, composition and application respectively.
| Original language | English |
|---|---|
| Title of host publication | Communications in Computer and Information Science |
| Pages | 171-180 |
| Number of pages | 10 |
| Volume | 154 CCIS |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 3rd International Conference on Wireless, Mobile Networks and Applications, WiMoA 2011 and the 1st International Conference on Computer Science, Engineering and Applications, ICCSEA 2011 - Dubai, United Arab Emirates Duration: May 25 2011 → May 27 2011 |
Publication series
| Name | Communications in Computer and Information Science |
|---|---|
| Volume | 154 CCIS |
| ISSN (Print) | 18650929 |
Other
| Other | 3rd International Conference on Wireless, Mobile Networks and Applications, WiMoA 2011 and the 1st International Conference on Computer Science, Engineering and Applications, ICCSEA 2011 |
|---|---|
| Country | United Arab Emirates |
| City | Dubai |
| Period | 5/25/11 → 5/27/11 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
Cite this
Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication. / Murakami, Masaki.
Communications in Computer and Information Science. Vol. 154 CCIS 2011. p. 171-180 (Communications in Computer and Information Science; Vol. 154 CCIS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication
AU - Murakami, Masaki
PY - 2011
Y1 - 2011
N2 - This paper presents congruence results of a weak equivalence on a graph rewriting model of concurrent processes with higher-order communication. A bipartite directed acyclic graph represents a concurrent system that consists of a number of processes and messages in our model. The model presented here makes it possible to represent local names that their scopes are not nested. We show that weak bisimulation equivalence is a congruence relation w.r.t. operations that correspond to τ-prefix, input prefix, new-name, replication, composition and application respectively.
AB - This paper presents congruence results of a weak equivalence on a graph rewriting model of concurrent processes with higher-order communication. A bipartite directed acyclic graph represents a concurrent system that consists of a number of processes and messages in our model. The model presented here makes it possible to represent local names that their scopes are not nested. We show that weak bisimulation equivalence is a congruence relation w.r.t. operations that correspond to τ-prefix, input prefix, new-name, replication, composition and application respectively.
UR - http://www.scopus.com/inward/record.url?scp=79960032162&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960032162&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-21153-9_16
DO - 10.1007/978-3-642-21153-9_16
M3 - Conference contribution
SN - 9783642211522
VL - 154 CCIS
T3 - Communications in Computer and Information Science
SP - 171
EP - 180
BT - Communications in Computer and Information Science
ER -