Submitted:
10 June 2024
Posted:
12 June 2024
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Theoretical Reference
2.1. Malleable Model
2.1.1. C4 Diagram Informal Approach
- Level 1 (Software system context diagram): high level, referring to the key elements definition of the system context under consideration;
- Level 2 (Container diagram): intermediate level with description of the functioning and relationship among subsystems;
- Level 3 (Components diagram): intermediate level with abstractions of the needed internal components for each container;
- Level 4 (Code diagram): lowest level, referring to the diagrams coding described in the previous levels, using appropriate language close to the actual implementation.
2.1.2. Basic Principles of Hierarchical Coloured Petri Nets Formal Approach
- is a finite set of non-empty colour sets (types).
- P is the finite set of all places.
- T is the finite set of all transitions.
- A is the finite set of all arcs such that P ∩ T = P ∩ A = T ∩ A = ∅
- N is the node function such that N: A → P × T ∪ T × P
- C is the colour function such that C: P→
- E is the arc expression function such that E: A→ Expr and ∀ a ∈A : [ Type(E(a)) = C(p(a))MS 15∧ Type(Var(E(a))) ⊆], where p(a) is the place of N(a);
- I is the initialization function such that I: P→ Expr and ∀ p ∈P : [ Type(I(p)) = C(p)MS].
- = is a non-hierarchical CPN;
- ⊆T is a set of substitution transitions;
- ⊆P is a set of port places;
- :→ is a port type function that assigns a port type to each port place.
- S is a finite set of modules. Each module is a CPN module s = ((, , , ,,, , , ), , , ), it is required that (∪) ∩ (∪) = ∅ for all , ∈ S such that ≠;
- :→S is a submodule function that assigns a sub module to each substitution transition. It is required that the module hierarchy is acyclic;
- is a port-socket relation function that assigns a port-socket relation ⊆× to each substitution transition t, it is required that = , = , and 〈〉 = 〈〉 for all ∈ and all t∈;
- ⊆ is a set of non-empty fusion sets such that = and 〈〉 = 〈〉 for all ∈ and all ∈.
3. Methodology
3.1. Malleable Model Framework
3.1.1. Coding Techniques
3.1.2. Performance Analysis
- Reachability→ it refers to the concept of a specific marking M being classified as reachable in a system whether there is a sequence of firing transitions that enables the system to move from the initial marking to the desired marking M. This concept can be formally expressed as M belonging to the set of reachable markings R(N, );
- Deadlocks→ they occur in a CPN model when a marking M is considered dead due to the absence of any enabled transition. A CPN model is deemed deadlock-free when every reachable marking within it enables at least one transition;
- Dead Transitions→ a transition becomes categorized as inactive when it lacks a reachable marking where the transition can be executed;
- Liveness→ this poperty pertains to a transition t being classified as live when, given any marking M∈ R(), there is a series of transitions enable from M that includes t. To be precise, for all M∈ R(N, ) where there exists M∈ R(N, M): ≤. The concept of liveness serves to guarantee that the CPN model will never experience blocking;
- Boundedness→ a specific location P is deemed k-bounded for a given natural number k if, for every reachable marking, place P does not exceed k tokens at any point, formally expressed as ∀M∈ R(N, ): ≤k. The concept of boundedness plays a crucial role in guaranteeing that the quantity of workpieces in progress remains within a certain limit, consequently contributing to the overall stability of the CPN model;
- Dead Markings→ the information pertaining to dead markings provides insight into markings that lack enabled transitions.
4. Case Study
4.1. Eletrobras Chesf Hybrid Power Plant
- Layer 1 (Local Controllers): HPP assets have local controllers which are responsible for managing the generator unit subsystems in which they are inserted as well as receiving set points from external systems to adjust power generation, for example. This layer also includes the protection relays, responsible for ensuring some safety conditions during system operation, acting when short circuits occur;
- Layer 2 (RTU): each one of the local controllers communicates with RTU which is responsible for managing asset operation, controlling and supervising the HPP. RTU is also responsible for receiving orders coming from Layer 3 and communicating with Layer 1;
- Layer 3 (SCADA System): it has an interface with HPP assets, displaying values of electrical measurements and their operating states. At this layer, acquired data from meteorological stations are available; manual commands are made by the operator and information from Layer 4 reaches Layer 2 and vice-versa;
- Layer 4 (PIMS): this is the system which acquires process data from several sources, stores it in a historical database and makes it available by means of several representation forms;
- Layer 5 (Intelligence Software): this is an Artificial Intelligence (AI)-based algorithm that relies on weather forecasts, received from Layer 3 and shared with other layers, and time-varying energy pricing (PLD, its acronym in Portuguese), used to contribute to make decisions about energy dispatch. This dispatch is made through performed maneuvers on the plant, such as energy supply made available only by BESS discharge when there is low wind or sun incidence in the region.
4.2. Malleable Model Development
4.2.1. STEP 1 (INFORMAL): Obtaining Part of C4 Diagram
- FR1 (Operational Vision Structure): the SCADA system in its operational view must follow the pattern of three frames with defined dimensions, dividing the screen horizontally. These frames will be named “menu frame”, “main frame” and “alarm frame”;
- FR2 (Overview Screen Renewable Generation System): the SCADA system must have a screen for monitoring the main electrical measurements of the IEDs for each HPP asset;
- FR3 (Renewable Generation System Command Screen): the SCADA system must have a screen that allows the operator to issue IED remote controls (for example, open/close, increase/decrease) initiated by operators;
- FR4 (Renewable Generation System Monitoring Screen): the system must have a screen for monitoring the main electrical quantities and states from IEDs;
- FR5 (Alarm and Event Processing): the SCADA system must be provided with resources and logic functions to perform classification, filtering, routing, annunciation, formatting and archiving of alarm messages and events in general, occurring in the electrical system or in the control system itself.
- Remote database: it contains the collected information history by the SCADA system to access the PIMS and smart dispatches. It also contains information about WF, PV, BESS, weather forecast, proposed local control set-point and load dispatch schedule made by the Operator;
- Weather seasons: they are located in the HPP and connected to the SCADA system, sending information about weather conditions;
- Industrial switch: it refers to the system or equipment that interfaces the communication network between RTU and SCADA system, providing great capacity in data traffic and robustness to environments with extreme temperature variations. After capturing the information about the asset states, the switch sends it to the SCADA system which processes data.
- Access control: this container is responsible for verifying the hierarchy level and allowing user access to the supervisory system. It consists of the login screen which verifies by algorithm user’s hierarchy and allows user to access operation and monitoring screens;
- History screens: this is the container of the set of screens and algorithms containing the screens of the system elements state history and the function for generating reports. This system has integration with the local SCADA system database where such histories are stored;
- Local Database: this is the database container, containing the history of the WF elements, PV, weather stations, BESS and alarms. This information is collected from operator’s actions on the SCADA system through queries to the remote database and RTU information;
- Supervision and control screens: this is the container of the set of screens, objects and algorithms that allows the supervision and control of the elements contained in the SCADA system.
4.2.2. STEP 2 (FORMAL): Building HCPN Model
Components and Casual Relationships
- IED in operation: Event “PV PR in Ready";
- IED communication fail: Event “PV PR Communication Fail";
- IED energized: Event “PV PR Energized".
Global Model
Generalization
4.2.3. STEP 3 (INFORMAL): Inserting the Global Model and Deploying the Proposed Code Diagrams as an Application Programming Interface
- Case 1 (OPENED): there is no fault and Energized IED (“Data.IEDEnergized") equals to 1 and IED Communication (“Data.IEDCommunication") equals to 1 and Ready IED (“Data.IEDReady") equals to 1 and 1 breaker opening supervision (“Data.BR2.Status") equals to 0.
- Case 2 (NOT OPENED): there is no fault and Energized IED (“Data.IEDEnergized") equals to 1 and IED Communication (“Data.IEDCommunication") equals to 1 and Ready IED (“Data.IEDReady") equals to 1 and 1 breaker opening supervision (“Data.BR2.Status") equals to 1.
- Case 3 (FAULT): there is at least a fault, that is, the other possible conditions beyond these ones presented to Cases 1 (OPENED) and 2 (NOT OPENED) whose the whole pre-condition to accomplish 1 breaker opening supervision with functional correctness are not attended.
4.3. Modeling Results
4.3.1. Validation
- PV IED state turned on;
- Need of performing 1 breaker opening supervision with functional correctness.
- Start 1 breaker opening supervision;
- Analyze PV IED state information;
- Execute 1 breaker opening supervision reliably.
-
Report generated: Sat May 11 21:08:23 20241 0 Turn_on @ (1:Initiating)- b = br(2)- c = false2 0 Acquire @ (1:Initiating)- c = false- b = br(2)3 0 Get @ (1:Evaluating)- c = false- b = br(2)- h = false4 0 InfOpen @ (1:Evaluating)- h = false- c = false- b = br(2)5 0 Next @ (1:Evaluating)- h = false- c = false- b = br(2)
-
Report generated: Sat May 11 21:09:57 20241 0 Turn_on @ (1:Initiating)- b = br(2)- c = false2 0 Acquire @ (1:Initiating)- c = false- b = br(2)3 0 Get @ (1:Evaluating)- c = false- b = br(2)- h = true4 0 InfNOpen @ (1:Evaluating)- h = true- c = false- b = br(2)
4.3.2. Checking
-
Query 1:Reachable (11,5)Answer 1:val it = true: boolQuery 1 and its respective answer mean marking 5 can be reached out from marking 11.
-
Query 2:AllReachable ()Answer 2:val it = false: boolQuery 2 and its respective answer mean not all markings are reachable one from the other.
5. Discussions
- Construct and examine occurrence graphs through the utilization of computational tools and also use techniques to reduce occurrence graphs while preserving a significant amount of information;
- Employing a hierarchical approach for enhancing system management efficiency and avoid unnecessary states.
6. Conclusions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
7. Full State Space Analysis Report
7.1. 1 Breaker Opening Supervision Model
| 1 | Reliability is an attribute of a system performs its intended function appropriately for a specified period of time or in a defined environment without failure. |
| 2 | Functional correctness is the characteristic of a system to attend to its specification. |
| 3 | Informal methods are more qualitative than quantitative and frequently base their conclusions on the recommendation of experts. |
| 4 | Formal methods are mathematically strict techniques for specifying, developing, analyzing, checking and validating software and hardware systems. |
| 5 | Software architecture can be defined as the high-level structures of a software system, which include the software elements, their relationships and properties, as well as the practices used to select, define, or design these structures. |
| 6 | Multi-set is a variant on the idea of a set in which each of its elements can have more than one occurrence, in contrast to a set. |
| 7 | Input pattern lists the variables that can be used in the code action. |
| 8 | Output pattern lists the variables to be changed as a result of the execution of the code action. |
| 9 | Code action is executed as a local declaration in an environment containing the variables specified in the input pattern. When the code action has been executed, its result is applied to bind the variables in the output pattern. |
| 10 | A CPN’s variable components are named tokens. They reflect the value of a condition and are shown inside of a place. |
| 11 | If a colour set is built up from other colour sets, it is named compound (product colour set, record colour set, list colour set, union colour set, subset colour set and alias colour set); if not, it is named simple (unit colour set, boolean colour set, integer colour set, large integer colour set, real colour set, time colour set, string colour set, enumerated colour set and index colour set). |
| 12 | In a CPN, tokens have a data value associated with them. The data value associated with a token is known as the token colour. |
| 13 | Expr is the set of expressions provided by the CPN ML inscription language which specifies declarations and net inscriptions. This language is an extension of the functional programming language Standard ML. |
| 14 | Type(e) is the type of an expression e∈ Expr, i.e., the type of Var(e) (the values obtained when evaluating e). |
| 15 | The subscript MS denotes the multi-set of the associated place. |
| 16 | The liveness property of a PN refers to the ability of the system to ensure that all transitions can eventually occur, preventing deadlock or livelock situations. |
| 17 | The boundedness property of a PN refers to the condition where the net has limitations on the number of tokens that can be present in each place, ensuring a finite state space. |
| 18 | Fairness in PN is a crucial property ensuring actions in the system model are starvation-free, that is, no component is delayed indefinitely in a composed model, promoting effective reuse and composability checking through PN transformations and analysis techniques. |
| 19 | Validation is the essential procedure of confirming that a software system or component satisfies the specified criteria and operates effectively within its designated environment. The primary goal of this validation stage is to identify and correct any errors in the software to guarantee its compliance with the user requirements and its proper functioning. |
| 20 | Checking refers to the procedure of verifying software artifacts against desired properties using formal checking techniques. The employment of strict methodologies, including formal methods, is underscored in the field of software engineering with the aim of preserving the initial engineered elements of a product and averting designs from straying away from their designated objectives, underscoring the significance of comprehensive verification processes in software development. |
| 21 | More information about CPN Tools can be obtained in https://cpntools.org/. |
| 22 | This work was idealized in the Research, Development and Innovation (R&D+I) Project with code number PD-00048-0217, being regulated by the National Electric Energy Agency (ANEEL). |
| 23 | OPC UA is a cross-platform, open-source, IEC62541 standard for data exchange from sensors to cloud applications developed by OPC Foundation. |
| 24 | In boolean logic, a don’t-care term (X) for a function is an input-bit for which the function output does not matter. |
| 25 | Counterexample is an example that presents an argument in opposition or contradiction to a particular concept or hypothesis. |
References
- Y. An, N. Wu, X. Zhao, X. Li and P. Chein. Hierarchical Colored Petri Nets for modeling and Analysis of Transit Signal Priority Control Systems. Applied Sciences, 8, 141, 2018, pp. 1–24.
- N. T. S. Board. Pipeline Accident Report. N. T. S. Board, Washington, DC, USA. NTSB/PAR-12/01 PB2012-916501. 2010.
- S. Brown. The C4 Diagram for Software Architecture. 2018. Available online: http://c4model.com/.
- S. Brown. Documentation C4 Diagram to Software Architecture. (in Portuguese). Available online: https://www.infoq.com/br/articles/C4-architecture-model/.
- T. Cherifi and L. Hamami. A Practical Implementation of Unconditional Security for the IEC 60780-5-101 SCADA Protocol. International Journal of Critical Infrastructure Protection, Vol. 20, 2018, pp. 68–84.
- S. Christensen and K. Mortensen. Design/CPN ASK-CTL Manual Version 0.9, University of Aarhus, Department of Computer Science, University of Aarhus, Denmark, 1996.
- E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Progress on the State Explosion Problem in Model Checking. Informatics: 10 Years Back, 10 Years Ahead, 2001, pp. 176–194.
- Federal Energy Regulatory Comission (FERC), North American Electric Reliability Corporation (NERC) and Regional Entities (Midwest Reliability Organization, Northeast Power Coordinating Council, Reliability First Corporation, SERC Corporation, Texas Reliability Entity and Western Electricity Coordinating Council). FERC, NERC and Regional Entity Staff Report. The February 2021 Cold Weather Outages in Texas and the South Central United States. 2021. Available online: https://www.ferc.gov/media/february-2021-cold-weather-outages-texas-and-south-central-united-states-ferc-nerc-and.
- J. Huang, T. Meng, Y. Deng and F. Huang. Catching Critical Transition in Engineered Systems. Mathematical Problems in Engineering 2021, 2021, 1–10.
- K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Vol. 1, 2nd Edition, New York, United States of America, 1997.
- K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Vol. 2, 2nd Edition, New York, United States of America, 1997.
- K. Jensen, S. Christensen and L. Kristensen. CPN Tools State Space Manual, University of Aarhus, Department of Computer Science, University of Aarhus, Denmark, 2006.
- R. Jongeling and F. Ciccozzi. Towards Supporting Malleable Architecture Models. 2023 IEEE 20th International Conference on Software Architecture Companion (ICSA-C), pp. 272-275, Italy, 2023.
- A. Van Lamsweerde. Requirements Engineering: From System Goals to UML Models to Software. Chichester, United Kingdom, John Wiley & Sons, 2009.
- X. Liang, Y. Hou, and M. Zhao. modeling and Analysis of Microgrid Energy Scheduling Based on Colored Petri Net. 2022 IEEE International Conference on Networking, Sensing and Control (ICNSC), pp. 1-6. 2022.
- X. Liu, M. Zhao, Z. Wei and M. Lu. The Energy Management and Economic Optimization Scheduling of Microgrid based on Colored Petri Net and Quantum-PSO Algorithm. Sustainable Energy Technologies and Assessments, Vol. 53, 102670, 2022.
- R. Lopez, A. Moore and J. Gillerman. A Model-Driven Approach to Smart Substation Automation and Integration for Comision Federal de Electricidad. IEEE PES T&D 2010, 2010, 1–8.
- P. M. Nasr. Toward modeling Alarm Handling in SCADA System: A Colored Petri Nets Approach. IEEE Transactions on Power Systems, Vol. 34, N. 6, 2019, pp. 4525-4532.
- P. Neis, A. A. Wehrmeister, M. F. Mendes and J. R. Pesente. Applying a Model-Driven Approach to the Development of Power Plant SCADA/EMS Software. International Journal of Electrical Power and Energy Systems, Vol. 153, 2023, 109336, pp. 1-15.
- F. Salehi, R. Keypour and W. Lee. Reliability Assessment of Automated Substation and Functional Integration. 2016 IEEE Industry Applications Society Annual Meeting, pp. 1-7. 2016.
- SCIENCE - Complex Systems and Networks. Science, 2009. Vol. 325, Issue 5939, 357-504. Available online: https://www.sciencemag.org/content/325/5939.toc.
- P. Stevens and R. Pooley. Using UML: Software Engineering with Objects and Components. Addison-Wesley, 2nd Edition, 2006.
- J. D. Ullman. Elements of ML Programming, ML 97 Edition, 2nd ed. Prentice Hall, 1998.
- A. Valmari. The State Explosion Problem. Proceedings of the Advanced Course on Petri Nets, 1996, pp. 429–528.
- C. W. Yang, V. Vyatkin and C. Pang. Service-Oriented Extension of IEC 61850 for Model-Driven Smart Grid Automation Design. 43rd Annual Conference of the IEEE Industrial Electronics Society (IECON), 2017, pp. 5489-5496.
- N. Zhou, D. Li, V. Vyatkin, V. Dubinin and C. Liu. Toward Dependable Model-Driven Design of Low-Level Industrial Automation Control Systems. IEEE Transactions on Automation Science and Engineering, Vol. 19, Issue 2, 2022, pp. 425-440.
- O. Zielinski, D. Nicklas, H. Colonius, M. Siegel, A. Hahn, J. Meike, F. Köster and K. Lemmer. Interdisciplinary Research Center on Critical Systems Engineering for Socio-Technical Systems. Progress Report. 2015.





















| Declarations for 1 Breaker Opening Supervision | |||
| Name | Type | Definition | Meaning |
| iedboot | val | 20 | Estimated time in seconds to the IED boot |
| tmr | val | 1 | Timer value in seconds |
| n | val | 2 | Value used to define Breaker 2 |
| IB | Colset | int with 1..iedboot | Integer data from 1 to iedboot |
| A | Colset | with a | Logical data |
| BOOL | Colset | bool | Boolean data |
| BR | Colset | index br with 2..n | Data to define breakers |
| BRxBOOL | Colset | product BR*BOOL | Product data BRxBOOL |
| BRxBOOLxBOOL | Colset | product BR*BOOL*BOOL | Product data BRxBOOLxBOOL |
| INT | Colset | int | Integer data |
| TIMER | Colset | int with 1..tmr | Integer data from 1 to tmr |
| c, g, h | var | BOOL | Boolean variables |
| ib | var | IB | IB variable |
| t | var | TIMER | TIMER variable |
| b | var | BR | BR variable |
| Page Initiating for 1 Breaker Opening Supervision | ||
| Element | Type | Meaning |
| Start | Place | A token a in this place indicates the 1 breaker opening supervision needs to be started |
| Analysis | Place | According to the information which “authorizes” to start 1 breaker opening supervision, there is a token in this place if the supervision must be started or a token if the supervision must not be started |
| NoBlock | Place | A token a in this place means there is no block pre-condition to the 1 breaker opening supervision |
| Ready | Place | A token in this place means the 1 breaker opening supervision is ready to start |
| Block | Place | A token a in this place means the 1 breaker opening supervision is blocked and supervision can not be achieved due to reliability criteria of the proposed code approach |
| Checking | Place | A token a in this place means some posterior checking needs to be done from this point |
| Turn on | Transition | A token a in place Start enables this transition. When this transition fires, after a timer , if the 1 breaker opening supervision must be started, an information is returned from HPP. Otherwise, an information is returned from HPP. The boolean logical function associated to this transition, , is described by , where is the boolean logical function associated to the pre-condition “Analysis" of the PV IED status |
| Acquire | Transition | This transition evaluates the obtained information about the ”authorization” to start the 1 breaker opening supervision. This information is needed to start the execution in a reliable way. The place Analysis enables this transition. If the supervision must be started, a token is in place Analysis. In this condition, when this transition fires, a token is added to the place Ready. Moreover, a token a is added to the place NoBlock and a token a is added to the place Checking, indicating there is no block pre-condition to the supervision and some posterior checking needs to be done from this point respectively. On the other hand, if the supervision must not be started, a token is in place Analysis. In this condition, when this transition fires, a token a is added to the place Block, indicating a block of the supervision and supervision can not be achieved due to reliability criteria of the proposed code approach |
| Page Evaluating for 1 Breaker Opening Supervision | ||
| Element | Type | Meaning |
| Ready | Place | See Table 2 |
| Evaluation | Place | This transition evaluates 1 breaker status. When the transition Get fires, there is a token in this place if the breaker is opened or a token if the breaker is not opened |
| NoBlock | Place | See Table 2 |
| Opened | Place | After transition InfOpen to fire, there is a token in this place if the breaker is opened |
| Get | Transition | A token in place Ready enables this transition, indicating the 1 breaker opening supervision is ready to start. When this transition fires, if the breaker is opened an information is returned from HPP. Otherwise, an information is returned from HPP. The boolean logical function associated to this transition, , is described by , where is the boolean logical function associated to the pre-condition breaker status |
| InfNOpen | Transition | A token in place Evaluation enables this transition. When this transition fires, a token is removed from place Evaluation and a token is added to the place Ready |
| InfOpen | Transition | A token in place Evaluation enables this transition. When this transition fires, a token is removed from place Evaluation and a token is added to the place Opened |
| Next | Transition | A token in place Opened enables this transition. When this transition fires, a token is removed from place Opened, a token is added to the place Ready and a breaker opening supervision alarm is generated |
| Page Impeding for 1 Breaker | ||
| Element | Type | Meaning |
| Checking | Place | See Table 2 |
| NoBlock | Place | See Table 2 |
| Block | Place | See Table 2 |
| ImpCheck | Transition | This transition evaluates if there is a condition which impedes 1 breaker opening supervision. A token a in place Checking and a token a in place NoBlock enable this transition. When this transition fires, after a timer t, if there is a condition which impedes 1 breaker opening supervision, an information is returned from HPP. Then, a token a is removed from place Checking, a token a is removed from NoBlock and a token a is added to the place Block, indicating a block of the 1 breaker opening supervision. On the other hand, if there is no condition which impedes 1 breaker opening supervision, an information is returned from HPP. Thus, a token a is removed from place Checking and a token a is added to the place Checking, enabling transition ImpCheck. The boolean logical function associated to this transition, , is described by , where is the boolean logical function associated to the pre-condition breaker impeding |
| Declarations for 4 Breakers Opening Supervisions | |||
| Name | Type | Definition | Meaning |
| n | val | 4 | Value used to define Breakers 1, 2, 3 and 4 |
| BR | Colset | index br with 1..n | Data to define breakers |
| Conditions to Case 1 (OPENED) | ||
| Pre-Conditions | Variables | Values |
| Energized IED | Data.IEDEnergized | 1 |
| IED Communication | Data.IEDCommunication | 1 |
| Ready IED | Data.IEDReady | 1 |
| Breaker 2 | Data.BR2.Status | 0 |
| Conditions to Case 2 (NOT OPENED) | ||
| Pre-Conditions | Variables | Values |
| Energized IED | Data.IEDEnergized | 1 |
| IED Communication | Data.IEDCommunication | 1 |
| Ready IED | Data.IEDReady | 1 |
| Breaker 2 | Data.BR2.Status | 1 |
| Conditions to Case 3 (FAULT) | ||||||||
| Pre-Conditions | Variables | Values | ||||||
| Energized IED | Data.IEDEnergized | 0 | 0 | 0 | 0 | 1 | 1 | 1 |
| IED Communication | Data.IEDCommunication | 0 | 0 | 1 | 1 | 0 | 0 | 1 |
| Ready IED | Data.IEDReady24 | 0 | 1 | 0 | 1 | 0 | 1 | 0 |
| Breaker 2 | Data.BR2.Status | X | X | X | X | X | X | X |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).