Vol. 15 No. 5, © The Author, 2005. Published by Oxford University Press. All rights reserved.
Original Articles |
A Reduction from DLP to PDL
Laboratoire Spécification et Vérification, CNRS & INRIA Futurs projet SECSI & ENS Cachan, 61, av. Pdt. Wilson, 94235 Cachan Cedex, France. Email: demri{at}lsv.ens-cachan.fr
We present a reduction from a new logic extending van der Meyden's dynamic logic of permission (DLP) into propositional dynamic logic (PDL), providing a 2EXPTIME decision procedure and showing that all the machinery for PDL can be reused for reasoning about dynamic policies. As a side-effect, we establish that DLP is EXPTIME-complete. The logic we introduce extends the logic DLP so that the policy set can be updated depending on its current value and such an update corresponds to add/delete transitions in the model, showing similarities with van Benthem's sabotage modal logic.
Keywords: Dynamic logic of permissions, logic of programs, deletion of states/transitions, computational complexity
Received 3 May 2004.