2873 search results - page 70 / 575 » Model Checking and the Mu-calculus |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
ENTCS
2008
14 years 10 months ago
2008
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
TASE
2007
IEEE
15 years 4 months ago
2007
IEEE
Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD-based symbolic model checking of LTL and ACTL properties in recent years. For genera...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...