Informatics and Applications
2019, Volume 13, Issue 2, pp 29-36
ON AUTOMATA MODELS OF BLOCKCHAIN
Abstract
The author considers automata models of blockchain, mostly based on timed automata. The author suggests a new version oftimed 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 ofone type only; namely, Boolean.
[+] References (12)
- Alur, R., and D. Dill. 1992. The theory of timed automata. Real-time: Theory and practice. Eds. J. W de Bakker,
C. Huizing, W. P. de Roever, and G. Rozenberg. Lecture notes in computer science ser. Springer. 600:45-73.
- Andrychowicz, M., S. Dziembowski, D. Malinowski, and L. Mazurek. 2014. Modelling bitcoin contracts by timed automata. Formal modelling and analysis of timed systems. Eds. A. Legay and M. Bozga. Lecture notes in computer science ser. Springer. 8711:7-22.
- David, A., K. G. Larsen, A. Legay, M. Mikucionis, and
D. B. Poulsen. 2015. Uppaal SMC tutorial. Int. J. Softw. Tools Te. 17:397-415.
- Chaudhary, K., A. Fehnker, J. van de Pol, and M. Stoelinga. 2015. Modeling and verification ofthe bitcoin protocol. Electronic Proc. Theor. Comput. Sci. 196:46-60.
- Flood, M.D., and O.R. Goodenough. 2015. Contract as automaton: The computational representation of financial agreements. SSRN Electronic J. doi: 10.2139/ ssrn.2538224.
- Guth, F, V. Wusthold, M. Christakis, and P. Muller.
2018. Specification mining for smart contracts with auto-matic abstraction tuning. arXiv:1807.07822 [cs.Se]. 12 p. Available at: https://arxiv.org/abs/1807.07822 (accessed January 17, 2019).
- Anashin, V. 2012. The non-Archimedean theory of discrete systems. Math. Comput. Sci. 6:375-393.
- Anashin, V., and A. Khrennikov. 2009. Applied algebraic dynamics. Gruyter expositions in mathematics ser. Berlin -New York: Walter de Gruyter GmbH & Co. Vol. 49. 533 p.
- Dragovich, B., A. Yu. Khrennikiv, S.V. Kozyrev, and
I. V. Volovich. 2009. On p-adic mathematical physics. p-Adic Numbers Ultrametric Analysis Appl. 1:1-17.
- Allouche, J.-P., and J. Shallit. 2003. Automatic sequences. Theory, applications, generalizations. Cambridge: Cambridge University Press. 583 p.
- Bouyer, P., A. Petit, and D. Therien. 2003. An algebraic approach to data languages and timed languages. Inform. Comput. 182:137-162.
- Knuth, D. 1997. The art of computer programming. Vol. 2: Seminumerical algorithms. 3rded. Addison-Wesley. 791 p.
[+] About this article
Title
ON AUTOMATA MODELS OF BLOCKCHAIN
Journal
Informatics and Applications
2019, Volume 13, Issue 2, pp 29-36
Cover Date
2019-06-30
DOI
10.14357/19922264190205
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
blockchain; smart contract; timed automaton
Authors
V. S. Anashin 
Author Affiliations
Faculty of Computational Mathematics and Cybernetics, M. V. Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation
|