Congruence Results of Behavioral Equivalence for A Graph Rewriting Model of Concurrent Programs with Higher-Order Communication
Masaki Murakami
Journal of Networking Technology, Vol. 1, No. 3, 2010.
DOI: 
Link: http://www.dline.info/jnt/fulltext/v1n3/1.pdf
Abstract:
This paper presents congruence results of a behavioural equivalence on a graph rewriting model of concurrent pro cesses with higher-order communication. A bipartite di rected 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 repre sent local names that their scopes are not nested. We show that strong bisimulation equivalence relation is a congru ence relation w.r.t. operations that correspond to Ãœ-prefix, input prefix, new-name, replication, composition and appli cation respectively.