### 10 papers:

- LICS-2015-Carreiro #bisimulation #invariant #logic
- PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic (FC), pp. 341–352.
- IJCAR-2014-Gore #fixpoint #logic #ltl
- And-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDL (RG), pp. 26–45.
- LICS-2013-BalbianiHT #logic
- Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL (PB, AH, NT), pp. 143–152.
- CADE-2009-GoreW #on the fly #satisfiability
- An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability (RG, FW), pp. 437–452.
- FoSSaCS-2007-GollerLL
- PDL with Intersection and Converse Is 2 EXP-Complete (SG, ML, CL), pp. 198–212.
- CSL-2005-Lutz #decidability
- PDL with Intersection and Converse Is Decidable (CL), pp. 413–427.
- IJCAR-2004-LutzW #source code
- PDL with Negation of Atomic Programs (CL, DW), pp. 259–273.
- STOC-1983-Kozen #probability
- A Probabilistic PDL (DK), pp. 291–297.
- POPL-1982-ShermanPH #logic #process
- Is the Interesting Part of Process Logic Uninteresting — A Translation from PL to PDL (RS, AP, DH), pp. 347–360.
- ICALP-1980-Kozen #modelling #representation #theorem
- A Representation Theorem for Models of *-Free PDL (DK), pp. 351–362.