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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationCommunications in Computer and Information Science
Pages171-180
Number of pages10
Volume154 CCIS
DOIs
Publication statusPublished - 2011
Event3rd 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 2011May 27 2011

Publication series

NameCommunications in Computer and Information Science
Volume154 CCIS
ISSN (Print)18650929

Other

Other3rd International Conference on Wireless, Mobile Networks and Applications, WiMoA 2011 and the 1st International Conference on Computer Science, Engineering and Applications, ICCSEA 2011
CountryUnited Arab Emirates
CityDubai
Period5/25/115/27/11

Fingerprint

Communication
Chemical analysis

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Murakami, M. (2011). Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication. In Communications in Computer and Information Science (Vol. 154 CCIS, 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.

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 proceedingConference contribution

Murakami, M 2011, Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication. in Communications in Computer and Information Science. vol. 154 CCIS, 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
Murakami M. Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication. In Communications in Computer and Information Science. Vol. 154 CCIS. 2011. p. 171-180. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-21153-9_16
Murakami, Masaki. / Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication. Communications in Computer and Information Science. Vol. 154 CCIS 2011. pp. 171-180 (Communications in Computer and Information Science).
@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",
doi = "10.1007/978-3-642-21153-9_16",
language = "English",
isbn = "9783642211522",
volume = "154 CCIS",
series = "Communications in Computer and Information Science",
pages = "171--180",
booktitle = "Communications in Computer and Information Science",

}

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 -