Article ID Journal Published Year Pages File Type
4952069 Theoretical Computer Science 2017 23 Pages PDF
Abstract
We also add to PDL+ the parallel composition operator (PPDL+) and prove its soundness and completeness. We establish that the satisfiability problem for PPDL+ is in 2-EXPTIME. Finally, we define some fragments of PPDL+ and prove its EXPTIME-completeness.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Bisimilar and logically equivalent programs in PDL with parallel operator
Authors
,