Research Article | Open Access
Jingjing Liao, "A Key Event Path Analysis Approach for Integrated Systems", Modelling and Simulation in Engineering, vol. 2012, Article ID 383129, 7 pages, 2012. https://doi.org/10.1155/2012/383129
A Key Event Path Analysis Approach for Integrated Systems
By studying the key event paths of probabilistic event structure graphs (PESGs), a key event path analysis approach for integrated system models is proposed. According to translation rules concluded from integrated system architecture descriptions, the corresponding PESGs are constructed from the colored Petri Net (CPN) models. Then the definitions of cycle event paths, sequence event paths, and key event paths are given. Whereafter based on the statistic results after the simulation of CPN models, key event paths are found out by the sensitive analysis approach. This approach focuses on the logic structures of CPN models, which is reliable and could be the basis of structured analysis for discrete event systems. An example of radar model is given to characterize the application of this approach, and the results are worthy of trust.
The American Department of Defense published the “Department of Defense Architecture Framework (DoDAF) Vision 2.0” in 2009 [1–3], which concludes 41 models and 8 viewpoints: All Viewpoint (AV), the Capability Viewpoint (CV), the Data and Information Viewpoint (DIV), the Operational Viewpoint (OV), the Project Viewpoint (PV), the Services Viewpoint (SvcV), the Standards Viewpoint (StdV), and the Systems Viewpoint (SV) and develops one of the main standards in the world on account of its integrated description criterion for system architecture. However, the static description could not support the dynamic performance evaluation of the integrated system, which leads lots of researchers to study the problem of creating executable models from the DoDAF products [4–6] (Figure 1). As a kind of high level Petri net, CPN is the preferred tool to create executable models for its beautiful advantage in modeling, simulation, and performance evaluation of large scale systems.
CPN adopts color sets, class folding, and definitions of data class, which was founded by Professor Jensen  in 1981 and enforces the modeling ability of Ordinary Petri Net (OPN). There have developed many mature theories about modeling manners and simulation results based on CPN [8–10], but the structural characteristics such as incidence matrices are weakened from OPN to CPN, which prevents us to obtain the S (T) invariants, trap (siphon) structures, conservation, and so forth based on incidence matrices. As a result, we have to search for the structural analysis methods of CPN models.
The structural analysis  is a kind of efficient performance analysis method, which has the advantage of obtaining the logic verification results from the whole structures of the models independent of their initial markings and getting the behavior characteristics from the structures only. Through the structural analysis of CPN models, we mainly want to indicate the events and choice relations between them from their structures. What is more, we should find out the key event paths if needed in project.
Events and choice relations between them are on the basis of event structures. A probabilistic event structure  is the probability extension based on the extended bundle event structure, which we can use to represent the concurrent operation and interrupt operation in Process Algebra. In this paper, we adopt the probabilistic event structure graphs translated from the architecture models and CPN models to analyze the serial event paths and the cycle event paths. According to the probability range for each cycle event path based on the simulation results of the associated CPN model, we can determine the event path with the maximum change range to be the key event path of the system.
2. Basic Concepts
2.1. OV of DoDAF 2.0
Like the previous DoDAF visions, DoDAF V2.0-described Models in the Operational Viewpoint describe the tasks and activities, operational elements, and resource flow exchanges required to conduct operations. They definitely define operational activities and their relationships and provide efficient references . Names of the models and their descriptions are provided in Table 1.
The OV-1 describes a mission, class of mission, or scenario. The OV-2 applies the context of the operational capability to a community of anticipated users. The OV-3 addresses operational resource flows exchanged between operational activities and location. The OV-4 shows organizational structures and interactions. The OV-5 describes the operational activities that are being conducted within the mission or scenario. The pervious OV models merely describe the static structure of the architecture elements and their relationships. However, OV-6 focuses on the dynamic behavior, which concerns the timing and sequencing of events that capture operational behavior of a business process or mission thread. Thus, this behavior is related to the activities of OV-5b. Based on those static and dynamic description models, we can create the associated simulation models (e.g., CPN models).
2.2. Basic Definitions of Event Structures
Event structures are a prominent noninterleaving model for concurrency. We use Langerak’s bundle event structures , an adaptation of Winkel’s event structures  to fit the specific requirements of multiparty of synchronization. Bundle event structures consist of events labeled with actions—an event modeling the occurrence of its action—together with relations of causality and conflict between events. System runs can be modeled as partial orders of events satisfying certain constraints posed by the causality and conflict relations between the events.
Causality is represented by a relation, denoted , between a set of events and an event . The interpretation of is that if happens in a system run, exactly one event in has happened before (and cause ). This enables us to uniquely define a causal ordering between the events in a system run. Conflict is a symmetric binary relation, denoted , between events. The intended meaning of is that either or that either or can appear in a system run but not both.
Definition 1. A bundle event structure (BES) is defined to be a structure with a set of events, the (irreflexive and symmetric) conflict relation, the causality relation, and the action-labelling function, where is a set of action labels, such that
We usually denote bundle by and an event labeled by . But it is difficult to simulate a system’s behavior only depending on the sequences of activities. For concurrent systems, the performance and security analysis is a more important problem. So it is necessary to consider some performance evaluation parameters (e.g., probability metrics). In the following part of this paper, we will obtain probabilistic extended bundle event structures (EBESs) by decorating events and bundles with probabilities.
In EBESs, we bind probabilities to some events, which we denote probabilistic events. And we associate a probability distribution time value with some events, which are random timed events. Then we can obtain generalized stochastic extended bundle event structures. We use a partial order map to represent the probability of an event, then expresses that the probability is if the event is enabled.
Definition 2. A EBES is defined to be a structure of with a set of events, the (irreflexive and symmetric) conflict relation, the causality relation, and the action-labelling function, the probability function, the partial order function. For each event , there exists such that .
EBESs are graphically represented as PSEGs in the following way: events are denoted as dots; near the dot the action label is given. Conflicts are indicated by dotted lines between representations of events. Bundle in indicated by drawing an arrow from each event in to and connecting all arrows by small lines. The probabilities and delays are labeled beside the associated events. If there exists a cycle causality, we use a dash-dotted line to instead of the small line for bundle . The basic relations are as Figure 2.
3. Key Event Path Analysis
At present, there have been many research results and theories about events and route choices. Based on these, we can translate CPN models to PSEGs according to some rules to analyze event paths of systems. In this section, the translation rules and event path definitions are presented. Besides that, the key event path analysis method based on the simulation results of CPN models is brought forward.
3.1. PSEGs Translation Rules and Steps
Before discussing the translation rules of PSEGs, we should study the contents represented by DoDAF V2.0-OV models and the relationships between them. As referred in Section 2.1, OV-1 to OV-5 mainly depict the operational activities and resource flows exchanged, and OV-6 adds the dynamical behavior descriptions of the operational activities. In other words, the activity and node descriptions in the models of OV-1 to OV-5 are associated to each other, which are the basis of the event sequences and time delays in OV-6 (as in Figure 3).
An event models the occurrence of its action (very short activity). As in Table 1, OV-5a and OV-5b represent the activities and behavior relationships between them when occurring, the associated events of which makes up the events of PSEGs. And OV-6a provides instructions which activities should occur under some certain conditions. OV-6b denotes the activity sequences, and OV-6c the information exchanged between all operational nodes. All OV-6 models can determine the relationships between events in PSEGs to be causality, conflict, or independence. In conclusion, we can pick up event elements from OV-5 models and relationships from OV-6 models for PSEGs. Then the probabilities and time delays of occurring events are left unknown (the ones provided by OV-6 may be denoted by some random distributions, which is not convenient to compute and analyze), which can be obtained from the statistical simulation results of CPN models.
As a popular tool for modeling, simulating, and analysis, CPN tools support random distribution functions, and times of simulation, which enables us to pick up favorite statistical data to analyze. When simulating a CPN model, it is often useful to be able to examine the markings and occurring binding elements, to periodically extract information from the markings and binging elements, and then to use the information for different purposes. A monitor is a mechanism in CPN tools that is used to observe, inspect, control, or modify a simulation of a CPN model. Many different monitors can be defined for a given net. Monitors can inspect both the markings of places and the occurring binding elements during a simulation, and they can take appropriate actions based on the observations. Monitors can be used for each of the activities. Therefore, we can conclude the PSEGs translation rules as in Figure 4.
On the basis of the EBESs definition, DoDAF-OV models and CPN models, we can conclude the particular steps as follows.
Step 1. Extract the bottom activities to construct event sets , graphically denoted as dots.
Step 2. Make sure the relationships between relationships.
Substep 1. The relationship of event and as the form of “if then ” is if occurs before in the event sequence description of OV-6b and OV-6c, then the relationship of them is a cycle causality, graphically denoted as a dash-dotted arrow form to , or the relationship is a causality, graphically denoted as an arrow form to .
Substep 2. The relationship of and as the form of “if then , else ” in OV-6a is conflict, graphically denoted as a dashed line connecting with and .
Step 3. Compute the probability and time delay of each event obtained from the simulation results of CPN models, and write them near the associated dots.
3.2. Definitions and Analysis of Event Paths
To analyze properties of every event path, we should firstly define the event paths, cycle, and sequence event paths according to relationships of events in PESGs. In this section, we give the following definitions where causalities are the basic relationships.
Definition 3 (Event Paths). For if , then we call a casual event pair. A serial casual event included with multicasual event pairs is defined to be an event path, the first event of which is called the initial event, and the last event the final event.
Definition 4 (Cycle Event paths). If the final event and the initial event of one event path satisfy , that is to say, there exists at least one cycle event, then we define this event path to be a cycle event path. And we call it a minimal cycle event path if there is no other cycle event except .
Definition 5 (Sequence Event Paths). If the initial event and the final event of one event path satisfy that such that or , then we define this event path to be a sequence event path. And we call it a minimal sequence event path if there is no other sequence event except . Let be an event path, we denote as the th event of .
In PESGs, the part of just concluded dots and arrows is a sequence event path, and it is a minimal sequence event route if there is only an initial event and a final event. And if an event path consists of dots, arrows, and only one dash-dotted arrow from the final event to the initial event, then it is a cycle event path. They are shown in Figure 5.
In recent literatures, [15, 16] a key event path is the node serials with the most sums of all node time delays, and the activities of the key event path are called key activities. Or a key event path is the transition serials with the least time delays, which is also called the main route. Then according to different requirements, a key event path can be represented as the one with the most or least time delays. From Definitions 3–5, the cycle event paths may affect the time delays of some sequence event paths. With the bigger probabilities of the cycle event paths, the time delays of associated sequence event paths will be more. Therefore, we mainly consider the probabilities of cycle event paths. In other sides, the disturbance analysis method is an efficient one to analyze discrete event systems, which we can adopt to compute the changing scope of each cycle event path, and the key event path is the one with the maximal changing probabilities.
The sensitive analysis method can be used to obtain the changing probabilities. Sensitivity is to focus on the grades of some system parameters changing with certain indexes. In this paper, we can find the key event path as the cycle event path with the most probability sensitivity.
4. An Example
Take the CPN model of the early warning radar (EWR) system  as an example. The EWR system starts searching in the directed searching screen once it receives the leading information from the command and control system. Then it turns to the capturing state if threats found. The capturing state is a transitional process between searching and tracking, after which the EWR system starts tracking. During the continuous tracking state, it computes the ballistic trajectory parameters of threats and transmit them to the command and control system.
According to the PSEGs translation rules and activities of OV-5b, we can extract all events of the EWR system as in Table 2.
According to the associated OV-6 models, we can finish the PSEG of the EWR system as in Figure 6, where tr is the tracking pulse cycle of EWR, and Tpr is the time delay for EWR scanning the whole search screen once.
From Figure 6, the relationships between each cycle event path probability and each conflict probability are as follows:
Using disturbance simulation method, all cycle event path probabilities can be computed by the Data Collector of CPN Tools. The colored ribbon figure of , , , , and changing with jamming levels is as Figure 7. We can learn that the 3rd cycle event path is the key event path of the EWR system; that is, the searching segment is weaker and more important than other segments. In theory, whether the EWR system can find threats in the leading search screen in time has the most influence to early warning results.
The key event path analysis is an important part of discrete event system structural analysis. We proposed a key event path analysis approach of integrated systems based on the analysis of cycle event paths in PSEGs. Besides that, we brought forward translation rules between two different architecture modeling methods. The approach supports to develop structural analysis of key event paths, and it is worthy to study deeply in the structural analysis of discrete event dynamic systems.
This paper is supported by the National Natural Science Foundation of China (Grant no. 60874068).
- DoD Architecture Framework Working Group, DoD Architecture Framework Version 2. 0, Volume 1: Introduction, Overview, and Concepts, The United States: Department of Defense, 2009.
- DoD Architecture Framework Working Group, DoD Architecture Framework Version 2. 0, Volume 2: Architectural Data and Models, The United States: Department of Defense, 2009.
- DoD Architecture Framework Working Group, DoD Architecture Framework Version 2. 0, Volume 3: DoDAF Meta-Model, The United States: Department of Defense, 2009.
- F. Ni, M. Z. Wang, F. Zhou et al., “Integrated architecture modeling approach from DoDAF to HCPN,” Systems Engineering and Electronics, vol. 32, pp. 959–965, 2010.
- A. H. Levis and L. W. Wagenhals, “C4ISR architectures: I. Developing a process for C4ISR architecture design,” Systems Engineering, vol. 3, no. 4, pp. 225–247, 2000.
- L. W. Wagenhals, I. Shin, D. Kim, and A. H. Levis, “C4ISR architectures: II. A structured analysis approach for architecture design,” Systems Engineering, vol. 3, no. 4, pp. 248–287, 2000.
- K. Jensen, Colored Petri Nets Basic Concepts, Analysis Methods and Practical Use, vol. 1, Springer, Berlin, Germany, 2nd edition, 1992.
- K. Jensen, L. M. Kristensen, and L. Wells, “Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems,” International Journal on Software Tools for Technology Transfer, vol. 9, no. 3-4, pp. 213–254, 2007.
- M. A. Piera and G. Mušič, “Coloured Petri net scheduling models: timed state space exploration shortages,” Mathematics and Computers in Simulation, vol. 82, pp. 428–441, 2010.
- Z. Xiao and Z. Ming, “A method of workflow scheduling based on colored Petri nets,” Data and Knowledge Engineering, vol. 70, no. 2, pp. 230–247, 2011.
- B. Rachid and E. M. Abdellah, “On the analysis of some structural properties of Petri nets,” IEEE Transactions on Systems, Man, and Cybernetics A, vol. 35, no. 6, pp. 784–794, 2005.
- V. Daniele and Y. Nobuko, “Probabilistic π-calculus and event structures,” Electronic Notes in Theoretical Computer Science, vol. 190, no. 3, pp. 147–166, 2007.
- R. Langerak, Transformation and Semantics for LOTOS [Ph.D. thesis], University of Twente, 1992.
- G. Winskel, “An introduction to event structures,” Lecture Notes in Computer Science, vol. 354, pp. 364–397, 1989.
- R. Liu, A. Kumar, and W. van der Aalst, “A formal modeling approach for supply chain event management,” Decision Support Systems, vol. 43, no. 3, pp. 761–778, 2007.
- E. Bland, S. Y. Brian, F. B. James, F. L. Robert, and D. F. Lisa, “Event-driven competing risks,” Ecological Modelling, vol. 158, no. 1-2, pp. 35–50, 2002.
- L. S. Melvin and P. B. Gerald, “Radars for the detection and tracking of ballistic missiles, satellites and planets,” Lincoln Laboratory, vol. 12, pp. 217–243, 2000.
Copyright © 2012 Jingjing Liao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.