z-logo
Premium
The reporting time problem: Integration of intelligence with verification
Author(s) -
Ruckle William H.
Publication year - 1992
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199212)39:7<893::aid-nav3220390703>3.0.co;2-8
Subject(s) - control (management) , computer science , computer security , operations research , artificial intelligence , mathematics
This article is a theoretic study of the following problem in verification: Mobile units under control of an agent, whom we call the HIDER, travel on a known transportation network and must at the conclusion of their itinerary report locations at fixed time intervals to a monitoring authority, whom we call the SEEKER. The purpose of this reporting requirement is to verify that illegal units do not infiltrate the network from sources under the control of the HIDER. We assume that the SEEKER has an independent intelligence‐gathering capability which gives sightings of both legal and illegal units. The purpose of this article is to quantify the advantage of frequent over infrequent reporting. © 1992 John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here