✦ LIBER ✦

Local model checking for infinite state spaces

✍ Scribed by Julian Bradfield; Colin Stirling

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 971 KB
Volume: 96
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90183-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decidability of model checking for infin

Decidability of model checking for infinite-state concurrent systems

✍ Javier Esparza 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 223 KB

Model checking the full modal mu-calculu

Model checking the full modal mu-calculus for infinite sequential processes

✍ Olaf Burkart; Bernhard Steffen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 983 KB

It is known that pushdown processes have a decidable monadic second-order theory (Muller and Schupp, Theoret. Comput. Sci. 37 (1985) 51-75) and that this result covers the model-checking problem for the modal mu-calculus. Unfortunately, the corresponding decidability procedure is not practical due t

Space-Reduction Strategies for Model Che

Space-Reduction Strategies for Model Checking Dynamic Software

✍ Robby; Matthew B. Dwyer; John Hatcliff; Radu Iosif 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Predicate Abstraction and Refinement for

Predicate Abstraction and Refinement for Model Checking VHDL State Machines

✍ Mustapha Bourahla; Mohamed Benmohamed 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Effective State Exploration for Model Ch

Effective State Exploration for Model Checking on a Shared Memory Architecture

✍ Cornelia P. Inggs; Howard Barringer 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Smoothing algorithms for state–space mod

Smoothing algorithms for state–space models

✍ Mark Briers; Arnaud Doucet; Simon Maskell 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 440 KB