55 search results - page 9 / 11 » Bounds on pseudoexhaustive test lengths |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
RTSS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
TIME
2005
IEEE
14 years 29 days ago
2005
IEEE
Abstract— We present a specification language and algorithms for the online and offline monitoring of synchronous systems including circuits and embedded systems. Such monitori...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Wireless mesh networks are becoming prevalent in providing access infrastructure to the public. Design of such networks involve several important goals including resilience to f...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...