254 search results - page 19 / 51 » Model Checking Branching Time Logics |
119
click to vote
TIME
2003
IEEE
15 years 5 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
104
click to vote
TIME
2009
IEEE
15 years 6 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
107
click to vote
CADE
2002
Springer
16 years 1 days ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
AAAI
2004
15 years 1 months ago
2004
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
APN
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...