Abstract
This paper presents a formal model of concurrent systems based on graph rewriting to represent scopes of communication channel names precisely. A bipartite directed acyclic graph represents a concurrent system consists of a number of processes and messages. Each process or message corresponds to a source node of the graph. Names of communication channel in the system are sink nodes. The edges of the graph represent the scopes of the names in the system. The operational semantics of the system is given as a labeled transition system. The model presented here makes it possible to represent local names that their scope are not nested. We define the weak bisimulation equivalence relation that two systems are equivalent in their behavior. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.
| Original language | English |
|---|---|
| Title of host publication | 5th International Conference on Information Technology and Applications, ICITA 2008 |
| Pages | 636-641 |
| Number of pages | 6 |
| Publication status | Published - 2008 |
| Event | 5th International Conference on Information Technology and Applications, ICITA 2008 - Cairns, QLD, Australia Duration: Jun 23 2008 → Jun 26 2008 |
Other
| Other | 5th International Conference on Information Technology and Applications, ICITA 2008 |
|---|---|
| Country | Australia |
| City | Cairns, QLD |
| Period | 6/23/08 → 6/26/08 |
Fingerprint
Keywords
- π-calculus
- Bisimilarity
- Graph rewriting
- Parallel And distributed computing
- Theory of concurrency
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Science Applications
- Information Systems
- Software
Cite this
Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs. / Murakami, Masaki.
5th International Conference on Information Technology and Applications, ICITA 2008. 2008. p. 636-641.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Congruence results of behavioral equivalence for a graph rewriting model of concurrent programs
AU - Murakami, Masaki
PY - 2008
Y1 - 2008
N2 - This paper presents a formal model of concurrent systems based on graph rewriting to represent scopes of communication channel names precisely. A bipartite directed acyclic graph represents a concurrent system consists of a number of processes and messages. Each process or message corresponds to a source node of the graph. Names of communication channel in the system are sink nodes. The edges of the graph represent the scopes of the names in the system. The operational semantics of the system is given as a labeled transition system. The model presented here makes it possible to represent local names that their scope are not nested. We define the weak bisimulation equivalence relation that two systems are equivalent in their behavior. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.
AB - This paper presents a formal model of concurrent systems based on graph rewriting to represent scopes of communication channel names precisely. A bipartite directed acyclic graph represents a concurrent system consists of a number of processes and messages. Each process or message corresponds to a source node of the graph. Names of communication channel in the system are sink nodes. The edges of the graph represent the scopes of the names in the system. The operational semantics of the system is given as a labeled transition system. The model presented here makes it possible to represent local names that their scope are not nested. We define the weak bisimulation equivalence relation that two systems are equivalent in their behavior. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.
KW - π-calculus
KW - Bisimilarity
KW - Graph rewriting
KW - Parallel And distributed computing
KW - Theory of concurrency
UR - http://www.scopus.com/inward/record.url?scp=67649235970&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67649235970&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:67649235970
SN - 9780980326727
SP - 636
EP - 641
BT - 5th International Conference on Information Technology and Applications, ICITA 2008
ER -