A rational design process: How and why to fake it
IEEE Transactions on Software Engineering
Concurrent programming
Some hierarchies for the communication complexity measures of cooperating grammar systems
Theoretical Computer Science
On a method of multiprogramming
On a method of multiprogramming
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
The Science of Programming
Handbook of Formal Languages
A Discipline of Programming
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
PC Grammar Systems Versus Some Non-Context-Free Constructions from Natural and Artificial Languages
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Hi-index | 0.00 |
The aim of this note is to show how parallel communicating grammar systems and concurrent programs might be viewed as related models for distributed and cooperating computation. We argue that a grammar system can be translated into a concurrent program, where one can make use of the Owicki-Gries theory and other tools available in the theory of concurrent programming. The converse translation is also possible and this turns out to be useful when we are looking for a grammar system able to generate a given language. In order to show this, we use the language: L$_{cd}$ = {a$^n$b$^m$c$^n$d$^m$∣ n,m ⩾ 1}, called crossed agreement language, one of the basic non-context free constructions in natural and artificial languages. We prove, using tools from concurrent programming theory, that L$_{cd}$ can be generated by a nonreturning parallel communicating grammar system with three regular components. We also discuss the absence of strategies in the concurrent programming theory to prove that L$_{cd}$ cannot be generated by any parallel communicating grammar system with two regular components only, no matter the working strategy, but we prove this statement in the grammar system framework.