Abstract
It is proved that validity problems for two variants of propositional dynamic logic (PDL) connected with concurrent programming are highly undecidable (∏ 1 1-universal). These variants are an extension of PDL by asynchronous programming constructs shuffle and iterated shuffle and a variant of PDL with a partial commutativity relation on primitive programs. In both cases propositional variables are not used.
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.
