On two-sided approximate model-checking: problem formulation and solution via finite topologies
We give a general formulation of approximate model- checking, in which both under- and over-approximations are propagated to give two-sided approximations of the denotation set of an arbitrarily complex formula. As our specification language, we use the modal μ-calculus, since it subsumes standard linear and branching temporal logics over transition systems like LTL, CTL and CTL*. We give a general construction of a topological finite approximation scheme for a Kripke model from a state-space...[Show more]
|Collections||ANU Research Publications|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.