1032 search results - page 144 / 207 » Extended Computation Tree Logic |
102
Voted
NECO
2008
15 years 3 months ago
2008
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
122
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
103
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
127
click to vote
FORTE
2004
15 years 5 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
136
Voted
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...