Abstract
Most of the basic decision problems concerning derivations in cooperating distributed grammar systems have so far been open, possibly because of the lack of unifying methods and techniques. In this paper such a unifying device is proposed. It is called a coverability tree because it bears some resemblance to the coverability graph of place/transition Petri nets and vector addition systems. The coverability tree is always finite, which leads to rather strong decidability properties concerning both arbitrary and terminal derivations. Our method is largely independent of the mode of the derivations and answers most of the direct decidability questions about the components of the system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
