On a connection between cooperating distributed grammar systems and basic process algebra

Erzsébet Csuhaj-Varjú, Alexandru Mateescu

Research output: Contribution to journalArticle

Abstract

In this paper we discuss some relationships between cooperating distributed (CD) grammar systems and the basic process algebra (BPA) calculus. We associate different types of process graphs from this calculus to CD grammar systems which describe the behavior of the components of the system under cooperation. We prove that these process graphs form a subalgebra of the graph model of BPA. It is also shown that for certain restricted variants of CD grammar systems and for certain types of these process graphs the bisimilarity of two process graphs is decidable.

Original languageEnglish
Pages (from-to)37-50
Number of pages14
JournalFundamenta Informaticae
Volume73
Issue number1-2
Publication statusPublished - Sep 11 2006

Keywords

  • Basic process algebra
  • Cooperating distributed grammar systems
  • Process graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Algebra and Number Theory
  • Information Systems
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'On a connection between cooperating distributed grammar systems and basic process algebra'. Together they form a unique fingerprint.

  • Cite this