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 publicationAdvances in Wireless, Mobile Networks and Applications - International Conferences WiMoA 2011 and ICCSEA 2011, Proceedings
Pages171-180
Number of pages10
DOIs
Publication statusPublished - Jul 12 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)1865-0929

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Congruence results of weak equivalence for a graph rewriting model of concurrent programs with higher-order communication'. Together they form a unique fingerprint.

  • 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