On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra

Authors:
Erzsébet Csuhaj-Varjú;Alexandru Mateescu
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciencesm Kende utca 13-17, H-1111 Budapest, Hungary. E-mail: csuhaj@sztaki.hu;-
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Year:
2006

Citing 8
Cited 0

Decidability of bisimulation equivalence for processes generating context-free languages

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Three partition refinement algorithms

SIAM Journal on Computing
On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
Grammar systems

Handbook of formal languages, vol. 2
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Quantified Score

Hi-index	0.00

Visualization

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.