✦ LIBER ✦

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 6756 || A Progress Measure for Explicit-State Probabilistic Model-Checkers

✍ Scribed by Aceto, Luca; Henzinger, Monika; Sgall, Jiří

Book ID: 120254827
Publisher: Springer Berlin Heidelberg
Year: 2011
Weight: 198 KB
Category: Article
ISBN: 3642220126
DOI: 10.1007/978-3-642-22012-8_22

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 510 || Model-checking for probabilistic real-time systems

✍ Albert, Javier Leach; Monien, Burkhard; Artalejo, Mario Rodríguez 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 949 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 623 || Testing preorders for probabilistic processes

✍ Kuich, W. 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 998 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 3142 || A Categorical Model for the Geometry of Interaction

✍ Díaz, Josep; Karhumäki, Juhani; Lepistö, Arto; Sannella, Donald 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 235 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 3580 || Influential Nodes in a Diffusion Model for Social Networks

✍ Caires, Luís; Italiano, Giuseppe F.; Monteiro, Luís; Palamidessi, Catuscia; Yung 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 148 KB

The 32nd International Colloquium On Automata, Languages And Programming (icalp 2005) Was Held In Lisbon, Portugal From July 11 To July 15, 2005. These Proceedings Contain All Contributed Papers Presented At Icalp 2005, - Getherwiththepapersbytheinvitedspeakersgiuseppecastagna(ens),leonid Libkin (to

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 510 || A specialized completion procedure for monadic string-rewriting systems presenting groups

✍ Albert, Javier Leach; Monien, Burkhard; Artalejo, Mario Rodríguez 📂 Article 📅 1991 🏛 Springer Berlin Heidelberg ⚖ 950 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 226 || A very fast, practical algorithm for finding a negative cycle in a digraph

✍ Kott, Laurent 📂 Article 📅 1986 🏛 Springer Berlin Heidelberg ⚖ 674 KB