The application of computational geometry algorithms to the timed verification of communication protocols

• Autorzy: Brzeziński J. , Sajkowski M.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

computational geometry algorithms; communication protocols

PL

protokół komunikacyjny

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 2000
• Tom: Vol. 25, No. 2
• Strony: 97--119
• Opis fizyczny: Bibliogr. 16 poz.

Twórcy

autor

Brzeziński J.

autor

Sajkowski M.

• Institute of Computing Science, Poznań University of Technology, Piotrowo 3a, 60-965 Poznań, Poland,