✦ LIBER ✦

Polytime model checking for timed probabilistic computation tree logic

✍ Scribed by Danièle Beauquier; Anatol Slissenko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Model checking for a probabilistic branc

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

Comparing model checking and logical rea

✍ Henning Dierks 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 242 KB

Fully Symbolic Unbounded Model Checking

✍ Magdalena Kacprzak; Wojciech Penczek 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB

A Sat-Based Approach to Unbounded Model

✍ M. Kacprzak; W. Penczek 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 210 KB