Congruence results of scope equivalence for a graph rewriting model of concurrent programs

Masaki Murakami

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

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationTheoretical Aspects of Computing - ICTAC 2008 - 5th International Colloquium, Proceedings
Pages243-257
Number of pages15
DOIs
Publication statusPublished - Sep 22 2008
Event5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008 - Istanbul, Turkey
Duration: Sep 1 2008 → Sep 3 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5160 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008
CountryTurkey
CityIstanbul
Period9/1/08 → 9/3/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Access to Document

Fingerprint Dive into the research topics of 'Congruence results of scope equivalence for a graph rewriting model of concurrent programs'. Together they form a unique fingerprint.

    • Cite this

    Murakami, M. (2008). Congruence results of scope equivalence for a graph rewriting model of concurrent programs. In Theoretical Aspects of Computing - ICTAC 2008 - 5th International Colloquium, Proceedings (pp. 243-257). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5160 LNCS). https://doi.org/10.1007/978-3-540-85762-4_17