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)
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 2
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
Hi-index | 0.00 |
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.