### 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 language | English |
---|---|

Pages (from-to) | 37-50 |

Number of pages | 14 |

Journal | Fundamenta Informaticae |

Volume | 73 |

Issue number | 1-2 |

Publication status | Published - 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

Csuhaj-Varjú, E., & Mateescu, A. (2006). On a connection between cooperating distributed grammar systems and basic process algebra.

*Fundamenta Informaticae*,*73*(1-2), 37-50.