Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Session 1: Equivalence Checking

Taming infinite state spaces

Colin Sterling1

(1)  Department of Computer Science, University of Edinburgh, EH9 3JZ Edinburgh, UK
Abstract
We present a sound and complete tableau proof system for establishing whether a set of elements of an arbitrary transition system model has a property expressed in (a slight extension of) the modal mu-calculus. The proof system, we beleive, offers a very general verification method applicable to a wide range of computational systems.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext


Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.110 • Server: mpweb22
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)