Blockchain as a Transaction Protocol for Guaranteed Transfer of Values in Cluster Economic Systems with Digital Twins

In this research, authors consider the economic system as a transactional model of the exchange of values. In this case, economic relations are reduced to multiple transactions (transfer operations) of value (economic assets) between their participants (agents). The transfer of value is carried out by changing the rights to their ownership in accordance with a specific set of rules (protocol). Within this approach, the key issue is the choice of rules (protocol) of fixing and transferring rights to values between agents of economic relations, which guarantees the execution of a transaction without loss. The purpose of this article is to find a solution to the problem of guaranteed transfer of property rights to values based on Distributed Ledger Technology (blockchain). The object of the research is cluster economic systems with digital twins; the subject of the research is the protocol of transfer of values between digital twins

Maintaining consistency in distributed systems

In systems designed as assemblies of independently developed components, concurrent access to data or data structures normally arises within individual programs, and is controlled using mutual exclusion constructs, such as semaphores and monitors. Where data is persistent and/or sets of operation are related to one another, transactions or linearizability may be more appropriate. Systems that incorporate cooperative styles of distributed execution often replicate or distribute data within groups of components. In these cases, group oriented consistency properties must be maintained, and tools based on the virtual synchrony execution model greatly simplify the task confronting an application developer. All three styles of distributed computing are likely to be seen in future systems - often, within the same application. This leads us to propose an integrated approach that permits applications that use virtual synchrony with concurrent objects that respect a linearizability constraint, and vice versa. Transactional subsystems are treated as a special case of linearizability

A transaction-oriented architecture for structuring unstructured information in enterprise applications

As 80-85% of all corporate information remains unstructured, outside of the processing scope of enterprise systems, many enterprises rely on Information Systems that cause them to risk transactions that are based on lack of information (errors of omission) or misleading information (errors of commission). To address this concern, the fundamental business concept of monetary transactions is extended to include qualitative business concepts. A Transaction Concept (TC) is accordingly identified that provides a structure for these unstructured but vital aspects of business transactions. Based on REA (Resources, Events, Agents) and modelled using Conceptual Graphs (CGs) and Formal Concept Analysis (FCA), the TC provides businesses with a more balanced view of the transactions they engage in and a means of discovering new transactions that they might have otherwise missed. A simple example is provided that illustrates this integration and reveals a key missing element. This example is supported by reference to a wide range of case studies and application areas that demonstrate the added value of the TC. The TC is then advanced into a Transaction-Oriented Architecture (TOA). The TOA provides the framework by which an enterprise’s business processes are orchestrated according to the TC. TOA thus brings Service-Oriented Architecture (SOA) and the productivity of enterprise applications to the height of the real, transactional world that enterprises actually operate in.</jats:p

Functionally Specified Distributed Transactions in Co-operative Scenarios

Addresses the problem of specifying co-operative, distributed transactions in a manner that can be subject to verification and testing. Our approach combines the process-algebraic language LOTOS and the object-oriented database modelling language TM to obtain a clear and formal protocol for distributed database transactions meant to describe co-operation scenarios. We argue that a separation of concerns, namely the interaction of database applications on the one hand and data modelling on the other, results in a practical, modular approach that is formally well-founded. An advantage of this is that we may vary over transaction models to support the language combinatio

State-of-the-art on evolution and reactivity

This report starts by, in Chapter 1, outlining aspects of querying and updating resources on the Web and on the Semantic Web, including the development of query and update languages to be carried out within the Rewerse project. From this outline, it becomes clear that several existing research areas and topics are of interest for this work in Rewerse. In the remainder of this report we further present state of the art surveys in a selection of such areas and topics. More precisely: in Chapter 2 we give an overview of logics for reasoning about state change and updates; Chapter 3 is devoted to briefly describing existing update languages for the Web, and also for updating logic programs; in Chapter 4 event-condition-action rules, both in the context of active database systems and in the context of semistructured data, are surveyed; in Chapter 5 we give an overview of some relevant rule-based agents frameworks