Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs

Authors:
Masaki Murakami
Affiliations:
Mathematical Science and Electronic Technology, Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan 700-0082
Venue:
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Year:
2008

Citing 6
Cited 0

Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Asynchronous process calculi: the first-and higher-order paradigms

Theoretical Computer Science - Special issues on models and paradigms for concurrency
Bigraphical Reactive Systems

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Reactive Systems over Cospans

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A formal model of concurrent systems based on bipartite directed acyclic graph

Science of Computer Programming - Special issue on quality system and software architectures
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 an equivalence relation that two systems are equivalent not only in their behavior but in extrusions of scopes of names. We show that the equivalence relation is a congruence relation wrt prefix, new-name, replication and composition.