On the Complexity of Reasoning About Dynamic Policies

DOI10.1007/978-3-540-74915-8_28MaRDI QIDQ3608424zbMATH OpenOpenAlexFDO

Authors Stefan Göller

Publication date 5 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74915-8_28

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A Reduction from DLP to PDL
• Foundations of Software Science and Computation Structures
• Dynamic logic of propositional assignments: a well-behaved variant of PDL
• Privacy policies with modal logic: the dynamic turn
• Dynamic process logic

Cited in

(6)

• A game theoretic approach to the analysis of dynamic networks
• Chasing Ghosts: Competing with Stateful Policies
• A Reduction from DLP to PDL
• Separation logics and modalities: a survey
• Privacy policies with modal logic: the dynamic turn
• Foundations of Software Science and Computation Structures

This page was built for publication: On the Complexity of Reasoning About Dynamic Policies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608424)