ON AUTOMATA MODELS OF BLOCKCHAIN
The author considers automata models of blockchain, mostly based on timed automata. The author suggests a new version of timed automata that avoids some inconveniences that occur in modeling by using standard timed automata where time is represented by real numbers. In the latter case, one should use variables of two types, Boolean and real; when applied to blockchain modeling, this fact causes some difficulties both in obtaining theoretical estimates and in program implementation. The present approach is based on 2-adic analysis since in that case, both time and digital variables are of one type only; namely, Boolean.