309 search results - page 26 / 62 » Model Checking Games for Branching Time Logics |
107
click to vote
CADE
2002
Springer
16 years 2 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...
CONCUR
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
DATE
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract. We propose an approach to scenario-based analysis and synthesis of real-time embedded systems. The inter-process behaviors of a system are modeled as a set of driving uni...
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...