955 search results - page 133 / 191 » Tractable Temporal Reasoning |
107
click to vote
CADE
2002
Springer
16 years 5 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 ...
106
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...
TIME
2009
IEEE
15 years 6 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
118
click to vote
TIME
2006
IEEE
15 years 5 months ago
2006
IEEE
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
WWW
2006
ACM
15 years 5 months ago
2006
ACM
A Service oriented system emerges from composition of services. Dynamically composed reactive Web services form a special class of service oriented system, where the delays associ...