K. R. Abrahamson, Modal logic of concurrent nondeterministic programs, Semantics of Concurrent Computation, vol.70, pp.21-33, 1979.

P. Balbiani and J. Boudou, Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization, J. Logic Comput, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01739996

P. Balbiani and T. Tinchev, Definability and computability for PRSPDL, Advances in Modal Logic, pp.16-33, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01650181

M. R. Benevides, R. P. De-freitas, and J. P. Viana, Propositional dynamic logic with storing, recovering and parallel composition, ENTCS, vol.269, pp.95-107, 2011.

P. Blackburn, M. De-rijke, and Y. Venema, Modal Logic, Cambridge Tracts in Theoretical Computer Science, vol.53, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100503

L. Cardelli and A. D. Gordon, Anytime, anywhere: modal logics for mobile ambients, pp.365-377, 2000.

M. Collinson and D. J. Pym, Algebra and logic for resource-based systems modelling, Math. Struct. Comput. Sci, vol.19, issue.5, pp.959-1027, 2009.

S. Demri and M. Deters, Separation logics and modalities: a survey, J. Appl. Non Class. Logics, vol.25, issue.1, pp.50-99, 2015.

H. Van-ditmarsch, W. Van-der-hoek, and B. P. Kooi, Dynamic Epistemic Logic, vol.337, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00868361

M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs, J. Comput. Syst. Sci, vol.18, issue.2, pp.194-211, 1979.

D. Harel, Recurring dominoes: making the highly undecidable highly understandable (preliminary report), Fundamentals of Computation Theory, vol.158, pp.177-194, 1983.

M. Lange and C. Lutz, 2-exptime lower bounds for propositional dynamic logics with intersection, J. Symb. Log, vol.70, issue.4, pp.1072-1086, 2005.

D. Larchey-wendling and D. Galmiche, The undecidability of boolean BI through phase semantics, LICS, pp.140-149, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00577919

M. Marx, L. Pólos, and M. Masuch, Arrow Logic and Multi-modal Logic, 1996.

A. J. Mayer and L. J. Stockmeyer, The complexity of PDL with interleaving, Theor. Comput. Sci, vol.161, issue.1-2, pp.109-122, 1996.

D. Peleg, Concurrent dynamic logic, J. ACM, vol.34, issue.2, pp.450-479, 1987.

D. J. Pym, The semantics and proof theory of the logic of bunched implications, Applied Logic Series, vol.26, 2002.

J. C. Reynolds, Separation logic: A logic for shared mutable data structures, LICS, pp.55-74, 2002.