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

Research output: Chapter in Book/Report/Conference proceedingConference 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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages243-257
Number of pages15
Volume5160 LNCS
DOIs
Publication statusPublished - 2008
Event5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008 - Istanbul, Turkey
Duration: Sep 1 2008Sep 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Graph Rewriting
Congruence
Names
Concurrent
Equivalence
Concurrent Systems
Communication Channels
Equivalence relation
Extrusion
Semantics
Congruence Relation
Labeled Transition System
Directed Acyclic Graph
Operational Semantics
Prefix
Formal Model
Graph in graph theory
Vertex of a graph
Chemical analysis
Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Murakami, M. (2008). Congruence results of scope equivalence for a graph rewriting model of concurrent programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5160 LNCS, 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

Congruence results of scope equivalence for a graph rewriting model of concurrent programs. / Murakami, Masaki.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5160 LNCS 2008. p. 243-257 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5160 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Murakami, M 2008, Congruence results of scope equivalence for a graph rewriting model of concurrent programs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5160 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5160 LNCS, pp. 243-257, 5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008, Istanbul, Turkey, 9/1/08. https://doi.org/10.1007/978-3-540-85762-4_17
Murakami M. Congruence results of scope equivalence for a graph rewriting model of concurrent programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5160 LNCS. 2008. p. 243-257. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-85762-4_17
Murakami, Masaki. / Congruence results of scope equivalence for a graph rewriting model of concurrent programs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5160 LNCS 2008. pp. 243-257 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c84df9121c7049c9ac0168f367c43ec9,
title = "Congruence results of scope equivalence for a graph rewriting model of concurrent programs",
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.",
author = "Masaki Murakami",
year = "2008",
doi = "10.1007/978-3-540-85762-4_17",
language = "English",
isbn = "3540857613",
volume = "5160 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "243--257",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Murakami, Masaki

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=51849169422&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51849169422&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85762-4_17

DO - 10.1007/978-3-540-85762-4_17

M3 - Conference contribution

SN - 3540857613

SN - 9783540857617

VL - 5160 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 243

EP - 257

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -