On Sequential k-coverage Verification
碩士 === 國立清華大學 === 資訊工程學系 === 100 === One fundamental problem in sensor networks is the coverage problem, which reflects the degree of a sensor network being monitored or tracked by sensors. We say a point is k-coverage which means it is monitored by at least k sensors. The previous works on k-covera...
Main Authors: | Juang, Kun-Han, 莊坤翰 |
---|---|
Other Authors: | 陳良弼 |
Format: | Others |
Language: | en_US |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/94120895671332920176 |
Similar Items
-
Verification of sequential and concurrent libraries
by: Deshmukh, Jyotirmoy Vinay
Published: (2011) -
Concurrent verification for sequential programs
by: Wickerson, John Peter
Published: (2013) -
Functional verification coverage closure
by: Salem, Mohamed A.
Published: (2015) -
Automated functional coverage driven verification with Universal Verification Methodology
by: Tiikkainen, M. (Martti)
Published: (2017) -
Efficient verification of sequential and concurrent systems
by: Schwoon, Stefan
Published: (2013)