✦ LIBER ✦

Model Checking for Hybrid Logic

✍ Scribed by Martin Lange

Publisher: Springer Netherlands
Year: 2009
Tongue: English
Weight: 758 KB
Volume: 18
Category: Article
ISSN: 0925-8531
DOI: 10.1007/s10849-009-9088-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Model checking for action-based logics

✍ Alessandro Fantechi; Stefania Gnesi; Gioia Ristori 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 813 KB

Model checking hybrid logics (with an ap

Model checking hybrid logics (with an application to semistructured data)

✍ Massimo Franceschet; Maarten de Rijke 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 259 KB

Polytime model checking for timed probab

Polytime model checking for timed probabilistic computation tree logic

✍ Danièle Beauquier; Anatol Slissenko 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 204 KB

Model checking for a probabilistic branc

Model checking for a probabilistic branching time logic with fairness

✍ Christel Baier; Marta Kwiatkowska 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 698 KB

∞-Regular temporal logic and its model c

∞-Regular temporal logic and its model checking problem

✍ Kiyoharu Hamaguchi; Hiromi Hiraishi; Shuzo Yajima 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 888 KB

Model checking propositional dynamic log

Model checking propositional dynamic logic with all extras

✍ Martin Lange 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 116 KB

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