Tableaux methods for propositional dynamic logics with separating parallel composition
Résumé
PRSPDL is a propositional dynamic logic with an operator for parallel compositions of programs. We first give a complexity upper bound for this logic. Then we focus on the class of ⊲-deterministic frames and give tableaux methods for two fragments of PRSPDL over this class of frames.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...