Figure - available from: ASI
This content is subject to copyright.
Step III of the procedure to obtain the set of verification data for the joint linked list. It discloses the interaction of agent A1 with external verifiers V1, V2, …,VQ, combining data of internal subsystems and external verifiers.
Source publication
Network control of autonomous robotic devices involves a vast number of secured data coding, verification, and identification procedures to provide reliable work of distant agents. Blockchain scheme provides here the model of the extended linked list for the verification of critical data, approved by quasi-random hash values assigned by external ne...
Citations
... Agents of MASs should typically exchange with them by using the limited set of formal messages (marked by blue arrows). The verification method also should take into account possible data exchanges between the agent of some MASs and loyal external agents or network nodes [26,68] involved by mutual services or a rent. The data flow between such pairs of robots (marked by green arrows in Figure 2) can contain requests to send some necessary data or tools, or to write/read notations in the distributed copies of LL protected data storages [68,69]. ...
... The verification method also should take into account possible data exchanges between the agent of some MASs and loyal external agents or network nodes [26,68] involved by mutual services or a rent. The data flow between such pairs of robots (marked by green arrows in Figure 2) can contain requests to send some necessary data or tools, or to write/read notations in the distributed copies of LL protected data storages [68,69]. Potentially, people in the scene also can communicate with robots concerning positioning, parking, and other common problems, using special tools for the translation of robotic messages to people and vice versa. ...
... However, more simple and accessible technologies finally have provided the priority of the Boolean logic. Nevertheless, further considered papers [68,69,73,75] demonstrate many useful properties of MVL models that can be used for network agents. As AGA logic expressions and models are can be easily and conveniently calculated in parallel [75], this calculus is especially interesting for modern optoelectronic scheme design. ...
Featured Application
The proposed method of logic data verification is aimed at the simplified integration of a robotic agent into a local network, even if this agent has incompatible or missing components in the model. Dialog data verification and data exchange schemes use the coded structure of vocabularies, describing system parameters and logic variables, which are supported by the logic language of communications and the dialog protocol for phrase procession.
Abstract
Distant verification of the autonomous agent’s parameters in the dialog mode is a difficult multi-parametric task if the large-scale scene of action is characterized by a large number of collaborative and rival robots. The possible scheme to realize it for mass robots is to use non-exhaustive and selective data verification, combining the polling of internal subsystems and external data storage in collaborating network agents. Selective extraction of data for such checks is proposed to involve the special ordered set of vocabularies, containing coded digital words and classifying parameters of agents, tasks, objects, and events. The structure of such vocabularies is to be combined with various versions of the linked list scheme, known in blockchain and actual for protective documenting of critical data. Multiple-valued logic is used here as the convenient method to provide autonomous navigation in a multi-parametric structure of data and verification variables.
... Quantum calculi and formalisms are the mathematical frameworks and symbolic languages for understanding and performing quantum computations. These mathematical frameworks and symbolic languages provide a structured way to represent, manipulate and give logical reasons for quantum states, operations, processes, and algorithms [46,20]. ...
... Quantum calculi and formalism are new approaches for security systems, networks, and protocols. The important quantum calculi and formalisms for system and network security are ZX calculus, ZH calculus, lambda calculus, Pi calculus, linear, modal, second-order or temporal logic, process algebra, intuitionistic type, modal or category theory, and many more [46,20,65,71,86]. ...
Quantum calculi and formalisms are useful tools for ensuring security and computational capabilities in blockchain and cryptography. They aid in designing and analysing new cryptographic protocols for blockchain, determining the behaviour of quantum operations in blockchain‐based smart contracts, assessing the feasibility and security of quantum algorithms in blockchain applications, and building a quantum‐safe blockchain system. A comprehensive review of the applications of quantum calculi and formalisms in computer security and network security, along with a bibliographic analysis is presented. It is unique in that it combines bibliometric analyses with a technical review of the domain of quantum calculi and formalism. Bibliometric and biographic analysis in the field helps identify research trends, assess the influence of research, determine collaboration patterns, evaluate journals, and examine publication behaviours, among other things. It performs bibliographic and bibliometric analysis using a dataset collected from Scopus and Web of Science through different queries. The obtained results help identify important institutions, authors, organisations, collaboration networks, keywords, and more. The provided open challenges and future vision pave the way for further research in the direction of quantum calculi and formalism applications in computer security and network security.
... In addition, k-valued logic is highly relevant in the modeling of complex dynamical systems, where causal relations play a crucial role [4]. It is also used in logical dynamical systems [5], the modern control and stabilization of unmanned systems [6], cyber-physical systems [7], data transmission [8,9], optimal network routing [10,11], and quantum cryptography [12]. A comprehensive analysis of the use of k-valued logic in various applications has been provided in the research paper [9]. ...
This paper addresses the theoretical issues in k-valued logic, which are crucial for developing solutions in various fields of science and technology. One of the fundamental issues is a complete description of the closed classes of functions of three-valued logic. The explicit description of closed classes in multivalued logic is an open problem. In this study, we consider a special case of the finite generation of all closed classes of three-valued logic through the operation of superposition. Previously, we considered the issue of the finite generation of classes containing a subset of single-variable functions. We have also provided a description of superlattices (lattices of lattices) containing a precomplete class of unary functions. The finite generation of these superlattices is proved. On the basis of these results, in this paper, we have proven that any class containing any of the precomplete classes from the set of single-valued functions is also finitely generated. The main result of this paper consists of three theorems on the finite generation of classes containing precomplete classes of single-valued functions and classes including all monotone unary functions. Thus, the obtained theoretical result provides easily verifiable criteria for the finiteness of classes of multivalued logic functions. It allows you to use simple procedures instead of cumbersome explicit constructs. The finite generation of overlattices allows the development of digital computing circuits that are crucial for practical applications. The proofs are based on an explicit description of these classes by an induction in the number of variables and essentially use the properties of functionally closed (Burle) classes of functions.
... E.g., schemes of secret coding with one-time keys were proposed to be combined with blockchain models for data verification in network agents [9,13]. These designs provide "economical" non-stream use of quantum keys, periodically received from a QKD line and involved in the hashing of critical data in agents [18]. However, the next step is to use such keys for control and verification of distant robotic agents, but the problem is that quantum protocols [13] use complicated enough schemes for measurements of single photons, which may suffer from external factors creating interference, disturbance, and noise, thus being less predictable and reliable devices. ...
... Respectively, a corresponding logic expression was proposed, written via Literals with modified parameters a, b. Besides this, a data protection scheme with blockchain components was proposed [13,18], realizing the logic linked list for network agents. ...
... Respectively, our current accent on Hamacher gates is motivated mainly by control scheme simplification and should be attentively adjusted for specific controllers. But namely, the interest in modern network small-and middle-scale agents for IoT and IoV induces the discussion of the question, how multi-parametric MVL modeling [9,13,18] can enhance the possibilities of T-gates. ...
Unmanned network robotics is a new multidisciplinary field that involves many fields of computer networks, multi-agent systems, control theory, 5G and 6G Internet, computer security, and wireless quantum communications. Efficient conjugation of such technologies needs to design new data verification schemes for robotic agents using the advantages of quantum key distribution lines. For such schemes the joint use of known fuzzy logic parametrical -gates and discrete multiple-valued logic models simplifies the application of quantum quasi-random keys. Namely, the separate regulating parameter in -gates is the most convenient tool to use quantum keys in comparatively simple classical control and verification procedures that do not involve quantum logic gates.
