Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication

Masaki Murakami

doi:10.1007/978-3-642-21153-9_16

Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication

Masaki Murakami

Center for Information Technology and Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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	Advances in Wireless, Mobile Networks and Applications - International Conferences WiMoA 2011 and ICCSEA 2011, Proceedings
Pages	171-180
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-642-21153-9_16
Publication status	Published - Jul 12 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)	1865-0929

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/Territory	United Arab Emirates
City	Dubai
Period	5/25/11 → 5/27/11

ASJC Scopus subject areas

Computer Science(all)
Mathematics(all)

Access to Document

10.1007/978-3-642-21153-9_16

Cite this

Murakami, M. (2011). Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication. In Advances in Wireless, Mobile Networks and Applications - International Conferences WiMoA 2011 and ICCSEA 2011, Proceedings (pp. 171-180). (Communications in Computer and Information Science; Vol. 154 CCIS). https://doi.org/10.1007/978-3-642-21153-9_16

Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication. / Murakami, Masaki.

Advances in Wireless, Mobile Networks and Applications - International Conferences WiMoA 2011 and ICCSEA 2011, Proceedings. 2011. p. 171-180 (Communications in Computer and Information Science; Vol. 154 CCIS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Murakami, M 2011, Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication. in Advances in Wireless, Mobile Networks and Applications - International Conferences WiMoA 2011 and ICCSEA 2011, Proceedings. Communications in Computer and Information Science, vol. 154 CCIS, pp. 171-180, 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, 5/25/11. https://doi.org/10.1007/978-3-642-21153-9_16

@inproceedings{c8d7261cccc044a39b3cb04e2858f6de,

title = "Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication",

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.",

author = "Masaki Murakami",

year = "2011",

month = jul,

day = "12",

doi = "10.1007/978-3-642-21153-9_16",

language = "English",

isbn = "9783642211522",

series = "Communications in Computer and Information Science",

pages = "171--180",

booktitle = "Advances in Wireless, Mobile Networks and Applications - International Conferences WiMoA 2011 and ICCSEA 2011, Proceedings",

note = "3rd International Conference on Wireless, Mobile Networks and Applications, WiMoA 2011 and the 1st International Conference on Computer Science, Engineering and Applications, ICCSEA 2011 ; Conference date: 25-05-2011 Through 27-05-2011",

}

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/7/12

Y1 - 2011/7/12

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

AN - SCOPUS:79960032162

SN - 9783642211522

T3 - Communications in Computer and Information Science

SP - 171

EP - 180

BT - Advances in Wireless, Mobile Networks and Applications - International Conferences WiMoA 2011 and ICCSEA 2011, Proceedings

T2 - 3rd International Conference on Wireless, Mobile Networks and Applications, WiMoA 2011 and the 1st International Conference on Computer Science, Engineering and Applications, ICCSEA 2011

Y2 - 25 May 2011 through 27 May 2011

ER -

Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this