Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T06:27:43.168Z Has data issue: false hasContentIssue false

Designing digital twins: a graph-based schema to enable systematic cost-benefit analysis

Published online by Cambridge University Press:  02 July 2026

Adam McClenaghan*
Affiliation:
University of Bristol, United Kingdom
James Gopsill
Affiliation:
University of Bristol, United Kingdom
Ben Hicks
Affiliation:
University of Bristol, United Kingdom

Abstract:

This paper posits that a Digital Twin can be viewed as a collection of nodes and edges where nodes represent actions on/with data and edges represent the flow of data between nodes. The paper provides a schema whereby the nodes and edges can be defined and the costs and benefits can be attributed, as well as analysis techniques enabled by the schema. The potential of the schema in supporting the design of Digital Twins is then demonstrated through a worked example, in which it is shown that traditional bottom-up cost estimates significantly overestimate costs when compared with this approach.

Information

Type
DESIGN METHODS AND TOOLS
Creative Commons
Creative Common License - CCCreative Common License - BYCreative Common License - NCCreative Common License - ND
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives licence (https://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is unaltered and is properly cited. The written permission of Cambridge University Press must be obtained for commercial re-use or in order to create a derivative work.
Copyright
The Author(s), 2026
Figure 0

Table 1.Overview of costing techniques

Figure 1

Figure 1.Examples of adaptations of architectures from literature, (a) adapted from Gürdür Broo et al. (2022), (b) adapted from Alonso et al. (2024)

Figure 2

Figure 2.Base node and cost (a,b) and node definitions (c-f)

Figure 3

Figure 3.Base edge definition (a), data edge definition (b), and data attribute definition (b)

Figure 4

Figure 4.Algorithm to get subgraph for target node

Figure 5

Figure 5.Cost calculation algorithm

Figure 6

Figure 6.Case study architecture represented as a graph

Figure 7

Table 2.Illustrative costs for nodes

Figure 8

Figure 7.Sub-graph for each sink

Figure 9

Table 3.Comparison of costs of different outputs from the worked example

Figure 10

Table 4.Optimal implementation order for worked example