Abstract
In this paper we investigate extensions of dynamic logic tailored towards handling concurrent programs, with or without communication. The basic version of concurrent dynamic logic, CDL, is a natural extension of regular DL, and is shown to possess most desirable properties of DL. We further explore its relationships with the m-calculus, DL with recursive procedures and PTIME, strengthening natural connections between concurrency, recursion and alternation.Communication is introduced into the program schemes of CDL by means of channels and shared variables. The effects of these mechanisms on issues of expressiveness and decidability are investigated. In general, we find that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded) counting are enabled in the system. Connections with actual concurrent languages such as CSP are discussed on the first-order level.
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.
