Skip to main content
Conference Proceedings

Tableaux methods for propositional dynamic logics with separating parallel composition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9195 539-554
DOI: 10.1007/978-3-319-21401-6_37
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Balbiani, P., & Boudou, J. (2015). Tableaux methods for propositional dynamic logics with separating parallel composition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9195, pp. 539–554). Springer Verlag. https://doi.org/10.1007/978-3-319-21401-6_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free