An Asymptotic Cyclicity Analysis of Live Autonomous Timed Event Graphs

: Designing a discrete event system converging to steady temporal patterns is an essential issue of a system with time window constraints. Until now, to analyze asymptotic stability, we have modeled a timed event graph’s dynamic behavior, transformed it into the matrix form of (max,+) algebra, and then constructed a precedence graph. This article’s aim is to provide a theoretical basis for analyzing the stability and cyclicity of timed event graphs without using (max,+) algebra. In this article, we propose converting one timed event graph to another with a dynamic behavior equivalent to that of the original without going through the conversion process. This paper also guarantees that the derived ﬁnal timed event graph has the properties of a precedence graph. It then investigates the relationship between the properties of the derived precedence graph and that of the original timed event graph. Finally, we propose a method to analyze asymptotic cyclicity and stability for a given timed event graph by itself. The analysis this article provides makes it easy to analyze and improve asymptotic time patterns of tasks in a given discrete event system modeled with a live autonomous timed event graph such as repetitive production scheduling. of all maximal strongly connected subgraphs of N c , which is a critical graph consisting only of critical cycles. The cyclicity of each maximal strongly connected subgraph of N c is the GCD of the number of tokens of all its cycles. In other words, if the cyclicity of a TEG N is d, it has an asymptotic d-cyclic schedule, and, if it is an asymptotic one-cyclic schedule, this system is said to be stable or to have stability.


Introduction
Stability in a traditional continuous dynamic system is a property related to robustness and resilience, and designing a system to have this property is an essential issue of system control and design [1]. A stable system can eventually converge the desired steady state from an arbitrary state. To rephrase, a system can recover its original state even if it has left the steady state because of an exception or abnormality. Although stability has been introduced for continuous systems, discrete event systems, such as manufacturing systems or computer networks, also have similar stability issues such as boundedness, practical stability, and Lagrange stability in the sense of Lyapunov stability or asymptotic stability [2]. A general Petri net, a kind of a discrete event system modeling language, usually analyzes structural boundedness, a special case of Lagrange stability [3]. In that sense, the event graph, also known as a marked graph, is always a bounded Petri net, so it is stable at all times. Therefore, an event graph is rarely necessary to analyze the system's boundedness, but it is useful for modeling a cyclic schedule for mass production, thanks to this stability [3][4][5].
However, some cyclic production systems have another type of stability issue even after modeling with event graphs. For example, a cluster tool for chemical vapor deposition (CVD) has a lower time limit, which is the minimum time required to perform a task, as well as an upper limit of wait time until the next task. The constraint forces a cluster tool to regulate fluctuations of delay or wait time between tasks to keep the product quality uniform and predictable. We call this constraint a time window constraint. Many researchers have studied how to model the cyclic schedule of a cluster tool with deterministic time using a timed event graph (TEG) to satisfy the constraint [6,7]. A TEG is a Petri net that temporizes by introducing the concept of deterministic time to places in an event graph. However, an existing system has persistent time variations or exceptions, so a TEG model analysis result cannot sometimes reflect the real one. Therefore, some studies have considered the predictable time fluctuation range when modeling and analyzing schedulability using the modified TEG [8] or have suggested a method of controlling the system within the time constraint [9].
Nevertheless, if rare exceptions occur such as time fluctuations more significant than expected or abnormality, we must quickly enable the system to converge to its normal state. Analyzing a discrete event system's stability with such time constraints determines whether each task has asymptotically reached desired steadiness that repeats it at fixed intervals rather than analyzing the boundedness. In other words, a system that is not stable does not repeat each task at the same time interval. However, even an unstable cyclic discrete event system repeats a pattern with the time interval. We call the analysis of temporal patterns cyclicity analysis [3,10,11].
Some researchers have analyzed the cyclicity and stability with regard to the time interval pattern of TEG [3]. Specifically, if each transition repeats firing epochs asymptotically every time a specific integer d-cycles, the system is considered d-cyclic, and the one-cyclic system is considered stable. However, it is not intuitive to analyze cyclicity and stability in a TEG. Therefore, these researchers have modeled a system with a TEG and converted it into a matrix form of (max,+) algebra [8,[11][12][13]. (max,+) algebra is an idempotent semiring of extended real numbers (R ∪ {−∞}, max, +) that can model and analyze the concepts of synchronization and concurrency [11,[14][15][16][17]. It also has a concept of stability like the one we have explained here, so it is easy to analyze the periodicity and stability of the system [10,18,19]. However, it is not intuitive to model the dynamic behavior of the system directly with (max,+) algebra, so the analysis is performed by dualizing TEG for modeling and (max,+) algebra for analysis. Two-step analysis itself is complicated, but interpreting a (max,+) algebra model in light of the original discrete event system is also not intuitive, making improving system stability difficult.
This article uses the idea that the final result of the matrix form of (max,+) algebra for analyzing the stability is also another TEG with specific characteristics: for instance, every place has exactly one token and at most one place connecting two transitions. We first provide equivalent transformation rules between TEGs without using (max,+) algebra including place reduction rules [20] and token simplification [10]. Then, using these rules, we propose a methodology to analyze stability and cyclicity in terms of a TEG. In conclusion, we provide a direct way to calculate an asymptotic cyclicity of a given TEG and to determine whether the TEG is stable without any conversion.
This article is organized as follows: Section 2 is devoted to introducing various notations, preliminary TEG concepts, and (max,+) algebra. It also illustrates how to analyze the cyclicity and stability using a two-step analysis. Section 3 presents rules for changing to an equivalent TEG with the characteristics of a precedence graph without converting a given TEG into a matrix form. In Section 4, we suggest theoretical background finding cyclicity and stability at the TEG level. Finally, we conclude in Section 5.

Timed Event Graphs
This section quickly reviews the essential definitions and notations of a TEG. There are more general discussions [10,11], and an excellent survey of Petri nets [4]. A TEG is a kind of Petri net and is also known as a marked graph [21]. A TEG is defined as N = (P, T, F, H, M 0 ). It has two sets of nodes called P (a set of places) and T (a set of transitions). F is a set of arcs of a directed bipartite graph; and a Petri net where each place has exactly one input and one output transition is called an event graph. A TEG is an event graph, so when each place connects the transitions t i and t j , it is often denoted as p ij . Function H(p ij ) = h ij defined in a TEG only is a holding time function, where h ij is a nonnegative real number. The function's meaning is that the token can be activated only after it enters the place p ij and becomes valid after h ij has passed. In other words, the holding time of a place defines how long a token must spend in the place before contributing to the enabling of the downstream transitions. M 0 : P → N + is called initial marking, where N + is the set of nonnegative integers.
This article uses the following symbols and notations for the set of predecessors and successors of place p ∈ P and transition t ∈ T [4,20]. Each place in a TEG has only one upstream transition as a predecessor and only one downstream transition as a successor: A path is a sequence of nodes (places and transitions) used to get from one node to another without repeating any nodes or arcs [21]. If the paths of the first and last nodes are the same, we call the nonempty path a directed cycle, simple directed cycle, or cycle for short. If all transitions in a TEG have upstream places and downstream places, we say that it is autonomous. If a cyclic schedule for mass production repeating the same task without any other external control is modeled with a TEG, the TEG can be autonomous [22]. Additionally, a live TEG can fire every transition in M 0 state without deadlock. The condition for which an autonomous TEG is live is that every cycle has at least one token [10]. Figure 1 visualizes a TEG with seven places and four transitions. Because it is an event graph, there is exactly one pair of upstream and downstream transitions for each place, so the place connecting t i to t j is denoted as p ij , and its holding time is represented as h ij . However, transitions t 2 and t 3 have two places that directly connect them, for which we use denotations p 23 and p 23 , respectively. That is, the insersection of the downstream places of t 2 and the upstream places of t 3 are p 23 and p 23 (t • 2 ∩ • t 3 = {p 23 , p 23 }). We extend this • notation for use in succession. •• t denotes the set of upstream transitions of the upstream places of transition t ( •• t = ∪ p∈ • t • p). For example, •• t 1 is a set of t 2 and t 4 because the upstream places of t 1 are p 21 and p 41 and their upstream transitions are t 2 and t 4 , respectively. Figure 1 has four cycles: The average cycle time is defined as the sum of the holding times of the places constituting each cycle divided by the number of tokens in the cycle. For example, the cycle time of π 1 is h 12 + h 23 + h 34 + h 41 , and the cycle time of π 3 is h 12 +h 21 3 . The average cycle time of a TEG is the maximum value among the cycles' average cycle times, and the cycle with the maximum cycle time is called a critical cycle.

(max,+) Algebra
While modeling with a TEG is intuitive, (max,+) algebra is also widely used to model the concept of synchronization and concurrency when analyzing the stability of a discrete event system. The (max,+) algebra known as the max tropical semiring is defined by (R, ⊕, ⊗) over the real number including a negative infinity and has two operators: a maximum (⊕ : a ⊕ b = max(a, b)) and a plus (⊗ : a ⊗ b = a + b) [14,17]. Each of these two operators is associative, commutative, and distributive. Their neutral elements of ⊕ and ⊗ correspond to a value of −∞ and 0, expressed as and e, respectively. TEG modeling is intuitive, whereas stability analysis is indirect, but (max,+) algebra can directly analyze the stability, whereas modeling is not intuitive. Therefore, we usually model with a TEG and then convert it to (max,+) algebra for analysis. Converting a TEG model to (max,+) algebra requires two assumptions [10]: a FIFO and an earliest starting policy. A FIFO selects the token that entered the place first when we need to determine which token has contributed to enabling the downstream transition of the place with more than one token. An earliest starting policy fires transitions immediately if all tokens stay at the minimum holding time in the upstream place. The aim of this article is to analyze whether a live autonomous TEG has asymptotical stability so that these assumptions can be established.
The first step in converting a discrete event system modeled with a TEG into a (max,+) algebra model is to express the firing schedule of transitions in a TEG in vector format. In general, the epoch when the rth firing of the transition t i occurs is denoted by t r i , so the vector t r ≡ {t r i |i ∈ T, r = 1, 2, ...} is the firing schedule of the transition in the rth cycle. In that case, the schedule satisfies the following: while µ ij and h ij indicate the number of tokens and the minimum holding time at place p ij , respectively because we assume FIFO and the earliest epoch firing schedule. Equation (1) is an example rewritten in the form of Matrix A(k) for Figure 1: where x r ≡ (t r 1 , t r 2 , t r 3 , t r 4 ) , Given that Equation (2), unfortunately, uses a circular definition that defines x r using x r , to calculate the value of x r , this equation must be redefined as a proper recursive definition by removing A(0) and x r on the right-hand side simultaneously. Therefore, the matrix needs to transform into a standard autonomous equation, which means that all matrices on the right-hand side are integrated into one matrix. The first step of this transformation is to change each matrix A(k) intoĀ(k) = A(0) * ⊗ A(k) to remove A(k) and x r on the right side, where A * is the Kleene star of A. The Kleene star is defined as e ⊕ A ⊕ A 2 ⊕ · · · where e denotes the tropical identity matrix of the same size as Matrix A [14,17].
The general standard autonomous equation form is the following: where¯ x r = { x r , · · · x r+1−M 0 } and M 0 is the maximum initial markings of TEG N : Generally, a standard autonomous equation's size increases in proportion to a maximum number of initial tokens greater than its original size. Therefore, it is necessary to simplify the model's dynamic behavior without changing it for calculation convenience. It is known that the two TEGs are said to be equivalent if there is a bijective mapping that lets two corresponding transitions of two TEGs fire simultaneously from the initial TEG set to the subset of the transformed TEG [10]. To put it another way, any observation of the dynamic behavior of the corresponding transitions of the two equivalent TEGs is identical. This article extends the concept of equivalency by not distinguishing the initial TEG from the derived TEG. Definition 1. Two TEGs N 1 = (P 1 , T 1 , F 1 , H 1 , M 01 ) and N 2 = (P 2 , T 2 , F 2 , H 2 , M 02 ) are said to be equivalent when the following conditions are satisfied: • the set of the transaction of TEG N is a subset of the transaction of the other TEG N 2 there exists a bijective mapping that can fire the corresponding transactions of these two TEGs simultaneously.
There are many ways to reduce the size of matrixĀ such that the reduced TEG is equivalent to the original [10]. Using the first way, if the number of initial tokens of any place of t • of transition t is zero, we remove the column and the row for the transition. The other way depends on whether all elements of the column are . For example, the size of A is originally 12 × 12 because Figure 1 has four transitions and, maximally, three tokens. Next, we can remove the corresponding columns and rows of t 1 and t 3 ofĀ 1 ,Ā 2 , andĀ 3 because the transitions have no downstream place that initially has a token. Finally, we eliminate the columns whose values are all . In conclusion, only (t r 2 , t r 4 , t r−1 2 , t r−1 4 , t r−2 2 ) survives, so Equation (2) is transformed into a standard autonomous equation as follows: If a standard autonomous equation is visualized in TEG form again, it becomes a special form of a TEG with exactly one token in every place, so it is not necessary to represent places and tokens in the TEG. For simplicity, we use a precedence graph, which maps the columns and rows of the matrix to the graph's nodes and maps the elements of the matrix to the weight of arcs in the graph. The precedence graph of TEG N is defined as G(N ) = (V, A, W ). In G(N ), V is the surviving transition after conversion, A is the set of places in which one token connects the transitions, and W is the set of holding times. The precedence graph derived from the standard autonomous equation is known as an equivalent graph to the original TEG. Although the set of transitions of the precedence graph is a subset of the transitions of the original TEG, we can predict the epochs of all transitions because the corresponding transitions of the surviving ones fire at the same time, and the firing epochs of the other transitions are also decided uniquely because of the earliest starting policy. Figure 2 is a precedence graph derived from Equation (4). The node is named to represent the original TEG's corresponding transition, and the note of an arc represents the weight. If the precedence graph is strongly connected, we call the matrix is irreducible [17]. Additionally, if we have a real number λ and a vector x which satisfy the equation, A ⊗ x = λx, λ is an topical eigenvalue, and x is an tropical eigenvector associated with λ. Whereas a general matrix may have several eigenvalues, an irreducible matrix has only one eigenvalue, which we call the max(-algebraic) Perron root of A [23]. The value of λ is the maximum cycle mean of A.
That is, the asymptotic firing epoch pattern for a given firing sequence and holding time depends on the initial firing epoch. For example, assuming that h 21 is four, h 43 is nine, and the others are one, there is more than one asymptotic firing epoch pattern of Figure 1 like Figure 3. Both schedules in Figure 3 have the same holding time and firing sequence, but the above schedule repeats every cycle; in the below schedule, the firing time pattern repeats after firing twice. In this case, the above and the below schedules are called a one-cyclic schedule and a two-cyclic schedule, respectively, and the system has an asymptotic two-cyclicity. Definition 2 gives a formal definition of cyclicity and stability.

Definition 2. A schedule is an asymptotic d-cyclic schedule if there exists an integer d, such as x k+d
i − x k i is a constant, dλ , for only d that is bigger than d and enough big integer k. In other words, the cyclicity of this schedule is d. An asymptotic 1-cyclic schedule is said to be stable or to have stability [12].
Assume that every transition fires under the earliest starting policy. If a system asymptotically converges to less than a d-cyclic schedule based on the critical cycle structure regardless of the initial firing epoch, its cyclicity is d [3]. For a given precedence graph, its cyclicity is the LCM (least common multiple) of the cyclicity of every maximal strongly connected subgraph of G c . The cyclicity of each maximal strongly connected subgraph is the GCD (greatest common divisor) of the number of arcs making up each critical cycle in the subgraph [10,17]. Additionally, if the precedence graph's cyclicity is d, the original TEG's firing schedule is also an asymptotic d-cyclic schedule [12]. Let us illustrate how to calculate the cyclicity with the example in Figure 2. There are four cycles in this precedence graph:π 1 : The precedence graph can be regarded as a TEG, each of whose places has exactly one token. Each cycle's cycle time is the sum of the weights of arcs in the cycle divided by the number of arcs. In this example, the cycle times ofπ 1 ,π 2 ,π 3 , andπ 4 are max{h 23 , max{h 23 +h 23 }+2×h 34 +h 43 +h 41 +h 12 3 , and h 34 +h 43 2 . We are aware that the cycle time ofπ 4 is the sum ofπ 1 andπ 3 . That is,π 4 is a critical cycle, if and only if bothπ 1 andπ 3 are critical. Then, we calculate the cyclicity in the order of the number of critical cycles. First, we consider the case in which there is only one critical cycle. When the critical cycle isπ 1 ,π 2 ,π 3 , the cyclicity is one, three, and two, respectively. Ifπ 4 is critical, bothπ 1 andπ 3 are also critical, so they are not considered now. Next, we consider when there are two critical cycles. If bothπ 1 andπ 3 are critical cycles at the same time, the system is asymptotically stable because these two cycles are connected and GCD(1,3) = 1. If bothπ 2 andπ 3 are critical, the cyclicity is six because the two cycles are disconnected, so LCM(3, 2) = 6. There is only one case in which three cycles are critical:π 1 ,π 3 , andπ 4 are critical cycles at the same time. Because they are connected, the cyclicity is stable because GCD(1, 2, 3) = 1. Finally, if all four cycles are critical, all cycles are connected, and thus the schedule has stability. As a result, considering all cases where this precedence graph is stable,pi 1 must be critical so that the system has stability. However, it is not intuitive to understand whatpi 1 means in the original TEG. We may have trouble deriving a way to improve the system from the fact thatpi 1 should be critical [12]. Therefore, this study proposes analyzing asymptotic behavior in TEGs without (max,+) algebra calculation.

Transformation from a TEG to Its Precedence Graph
This section explains how to transform a general TEG into a precedence graph without going through converting the (max,+) algebra to a matrix form. The precedence graph defined in Section 2 is a special type of TEG with three properties as follows [10]: There is at most one token in each place, there is always a token in all places, and there is only one place that directly connects any two transitions. Therefore, to convert from a general TEG to a precedence graph, we must separate the place with multiple initial tokens into as many places as the number of tokens, remove a place without a token by concatenation with another place, and merge parallel places that directly connect two transitions into one place.
First, we explain how to remove the place with multiple tokens so each place has at most one token. There already exists a method of transforming a place with multiple tokens to another equivalent TEG [10]. Specifically, when a TEG has a place with multiple tokens, as in Figure 4, we can construct another TEG with the corresponding places with at most one token in the initial marking.

Rule 1. Concatenation of sequence places
Precondition: A TEG N = (P, T, F, H, M 0 ) if there exists a place p io that initially has more than one token (M 0 (p io ) > 1, ∃p io ∈ P).
We illustrate Rule 1 with Figure 4. Steps one and two describe how sets of places and transitions are changed. Place p io , with multiple tokens on the left of Figure 4, is replaced with as many new places as the number of initial tokens (i.e., two places with one token, p io−0 and p io−1 ). Transition t i is also divided into t i−0 and t i−1 .
Step three guarantees that each new place has exactly one token. Steps four through seven explain how to connect • t i and t o . The last step defines the holding time of new places. The holding time of the place p io in the original TEG is allocated to p io−{M 0 (p i )−1} , and directly connected to the transition t o . The holding time of the remaining new places is zero. If we apply this rule to all places with multiple initial tokens, the number of places and transitions increases, but it is known that the new TEG becomes equivalent to the original TEG. To sum it up, the firing epochs of the surviving transitions and the number of tokens between them do not change.
We now describe removing the place p with zero tokens from a TEG by concatenating it to another place. Because a live event graph always has the upstream transitions, the transitions belonging to • p may disappear at the same time. However, we assume that the TEG operates using the earliest starting strategy, and so the firing epoch of the removed transition is calculated automatically from the epochs of the remaining transitions. Therefore, the transformed TEG has the same dynamic behavior as the original, so they are equivalent. There are two rules for removing a zero-tokened place, depending on how many downstream places the • p has: Rules 2 and 3. First, if ( • p io ) • = {p io } as in Figure 5, the upstream transition t i in the removed place p io has only one downstream place, p io itself, Rule 2, as inspiration from the serial fusion rule [20], can be applied.

Rule 2.
The case in which both a place with a token and its upstream transition are removed.
Precondition: When a TEG N = (P, T, F, H, M 0 ) has Place p io , which has no initial token, we assume that its upstream and downstream transitions are t i and t o , respectively, and t i has only one downstream place p io (t   Figure 5 shows an example in which place p io without any token is concatenated to •• p io , and its upstream transition t i is removed. As a result, the number of places and transitions of the new equivalent TEG decreases by one. The new place is named p ai p io and p bi p io in succession, with two concatenated places' names, and their initial markings are the same as p ai and p bi , respectively. Their holding times are the sum of two holding times of the merged places (i.e., h ai + h io and h bi + h io ). Lemma 1 proves that the TEG derived by Rule 2 is equivalent to the original TEG.
If firing epochs of transitions other than t o are the same, the two TEGs are equivalent by Definition 1, given that the number of tokens between the remaining transitions and firing epochs of t o do not change.
The next rule removes zero-tokened p io , whose upstream transition t i has multiple downstream places. After applying this rule, a place without a token in the original TEG is concatenated to the preceding places •• p io , but the upstream transition t i does not disappear.

Rule 3.
The case in which a place with a token is removed, but its upstream transition survives.
Precondition: When a TEG N = (P, T, F, H, M 0 ) has Place p io , which has no initial token, we assume that its upstream and downstream transitions are t i and t o , respectively, and t i has multiple downstream places, unlike Rule 2 (t Rule 3 is similar to Rule 2 in that a place without a token is concatenated to the upstream places of its upstream transition, but its upstream transition has other downstream places, so it is making the two rules different in that the transition survives after applying the rule. Figure 6 shows an example in which place p io is replaced with p ai p io and p bi p io according to Rule 3. This example does not remove the upstream transition t i of p io , as opposed to Rule 2. The number of transitions of both TEGs before and after applying the rule is the same as five, but the total number of places increases by the number of upstream places of t i . The holding times, the initial markings, and the naming convention of transformed places are the same as those in Rule 2. Lemma 2 proves that the TEG after applying Rule 3 is equivalent to the original TEG.  t o fires at the same time as before the rule was applied for the same reason as in Lemma 1. In addition, the initial marking of the new place M 0 (p ji p io ) = M 0 (p ji ), where p ji ∈ • t i , so the number of tokens between t j and t o has not changed. That is, the transformed TEG from applying Rule 3 is equivalent to the original TEG.
Finally, we examine the case in which merging multiple places with the same number of tokens connecting two consecutive transitions into one, as shown in Figure 7. We can apply Rule 4 for this case.

Rule 4. Merging of parallel places.
Precondition: There is an arbitrary subset S of places in which the initial token number, the upstream transition t i and the downstream transitiont o of all places belonging to S are the same.
Rule: All places belonging to the set of places S may be replaced by a single place, specifically a transformed equivalent TEG N f = (P f , T, F f , H f , M 0 f ) such that By way of explanation, if we apply Rule 4, the new place's holding time is the maximum of the original places, and its upstream transition and downstream transition do not change. We denote | notation to indicate which places are merged in the place newly created by Rule 4 when parallel places directly connect two transitions. Figure 7 illustrates how zero-tokened places p io and p io , which directly connect t i and t o merge to form p io |p io . Its holding time becomes the maximum value of the holding time of p io and p io . Lemma 3 proves that the new TEG after this transformation is equivalent to the one in existence before the application of Rule 4.   (6) to Equation (7): If the firing epochs of the other transitions except for t o are the same as before, the firing epoch of t o is also the same. Therefore, by Definition 1, the TEGs are equivalent. This paper proposes four rules to simplify the equivalent TEG. If we repeatedly apply the transformation rules proposed in this paper, we can finally derive a TEG equivalent to the original TEG to satisfy the properties of the precedence graph. We have already proved that a transformed TEG is always equivalent even after applying any of Rules 1-4. Therefore, we now show that repeatedly applying rules can make a TEG eventually satisfy the precedence graph's properties. In other words, every place has exactly one token in the final TEG, and the number of places directly connecting any two transitions is at most one. To prove that every place has exactly one token, we first show that any place has at most one token by contradiction. In other words, we hypothesize that there remains a place with two or more tokens no matter how often the rule is applied. In this case, we can decrease the number of tokens to one by applying Rule 1 to a place with multiple tokens. This decrease violates the hypothesis that, no matter how much the rule is applied, a place with multiple tokens cannot be removed. Therefore, we can always make the number of tokens fewer than one in all places. Next, we prove that there is at least one token in every place. The event graph, which this paper considers, is autonomous, so every place has its input transition. Therefore, we prove that every place has at least one token by showing that every transition has only its downstream places with tokens. When there is a transition with a downstream place without tokens, we divide the cases by the number of its downstream places. If the transition has only one downstream place without tokens, we can remove the transition using Rule 2. After that, a TEG has no transition, whose downstream place has no token. If the transition has multiple downstream places, we can remove a downstream place without tokens by applying Rule 3. If the transition has multiple downstream places with no tokens, we can remove them by applying Rule 3 repeatedly until every downstream place has at least one token. This way, we can make sure every place has at least one token. Finally, we prove by contradiction that there is at most one place that directly connects two arbitrary transitions. Expressly, we assume that no matter how many times rules are applied, there still remain multiple places that directly connect two transitions. We can make the number of tokens in those places at most one by Rule 1. If a place with more than two tokens exists, it does not link directly between the transitions because the place is replaced with a series of other places and transitions. Next, places that connect directly connected transitions are merged according to the number of tokens by Rule 4. After applying Rule 4, if the places are merged into one, the assumption that we cannot merge places between two transitions into one is violated. If there are two places, one place has a token and the other has no token. Rule 3 can make it so there is only one place between the transitions by removing the place without tokens, so this situation also violates the assumption. Therefore, we can make a TEG in which every pair of transitions is connected by one place at most. In conclusion, if we apply Rules 1-4 repeatedly to a live autonomous TEG, we can achieve a TEG equivalent to the original and eventually have the properties of a precedent graph. Figure 8 illustrates the process of deriving a precedence graph from Figure 1 while repeatedly applying transformation rules. For better understanding, the newly created place in each step is highlighted in gray. First, parallel places p 23 and p 23 are merged using Rule 4. In the next step, places with multiple tokens p 21 and p 43 are divided into corresponding places by Rule 1: (p 21 ⇒ p 21−0 , p 21−1 and p 21−2 ) and (p 43 ⇒ p 43−0 and p 43−1 ). Now, there are currently three places without tokens, p 12 , p 34 , and p 41 , so we must remove them using Rules 2 and 3. The upstream transition of each of places p 12 and p 32 has only one downstream place, so Rule 2 is applied. For p 12 , the upstream transition t 1 is removed, and the place p 12 is concatenated to p 21−2 and p 41 , which belong to the upstream places of t 1 . Like p 12 , p 34 is concatenated with p 43−1 and p 23 |p 23 by removing Transition t 3 . Now, there only remains one place without tokens, p 41 p 12 . Its upstream transition is t 4−0 , which has two downstream places, p 41 p 12 and p 43−0 . After Rule 3 is applied, two new places are created by concatenating p 41 p 12 with the upstream places of t 4−0 , (p 23 |p 23 )p 34 and p 43−1 p 34 , respectively. The TEG in the last step of Figure 8 has the precedence graph's properties and is isomorphic with the precedence graph in Figure 2.
Proof. To prove this lemma, we show that, if any downstream place has a token, we cannot remove its upstream transition, and if there is no place with a token among the downstream places, the transition is always removed.
First, we prove that a transition whose downstream places have tokens is not removed. Only Rule 2 eliminates a transition after applying the rule. The precondition of the rule is that there is no token in the downstream place of the transition. Even when the downstream transition of its downstream place has been previously eliminated, the token cannot exist in the new downstream place because it occurs only as a result of Rule 2, so the place does not have a token. Therefore, a corresponding transition exists in the precedence graph derived by repeatedly applying transformation rules when one or more downstream places have tokens.
Next, we show that the transition without a token in the downstream place is finally not included in the precedence graph. If all downstream places of a transition have no tokens, Rule 3 is applied repeatedly until only one downstream place is left, and then the transition can be eliminated using Rule 2. Therefore, a transition whose downstream places have no tokens is eventually removed.
For example, let's check how to map the transitions of TEG N in Figure 1 to the vertices of precedence graph G(N ) in Figure 2. The only transitions with tokened downstream places are t 2 and t 4 in the TEG N , and their corresponding vertices are as follows: t 2 ⇒(t 2−1 , t 2−2 and t 2−3 ), and t 4 ⇒(t 4−0 and t 4−1 ). In other words, only the corresponding vertices of t 2 and t 4 of the precedence graph have downstream place tokens.
Next, we examine the view of the cycle. Because a live autonomous TEG has a token for each cycle, at least one transition survives as a corresponding vertex for each cycle. In this example, the cycles π 1 and π 2 of N go through both t 2 and t 4 , and the cycles π 3 and π 4 go through both t 2 and t 4 . Looking at the corresponding transition of the vertex included in each cycle of G(N ), cyclesπ 1 andπ 2 have only t 2 , andπ 3 is related to t 4 . Cycleπ 4 is related to both t 2 and t 4 . Then, what is the relationship between the cycles of N and G(N )? Lemma 5 investigates the relationship between the two. Proof. We prove this lemma by observing how each rule changes a cycle based on how reachable the transition is. That one transition is reachable from another means that a path exists between them.
First, we prove that Rule 1 does not change the reachability among transitions. According to the rule, the corresponding transitions of t i denoted as t i−j are reachable from t i−0 by 5-8 of Rule 1. Additionally, only transitions having a path to t i have a path to t i−j and vice versa because the sets of upstream places of t i and t i−o are the same. For the same reason, a transition is reachable from t i−j after applying the rule if and only if it is reachable from t o before doing so. From the point of view of a cycle, if t i belongs to a particular cycle before applying the rule, its corresponding transitions t i−j belong to the corresponding cycle. In other words, Rule 1 does not change the transition's reachability, so we can find the corresponding cycle of any cycle after applying the rule. This rule does not change the number of tokens or the cycle times either. Although the number of places increases by the number of tokens, the number of tokens in the newly created place is one for each, so the numbers of tokens of both TEG are identical. The sum of the holding time of the corresponding cycle is not changed because this rule decomposes one place into multiple places, but only one place p io−{M 0 (p io )−1} has the same holding time as the original place p io , and the rest of the places p io−j have zero holding times for a positive integer j that is smaller than M 0 (p i ). As a result, the number of cycles does not change after applying Rule 1, and the cycle time of the corresponding cycles is the same as the original cycle times. Rule 2 also does not change reachability, except for the direct connections of •• t i and t o caused by the removal of t i . Therefore, the sets of transitions reachable to •• t i and reachable by t o do not change, so the reachabilities between surviving transitions remain. From the viewpoint of the cycle, the cycles including t i for the transitions in •• t i directly connect to t o after applying Rule 2. The cycle has the same cycle time and sum of tokens as the original because p ji p io calculates the value by summing tokens of concatenated places p ji and p io where t j belongs to •• t i . In summary, Rule 2 does not change the number of cycles or the cycle time of each cycle.
After applying Rule 3, the directly connected path from t i to t o disappears when the place p io is removed. The result excludes t i in the cycles that include both t i and t o initially. This removal divides the cycles formerly including t i into two kinds of cycles: cycles including the new place that directly connects •• t i to t o and the unchanged cycles that still include t i . Additionally, this rule creates new cycles that concatenate these two types of cycles not to pass the same arc or transition except for t i . In other words, we build a new cycle by connecting two different kinds of cycles after switching the upstream place of t i in two cycles. Therefore, the total holding time and number of tokens of the created cycle are the sums of the data for two connected cycles. To help understand the proof, we illustrate how Rule 6 increases cycles using Figure 6. In the figure, the dotted line and the gray line denote the arbitrary path to create a cycle and the newly created cycle, respectively. Assume that t a and t b belong to •• t i and t o and t q are in t •• i , where t a is not t b and t o is also not t q . The left TEG has two cycles with p io and p iq , which share no transition except t i . The right TEG has an additional new cycle connecting them in the following way: decrease the cycle in the sequence of t b , the new place p bi p io , t o , the path removing p io from the cycle including p ai and p io (t o → · · · → t a → p ai → t i ), and the path removing p bi from the cycle including p bi and p iq (p iq → · · · → t b ).
Rule 4 does not change transitions. It merges places whose upstream transition, downstream transition, and token number are identical. Given that these merged places have the same upstream transition and downstream transition, the reachability does not change. That is, if and only if there was a cycle that a merged place p io could make with t o → · · · → t i , all other merged places also make a cycle use the same path. We can also compose a cycle using the new place with the same path. Thus, if the original TEG has n × m cycles because there are m different paths from t o to t i and n places are merged by Rule 4, the number of cycles decreases to m after the rule is applied. The cycle time of transformed TEG becomes the maximum cycle time of n merged cycles. The number of tokens in the corresponding cycle does not change.
We can now comprehend the meaning of the proof of Lemma 5 using Figure 8. The first step merges places p 23 and p 23 by applying Rule 4, so the cycles π 1 and π 2 are combined into one cycle. The cycle time of the combined cycle is the same as the maximum of cycles π 1 and π 2 , and its token numbers are unchanged. Other cycles π 3 and π 4 remain, so the number of cycles decreases to three. The next step decomposes the corresponding transitions from t 2 and t 4 by Rule 1. Consequently, cycles π 3 and π 4 increase the number of transitions and places, but the transformed TEG keeps the cycles and cycle times. The third step removes the places p 12 and p 34 using Rule 2. Cycle π 3 becomesπ 2 , each of whose places has exactly one token. Cycleπ 2 still keeps the number of tokens and the sum of the holding times of places that make up the cycle, so the cycle times of π 3 andπ 2 are the same. Similarly, π 4 becomesπ 3 , and their cycle times are equal. In the final step, applying Rule 3 causes the place p 41 p 12 to disappear. As a result, we can remove all zero-tokened places in the combined cycle from the first step, and we call itπ 1 .
The cycle time ofπ 1 is still the maximum of π 1 and π 2 , and the number of tokens is maintained as one. Additionally, this step creates a new cycleπ 4 by connectingπ 1 andπ 3 . The newly createdπ 4 has the cycle time of the sum of the maximum cycle time of cycles π 1 and π 2 plus π 4 . Its number of tokens is three, which is the sum of the number of tokens in the connected cycleπ 1 andπ 3 . As such, Figure 8 satisfies Lemma 5. From the proof of Lemma 5, we can also derive Collarories 1-3.

Corollary 1.
If a cycleπ of a precedence graph G(N ) corresponds to one cycle π of the original TEG N , its length is the same as the number of tokens of π. By comparison, if a cycleπ is the concatenation of more than two cycles π i , · · · π j , its length equals the sum of the number of tokens in π i · · · π j . Corollary 2. If a cycleπ of a precedence graph G(N ) corresponds to one cycle π of the original TEG N , the sum of the holding times of the places it comprises is the same as the sum of the holding times of the places that make up π. Ifπ is derived from the concatenation of multiple cycles π i , · · · π j , the sum of the holding times of all places constitutingπ equals the holding times of the places included in π i , · · · π j . However, if there are places merged by Rule 4 among π i , · · · π j , only the maximum value is added without adding their individual values. Proof. Lemma 5 shows that the reachability is unchanged except in the case of Rule 3. Rule 3 eliminates the place directly connecting t o from t i , so we suspect that t o may no longer reach t i . However, given that every transition in a live autonomous TEG is included in any cycle, t i has a path to •• t i , and •• t i can connect to t o via new places. Therefore, there is a path, t i → · · · → •• t i → new place → t o . In conclusion, Rule 3 also does not change the reachability.
It is known that the stationary behavior is d-cyclic if the transitions of a strongly connected TEG fire under the earliest starting strategy [3]. From the lemmas and corollaries proved thus far, we can find the cyclicity in a live autonomous TEG as Theorem 1.
Theorem 1. When a live autonomous TEG N is strongly connected, the cyclicity of a TEG N is the LCM of the cyclicities of all maximal strongly connected subgraphs of N c , which is a critical graph consisting only of critical cycles. The cyclicity of each maximal strongly connected subgraph of N c is the GCD of the number of tokens of all its cycles. In other words, if the cyclicity of a TEG N is d, it has an asymptotic d-cyclic schedule, and, if it is an asymptotic one-cyclic schedule, this system is said to be stable or to have stability.
Proof. Definition 2 said that the one-cyclic schedule is stable, so this proof focuses on whether the TEG's cyclicity calculation is correct. Additionally, it is known that the asymptotic cyclicity of a strongly connected precedence graph G(N ) can be calculated by the LCM of the cyclicities of all maximal strongly connected subgraphs of its critical graph G c (N ) [10]. The cyclicity of each strongly connected subgraph of G c (N ) is the GCD of the number of arcs of all its cycles. Therefore, we prove this theorem in the following order: 1.
If and only if there exists a critical cycleπ in G(N ), there exists a corresponding critical cycle and/or a connection of the corresponding critical cycles in N .

2.
π i and π j belong to the same component of N c if and only if the corresponding cycle of π i and π j and their connection in G c (N ) also belong to the same component.

3.
The GCD of the number of tokens of all its cycles in each maximal strongly connected subgraph of N c is the same as the GCD of the number of arcs of all its cycles in each maximal strongly connected subgraph of G(N ).
1. First, we prove that G(N ) has a critical cycleπ if and only if its corresponding cycle is critical and the cycle including it is critical in N . A critical cycle is a cycle that has the maximum cycle time, calculated by the sum of the holding times of the places divided by the number of tokens in the cycle. The number of tokens and the sum of holding times of each cycle remain after the transformation, according to Corollaries 1 and 2 with the exception of Rule 4. Even Rule 4 does not change which cycle is critical because the cycle time after the transformation depends on larger cycle times among merged cycles by applying Rule 4. In other words, if a merged cycle is one of the critical cycles, its cycle times affect the cycle time after the transformation, so the corresponding cycle also becomes critical. Using this fact, we prove that the critical cycle of G(N ) is the corresponding critical cycle of N or a concatenation of the critical cycle.
Assume thatπ corresponds to one cycle in N . In addition, suppose that the critical cycle π c of N is not the corresponding cycle of the critical cycleπ of G(N ). The cycle does not disappear even after rules are applied. Therefore, there is always a cycle in N corresponding to cycleπ. Similarly, G(N ) has a corresponding cycle of a critical cycle π c in N . Because π c is critical, its cycle time is greater than or equal to the cycle time of the corresponding cycle ofπ. Cycleπ is critical in the precedence graph, so the cycle time of π is greater than or equal to the corresponding cycle time of π c . Remember that the cycle time and the number of tokens are unchanged after the transformation. For both to be true, the cycle time ofπ and π c must be the same: that is, if and only ifπ is critical for G c (N ) and corresponds to one cycle in N , the corresponding cycle is also critical for N .
Next, assume thatπ is a connection of the cycle π i and π j in the original TEG. We denote the sums of holding times of π i and π j as h i and h j and their token numbers as µ i and µ j , respectively.
without losing generalization and that the critical cycle of the original TEG is π c . Its holding time and the number of tokens are h c and µ c , respectively. Given that the corresponding cycle of π c exists in the precedence graph andπ is a critical cycle, the following inequality holds: Cycle π c is one of the critical cycles in the original TEG, so h c For both this inequality and Equation (8) to be established at the same time, That is to say, if the critical cycleπ is the connection of the cycles π i and π j in the original TEG, π i and π j are also critical cycles in the original TEG, and their cycle times remain.
Finally, we prove that, ifπ corresponds to the connection of π i and π j , which are critical in N ,π is also a critical cycle of G(N ). The critical cycle of G(N ) is the same as the cycle time of the original TEG in the previous proof. Because π i and π j are critical together, . Therefore, the cycle time ofπ is h i +h j µ i +µ j is the same as the cycle time of π i and π j . In conclusion, if critical cycles' connections exist in the form of cycles in the precedence graph, they are also critical cycles.
2. Corollary 3 says that the reachability of cycles of the original TEG stands up in the precedence graph. Therefore, if and only if any critical cycle π i and π j belongs to the same component in N c , their corresponding cycle or existing connection of corresponding cycles belongs to the same component in G c (N ). a critical cycle,π 1 in Figure 2 is a critical cycle, and its cycle time is h 12 + max{h 23 , h 23 } + h 34 + h 41 . Cycles π 3 and π 4 are transformed intoπ 2 andπ 3 , respectively, and their cycle times are the same even after the transformation, so the critical cycle does not change. Finally, forπ 4 to become a critical cycle, π 4 must be a critical cycle, and, additionally, π 1 or π 2 must be a critical cycle. Table 1 summarizes which cycle in Figure 8 becomes the critical cycle caused by each critical cycle in Figure 1, as well as each cycle's cyclicity. If cycles π 1 or π 2 are included in the critical cycle,π 1 is included in the critical cycle, and its cyclicity is one. When π 3 or π 4 is an only critical cycle, the number of tokens in each cycle is three and two, so each cycle's cyclicity is also three and two, respectively. In addition, if π 4 is a critical cycle with π 1 or π 2 together, these cycles are connected, so the cyclicity is also one because of the GCD of the number of tokens, one and three. In this case,π 1 ,π 3 andπ 4 are critical cycles together; they are connected to each other; and their numbers of tokens are one, two, and three, so their GCD, or the cyclicity is one. If π 3 and π 4 are critical cycles at the same time, its cyclicity is six because the LCM of token numbers, three and two, and the two cycles are disconnected. In conclusion, cycles π 1 or π 2 should be a critical cycle to have a steady schedule in Figure 1 . Critical Cycle (Cyclicity) π 1 π 2 π 3 π 4 π 1π1 (1)π 1 (1)π 1 ,π 2 (1)π 1 ,π 3 ,π 4 (1) π 2π1 (1)π 1 (1)π 1 ,π 2 (1)π 1 ,π 3 ,π 4 (1) π 3π1 ,π 2 (1)π 1 ,π 2 (1)π 2 (3)π 2 ,π 3 (6) π 4π1 ,π 3 ,π 4 (1)π 1 ,π 3 ,π 4 (1)π 2 ,π 3 (6)π 3 (2)

Conclusions
Some discrete event systems with time window constraints require a method to analyze asymptotic stability and cyclicity. The system designers want to check whether the same time pattern repeats eventually after a long time. There is a traditional way to analyze the stability and the cyclicity of a discrete event system: model it using a timed event graph, convert it into a standardized matrix form of (max,+) algebra, and analyze the cyclicity using the derived precedence graph from the matrix.
However, the traditional method uses different formal methods for modeling and analysis, so improving the system to make it stable is complex and unintuitive. The main contribution of this paper is to propose a method to calculate the cyclicity directly from a timed event graph. That is, we can determine whether a given system has asymptotical stability with the initial tokens, the cycle time of each cycle, and its connectivity of a TEG. Additionally, the article suggests how to measure the cyclicity of a system that is not stable. That is, we can measure after how many cycles the time pattern repeats. In other words, to analyze asymptotic cyclicity and stability, we should know the TEG's critical cycle, the sum of the tokens in each critical cycle, and the connectivity of critical cycles. Our results directly interpret the system's model to view its asymptotic behavior, so it is easy to improve the system to make the system stable.
The result of this paper can improve a time-constrained system design. For example, we expect to use the suggested method to analyze time-constrained discrete event systems such as CVD or a hoist system and to simulate the effect to validate our theory practically. Finally, we can extend the investigated relationship between the properties of a Petri net and (max,+) matrix to apply other analyses of (max,+) algebra to a Petri net.
Funding: This research received no external funding.

Institutional Review Board Statement: Not applicable.
Informed Consent Statement: Not applicable.

Conflicts of Interest:
The authors declare no conflict of interest.