In the paper we present the application of computational geometry algorithms to the exact determination of the times remaining to the occurrence of events in communication protocols; in the case when these times are expressed in the form of simple (i.e., in general, non-convex) polygons (this form of time is used in the polygon time structure). This exaet solution to the problem may be better than the approximate (i.e. interval) one, especially as we know, that the application of the approximate solution may lead to the evaluation of a protocol as incorrect, which in fact is correct.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.