This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context-free programs. The algorithm shows that the model checking problem for PDL remains PTIME-complete in the presence of all
โฆ LIBER โฆ
Propositional dynamic logic with local assignment
โ Scribed by M.L. Tiomkin; J.A. Makowsky
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 926 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Model checking propositional dynamic log
โ
Martin Lange
๐
Article
๐
2006
๐
Elsevier Science
๐
English
โ 116 KB
Sequential method in propositional dynam
โ
Hirokazu Nishimura
๐
Article
๐
1979
๐
Springer-Verlag
๐
English
โ 832 KB
CUT ELIMINATION FOR PROPOSITIONAL DYNAMI
โ
Robert A. Bull
๐
Article
๐
1992
๐
John Wiley and Sons
๐
English
โ 764 KB
## Abstract The aim of this paper is to extend the semantic analysis of tense logic in Rescher/Urquhart [3] to propositional dynamic logic without\*. For this we develop a nested sequential calculus whose axioms and rules directly reflect the steps in the semantic analysis. It is shown that this ca
Semantics of looping programs in Proposi
โ
Francine Berman
๐
Article
๐
1981
๐
Springer
๐
English
โ 601 KB
A Sequent Calculus for Propositional Dyn
โ
J. Sakalauskaite
๐
Article
๐
2005
๐
Springer
๐
English
โ 204 KB
Deterministic propositional dynamic logi
โ
Mordechai Ben-Ari; Joseph Y. Halpern; Amir Pnueli
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 911 KB