713 search results - page 15 / 143 » Model Checking and Transitive-Closure Logic |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
113
click to vote
CONCUR
2006
Springer
15 years 20 days ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
126
click to vote
VVEIS
2007
14 years 12 months ago
2007
Logic programming has been successfully used for reasoning about various kinds of models. However, in the area of business-process modeling it has not yet gained the attention it d...
TACAS
2001
Springer
15 years 3 months ago
2001
Springer
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complet...
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.