Cybernetics And Systems Analysis logo
Editorial Board Announcements Abstracts Authors Archive
KIBERNETYKA TA SYSTEMNYI ANALIZ
International Theoretical Science Journal
-->


DOI 10.34229/KCA2522-9664.25.1.3
UDC 004.75
G. Zholtkevych1, A. Zozulia2


1 V.N. Karazin Kharkiv National University, Kharkiv, Ukraine

g.zholtkevych@karazin.ua

2 V.N. Karazin Kharkiv National University, Kharkiv, Ukraine

anna.zozulia@karazin.ua

REALIZABILITY OF EVENT DIAGRAMS AND EXISTENCE OF LOGICAL CLOCKS

Abstract. This paper addresses the problem of the relationship between the correctness of the event diagram of distributed computing from the standpoint of communication between local processes of this computing and the existence of a logical clock for that diagram. The problem is analyzed using The Coq Proof Assistant software without assuming the fairness of the principle of excluded middle. That is, the obtained results are correct from the point of view of constructive logic, which is essential for computer science. It has been formally proved that the existence of a logical clock for distributed computing ensures the irreflexivity of the causal relation related to that computing. The conjecture about the fairness of the converse statement has been claimed.

Keywords: distributed computing, cloud platform, blockchain, digital distributed ledgers, global time, logical clock, event ordering.


full text

REFERENCES




© 2025 Kibernetika.org. All rights reserved.