Time mechanics as applied to event ordering

The notion of time is interpreted and quantified as a means to ensure consistent and accurate evaluations by time-relevant functions. As an integral part of a study encompassing all functions of automata, we formulate the process as it applies to event ordering. In developing this process, logical clocks are first examined to aid in defining the inter-relation between explicitly and implicitly related events. Understanding the extent to which logical clocks can be representative of system wide ordering, an ubiquitous measure is considered. We define “real time” as a means by which all measurement devices account for the same measure at the same moment, and whereby they remain consistent with respect to each other for the life of the system. “Real time” as an absolute and universally applicable system measure is analyzed and an algorithm for its implementation is proposed. With each event assigned a time value that is respected system wide, the application of mutual exclusion algorithms are presented and their behavior assessed when ordering certainty is ensured. Further, a means for maintaining consistent and accurate system wide time is developed