Fault Tolerance, State Estimation and Fault Diagnosis in Petri Net Models
|
|
- Sharon Harrington
- 5 years ago
- Views:
Transcription
1 Fault Tolerance, State Estimation and Fault Diagnosis in Petri Net Models Christoforos Hadjicostis Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign March 27, 2007
2 Outline Fault Tolerance in Petri Nets (e.g., Petri Net Controllers) Redundant Petri net embeddings Fault detection and identification Fault-tolerant supervisor for arbitrary forbidden states Estimation and Diagnosis in Labeled Petri Nets Complexity assessment: bound on number of markings Implications to state estimation and diagnosis On-line least-cost transition firing sequence estimation
3 Overview Fault Tolerance Estimation and Diagnosis Problems Conclusions Motivation Motivation Gottwald Port Technology, Germany Estimate state, diagnose fault conditions, avoid collisions, etc. in Automated Guided Vehicles (AGVs)
4 Motivation AGV 1 Input Parts Station Workstation 1 AGV 3 AGV 2 Workstation 2 Workstation 3 AGV 4 AGV 5 Completed Parts Station Petri Net Model of AGVs Cited from [Holloway, 1990], [Moody, 1998]
5 Motivation Other Applications of Petri Nets Network protocols Supply chains Manufacturing systems Railway/metro systems scheduling and control Military systems
6 Literature Review Earlier Related Work State Estimation Labels introduce uncertainty Uncertain initial state Unobservable transitions Boel, Genc, others Fault Diagnosis Fault modeling Unreliable observation Error correction Giua, Rohloff, others Paoli, Rohloff, others Supervisory Control Liveness enforcement Deadlock prevention Forbidden state problem
7 Literature Review Challenges Estimation Uncertain transitions (shared labels) Unobservable transitions (empty labels) Control Uncontrollable transitions Maximal permissiveness Fault Tolerance Faulty operation (resulting in erroneous activity) Faulty sensors (resulting in unreliable observations)
8 Petri Net Basics Petri Net Basics: Notation and Structure p1 t1 (a) t6 (c) p4 Places P = {p 1, p 2, p 3, p 4 } (a) t4 t5 (b) t2 (a) Transitions T = {t 1, t 2, t 3, t 4, t 5, t 6 } Arcs F (P T ) (T P) Weight function W : F N Marking M : P N 0 p2 t3 (b) p3 Initial marking M 0 = ( ) T Labeling function L : T Σ {λ} (in general, many-to-one) transition t 1, t 4, t 5 t 2, t 3 t 6 label a b c Note: This labeling function is λ-free
9 Petri Net Basics Petri Net Basics: Dynamics and Marking Evolution p1 t6 (c) p4 t Evolution: M 1 t 0 2 t M1 4 M2 M3 t1 (a) (a) t4 (b) t2 t5 (a) Firing sequence S: t 1 t 2 t 4 Observation sequence ω: aba State equation: M 3 = M 0 + Dσ p2 t3 (b) p3 Firing vector σ: ( ) T M 1 = ( ) T, M 2 = ( ) T, M 3 = ( ) T Incidence matrix: D = D + D = C A
10 Fault Detection and Identification in Petri Net Controllers Fault Tolerance: Part I Fault Detection and Identification in Petri Net Controllers
11 Fault Detection and Identification in Petri Net Controllers Fault Detection and Identification in Petri Net Controllers Motivation Monitoring of large-scale systems Tolerance to faults in controllers modeled by Petri nets Objective Design redundant Petri net controllers that (i) Allow for fault detection and identification (ii) Maintain the functionality of the original controller Bisimulation equivalence between original and redundant controller Bisimulation equivalence conditions: for all initial markings of interest Transitions enabled in original controller also enabled in redundant controller Transitions enabled in redundant controller also enabled in original controller
12 Fault Detection and Identification in Petri Net Controllers Existing Petri Net Controller Designs Restrict system behavior so that only legal markings can be reached Holloway and Krogh (1990), Ushio (1990), Li and Wonham (1993), etc. Event feedback Petri net controller design Restrict system behavior within the legal behavior Ramadge and Wonham (1989), Giua and DiCesare (1991), etc. Linear algebraic approach Satisfy a set of linear constraints on markings Li and Wonham (1993), Giua, DiCesare, and Silva (1992, 1993), Moody et al. (1994), etc. Our goal: Protect given Petri net controller against faults Designs of separate redundant Petri net controllers Designs of non-separate redundant Petri net controllers
13 Fault Detection and Identification in Petri Net Controllers Place Fault Model Captures corruption of token number in a single place Results in erroneous state at time epoch t M f [t] = M[t] + ve p where (i) M[t]: fault-free state at time epoch t (ii) e p Z n : unit vector (single unit entry at location p) (iii) v: integer number of tokens added or subtracted
14 Fault Detection and Identification in Petri Net Controllers Transition Fault Model Post-condition transition fault Token-load of output place-set of transition not appropriately updated after firing Erroneous state at time epoch t M f [t] = M[t] D + e + T Pre-condition transition fault Token-load of input place-set of transition not appropriately updated after firing Erroneous state at time epoch t M[t]: fault-free state at time epoch t e + T : Post-condition transition fault vector, e T M f [t] = M[t] + D e T : Pre-condition transition fault vector
15 Fault Detection and Identification in Petri Net Controllers Separate Redundant Petri Net Controller Given a controller implemented/modeled as a Petri net Design a separate redundant Petri net controller which incorporates additional (redundant) places allows external checker to detect and identify faults maintains functionality of original controller Note: Original controller is kept intact (thus, separate controller ) Plant Petri net Controller Redundant Places Marking Information Checker Error? Separate Redundant Petri net Controller
16 Fault Detection and Identification in Petri Net Controllers Designs of Bisimilar Separate Redundant Controllers Given a Petri net controller with n places, m transitions State equation: M c [t + 1] = M c [t] + (D + c D c )x[t] Add d redundant places separate redundant Petri net controller (with n + d places and m transitions) where M h [t] = M h [t + 1] = M h [t] + (D c + Dc )x[t]»» D + = M h [t] + c D X + x[t] c X x[t] {z } {z }» In C D + c M c[t] with C to be designed Goal: Design C, X + and X so that original and redundant controllers are bisimilar D c
17 Fault Detection and Identification in Petri Net Controllers Maintaining Bisimulation Equivalence Design requirement: Bisimulation equivalence Theorem: Separate redundant Petri net controller is bisimulation equivalent to the original controller if and only if X + = CD + c D, X = CD c D C is a matrix with nonnegative integer entries D is a matrix with nonnegative integer entries such that D min(cd + c, CD c ) Parametrization of possible separate redundant controllers Question: How can we detect and identify faults?
18 Fault Detection and Identification in Petri Net Controllers Fault Detection and Identification in Separate Controllers Fault detection and identification Parity check matrix: P = [ C I n ] Verify that fault syndrome s[t] PM f [t] is zero [ In PM h [t] = 0 because fault-free state M h [t] = C ] M c [t] Place fault detection and identification Fault syndrome at time epoch t: s p [t] Pq f [t] = P(q h [t] + ve P ) = vpe P Fault detection and identification determined by P (equivalently, C) For single place fault detection and identification, we need: columns of matrix P not to be rational multiples of each other
19 Fault Detection and Identification in Petri Net Controllers Fault Detection and Identification in Separate Controllers Transition fault detection and identification Post-condition fault syndrome at time epoch t: s + T [t] De+ T Pre-condition fault syndrome at time epoch t: s T [t] De T Fault detection and identification determined by D For single transition fault detection and identification: choose matrix D such that columns of D are distinct By appropriately choosing matrices C and D Design of bisimilar separate redundant Petri net controller Perform fault detection and identification Rank requirement on matrices C and D translate to ability to detect place and/or transition faults
20 Fault Detection and Identification in Petri Net Controllers Non-Separate Redundant Petri Net Controller Given a controller implemented/modeled as a Petri net Design a non-separate redundant Petri net controller which allows for recovering the states of the original controller enables fault detection and identification maintains functionality of original controller Note: Original controller not necessarily intact (thus, non-separate ) Plant Marking Information (Linear) Parity Check Error? Non-separate Redundant Controller (Linear) Decoding Controller States
21 Fault Detection and Identification in Petri Net Controllers Designs of Bisimilar Non-Separate Redundant Controllers Given a Petri net controller C (n places and m transitions) with state evolution: M c[t + 1] = M c[t] + (D + c D c )x[t] Definition: A Petri net H with η = n + d places, m transitions and state evolution M h [t + 1] = M h [t] + (D + c D c )x[t] q h [t] + D cx[t], is a non-separate redundant controller of controller C if there exist (i) a full-column rank encoding matrix G with nonnegative integer entries (ii) a matrix D with nonnegative integer entries satisfying D min(gd + c, GD c ) so that M c[t] = LM h [t] and M h [t] = GM c[t] for all time epochs t 0 D + c = GD + c D, D c = GD c D
22 Fault Detection and Identification in Petri Net Controllers Designs of Bisimilar Non-Separate Redundant Controllers Design requirement: Bisimulation equivalence Given a n-dimensional column vector z, the support of z is the set of nonzero indices of z and is denoted by z ( {1, 2,..., n}), i.e., z = {i z i 0} Matrix G = [g 1 g 2... g n] has independent column support if [ i {1, 2,..., n}, ( g i g j ) j {{1,2,...,n} i} Theorem: H is bisimulation equivalent to C if and only if Matrix G has independent column support Matrix D has zero entries in the rows having independent support in G Characterization of non-separate embeddings
23 Fault Detection and Identification in Petri Net Controllers Place Fault Detection and Identification in Non-Separate Redundant Controllers Parity check matrix P that has maximum row rank and satisfies PG = 0 Fault syndrome at time epoch t: s p [t] Pq f [t] = P(q h [t] + ve P ) = vpe P Fault detection and identification determined by P For single place fault detection and identification: choose matrix P such that any two columns are not rational multiples of each other
24 Fault Detection and Identification in Petri Net Controllers Advantages of Non-separate Redundant Controllers Under bisimulation equivalence requirement Two types of redundant controllers share identical fault detection and identification capabilities Require the same number of connections and redundant places to detect and identify the same number of faults If bisimulation equivalence requirement is not directly enforced Non-separate redundant controller can be more general (e.g., use fewer connections than the separate ones to detect and identify the same number of faults) Error? Plant Enable/disable Signal (Linear) Parity Check Marking Information Non-separate Redundant Controller Decoding Marking Information Controller Places
25 Fault-Tolerant Control for Arbitrary Forbidden State Specs Fault Diagnosis and Tolerance: Part II Fault-Tolerant Control for Arbitrary Forbidden State Specifications in Bounded Petri Nets
26 Fault-Tolerant Control for Arbitrary Forbidden State Specs Fault-Tolerant Control for Arbitrary Forbidden States Motivation Arbitrary forbidden state specification For safe and conservative Petri nets, there exist equivalent generalized mutual exclusion constraints (GMEC) In general, they cannot be efficiently expressed via linear inequality constraints Token corruption in places Place faults and transition faults corrupt tokens in places Accurate token information of monitor places key to monitor-based control policies Challenges Uncontrollable transitions; maximal permissiveness needs to be maintained; token corruptions in places due to faults
27 Fault-Tolerant Control for Arbitrary Forbidden State Specs Basic Concepts Reverse net N Given a Petri net N, N retains the structure of N but reverses the directions of its arcs Control set Definition: U = {u u T c = T \T uc} u is a control value Control policy f : R(G) U where R(G) is the reachability set Optimality criterion: maximize the enabled transition set for each state R (M, u zero) All markings that can be reached from M by only firing uncontrollable transition sequences
28 Fault-Tolerant Control for Arbitrary Forbidden State Specs Existence of Maximally Permissive Control Policy Weakly Forbidden Marking Set Given a set of forbidden markings M F, W (M F ) = {M R (M, u zero ) M F } Existence of Maximally Permissive Control Policy M 0 / W (M F ) Computation of the set of weakly forbidden markings W (M F ) = R (M F, u zero ), where R (M F, u zero ) denotes all reachable markings from M F under u zero in the reverse net N By analyzing N, we obtain W (M F ) without constructing influence paths
29 Fault-Tolerant Control for Arbitrary Forbidden State Specs Supervisor Synthesis Transformation Function Given a K-bounded Petri net with n places and marking M, Γ(M) = CM where [ ] n 1 n C = 1 B B 2... B n 2 B n 1 and B = max(k + 1, 3). Properties Γ is injective Add two monitor places = separate Petri net embedding with G = [I n C T ] T and P = [C I 2 ]
30 Fault-Tolerant Control for Arbitrary Forbidden State Specs Control Policy How can monitor places help us? W (M F ) is injectively mapped to I F Equivalent control synthesis problem Find a policy to prevent Γ(M) from reaching I F Γ(t i ) CD(:, i): if M[t i M, Γ(M ) = Γ(M) + Γ(t i ) Control Policy For t c at current state M: if Γ(M) + Γ(t c ) I F, t c is control disabled Implementation: (i) sort I F into S F element-wise (off-line) (ii) check whether Γ(M) + Γ(t c ) is in S F element-wise using binary search algorithm (online)
31 Fault-Tolerant Control for Arbitrary Forbidden State Specs Single Place Fault Detection and Correction Proposition If B 3, then the columns of» n 1 n 1 0 P = [C I 2] = 1 B B 2... B n 2 B n are not rational multiples of each other. Fault model: µ he = µ h + ve(i) Fault detection and correction Fault detection: if PM he is a multiple of P(:, i), then the tokens in place p i have been corrupted Fault correction (i) fault in original places: M h (p i ) = M h(p n+1 ) P n k=1,k i km h (p k ) i (ii) fault in monitor places: M h (p i ) = C(i n, :)M
32 Fault-Tolerant Control for Arbitrary Forbidden State Specs Example p1 4 3 p3 2 t1 t p2 t2 p3 p p1 (a) 4-bounded net with T uc = {t 3} Existence of maximally permissive supervisor (b) Forbidden states (red) mapped on a 3D grid M 0 / W (M F ) (represented by red and yellow nodes) Encoding system states» Γ(M) = M j»» 7 9 S F =,, 16 40» 9, 56» ff (sorted)
33 Fault-Tolerant Control for Arbitrary Forbidden State Specs Example Actuator Supervisor p1 t1 t3 Fault Diagnosis and Correction 4 p2 20 t2 p3 24 p4 2 8 p5 36 Control Policy Sensor At M 0, the control value u = t 3 will eventually fire and result in M 1 Fault Identification and Correction M he = ( ) T : as PM he = (2 5) T, p 2 is corrupted by one token; after correction, M h = ( ) T
34 Polynomial Bound Estimation in Labeled Petri Nets: Part I Upper Bound on the Number of Consistent Markings
35 Polynomial Bound Problem Formulation Given: λ-free labeled Petri net Initial marking M0 (or set of initial markings) Observed label sequence ω Find C(ω), the set of all markings consistent with (i) given Petri net, (ii) initial marking, and (iii) observations Complexity concerns: What is an upper bound on C(ω)? Extensions to Petri nets with unobservable transitions
36 Polynomial Bound Example p1 t6 (c) p4 t Unknown evolution: M 1t 2t 4 0 M3 t1 (a) (a) t4 (b) t2 t5 (a) Unknown firing sequence S: t 1 t 2 t 4 Unknown firing vector: σ = ( ) T, M 3 = M 0 + Dσ p2 t3 (b) p3 Known observation sequence ω: aba C(ω): markings consistent with ω and initial marking M 0 Clearly, M 3 C(ω); other markings also possible
37 Polynomial Bound Intuitive Algorithmic Solution Algorithm 1 [Giua, DEDS 2005] 1. Let i = 0, ω 0 = λ, C(ω 0) = {M 0} 2. Wait until a new event e is observed 3. Let i = i + 1, ω i = ω i 1 e, C(ω i ) = 4. For all M C(ω i 1 ) For all t such that t T e and M[t Compute M such that M[t M Set C(ω i ) = C(ω i ) {M } 5. Goto 2 Notation: ω i : observation at ith step λ: null label T e = {t L(t) = e} M[t : t is enabled at M M[t M : M is reached after firing t at M
38 Polynomial Bound Bound on Number of Consistent Markings p1 t6 (c) p4 t Unknown evolution: M 1t 2t 4 0 M3 t1 (a) (a) t4 (b) t2 t5 (a) Unknown firing sequence S: t 1 t 2 t 4 Unknown firing vector: σ = ( ) T, M 3 = M 0 + Dσ p2 t3 (b) p3 Known observation sequence ω: aba C(ω): markings consistent with ω (e.g., M 3 C(aba)) FV (ω): firing vectors consistent with ω (e.g., ( ) T FV (aba)) C(ω) FV (ω): for M C(ω) there exists σ FV (ω) such that M = M 0 + Dσ
39 Polynomial Bound Bound on Number of Consistent Markings (2) p1 t6 (c) p4 t Unknown evolution: M 1t 2t 4 0 M3 t1 (a) (a) t4 (b) t2 t5 (a) Unknown firing sequence S: t 1 t 2 t 4 Unknown firing vector: σ = ( ) T, M 3 = M 0 + Dσ p2 t3 (b) p3 Known observation sequence ω: aba UFV (ω): unconstrained firing vectors corresponding to ω (ignore constraints imposed by Petri net and/or initial marking) For instance: σ u UFV (aba) is nonnegative solution of σ u (t 1 ) + σ u (t 4 ) + σ u (t 5 ) = 2 and σ u (t 2 ) + σ u (t 3 ) = 1 and σ u (t 6 ) = 0 Key observation: C(ω) FV (ω) UFV (ω)
40 Polynomial Bound Simple Case: One Label with Multiple Transitions Proposition 1 If T e = {t 1,..., t l } and ω = e k, then C(ω) C l 1 k+l 1. σ u UFV (ω) requires σ u (t 1 ) σ u (t l ) = k where σ u (t i ) 0 Argument: (σ u (t 1 ) + 1) (σ u (t l ) + 1) = k + l where σ u (t i ) for i = 1, 2,..., l k+l-1 separators k+l balls
41 Polynomial Bound Simple Example t1 (e) t2 (e) t3 (e) t1 t2 t3 t1 t2 t3 t1 t2 t3 t1 t2 t3 p1 p2 p3 t1t2 t3 t1t2 t3 t1t2 t3 t1t2 t3 t1t2 t3 t1t2 t3 t1t2 t3 t1t2 t3 t1t2 t3 T e = {t 1, t 2, t 3} t1 t2 t3 Observation ω: eee t1 t2 t3 t1 t2 t3 t1 t3 t2 C(ω) = C (3 1) 3+(3 1) t1t2 t3 t1 t2 t3 t1 t2 t3 t1 t2 t3 t1 t2 t3 t1 t2 t3
42 Polynomial Bound General Case: λ-free Labeled Petri Nets Proposition 2 Consider a λ-free labeled Petri net with M 0 and labeling function transition T e1 T ej t ej+1 t ed label e 1 e j e j+1 e d where T e1, T e2,..., T ej, {t ej+1 },..., {t ed } form a partition of T. Given observation sequence ω of length k where label e i appears k ei X σ u(t) = k ei for i = 1, 2,..., j t T ei σ u(t ei ) = k ei for i = j + 1, j + 2,..., d times, i.e., then where l ei = T ei C(ω) jy i=1 C le i 1 k ei +l ei 1
43 Polynomial Bound Polynomial Upper Bound Theorem 1 Given (i) known λ-free labeled Petri net (ii) known initial state M 0 (iii) observation sequence ω of length k then C(ω) ( k + l j 2 )j(l 1) ((l 1)!) j Recall that (1) j 1 is the number of nondeterministic labels (2) l = max{l e1, l e2,..., l ej } and (3) l = min{l e1, l e2,..., l ej } Bound is: (i) Polynomial in k (i.e., C(ω) = O(k j(l 1) )) (ii) Independent of actual sequence ω
44 Polynomial Bound Key Steps in the Proof Use arithmetic-mean geometric-mean inequality to relax the bound in Proposition 2. Step 1 : j i=1 C le i 1 k ei +l ei 1 = j i=1 (k ei + 1) (k ei + l ei 1) (l ei 1)! Step 2 : (k ei + 1) (k ei + l ei 1) (l ei 1)! (k e i + 1) (k ei + l 1) (l 1)! Step 3 : j j (k e1 + r) (k ej + r) (k e1 + r) (k ej + r) = q + jr for q k, 1 r l 1
45 Polynomial Bound Simulation Examples Compute C(ω) using Algorithm 1, given (i) Petri net on the left and (ii) the length-30 sequence of observations ω = caabaaacbabaaabbbbaabbabbabaaa 8 x 104 p1 100 t6 (c) 2 p4 7 6 Number of consistent markings Upper bound obtained from Theorem 1 (a) t4 5 t1 (a) (b) t2 t5 (a) p2 t3 (b) p Length of the observation
46 Polynomial Bound Bounds are Attainable Tightness of bound depends on (i) the Petri net structure, (ii) the initial marking, (iii) the labeling function, and (iv) the observation sequence Bounds are attainable under certain conditions Number of consistent markings Upper bound obtained from Proposition 2 Upper bound obtained from Theorem t1 (a) p2 t3 (b) p p1 t2 (a) p3 t4 (b) p Length of the observation
47 Polynomial Bound Extension to Petri Nets with Unobservable Transitions Unobservable subnet: Obtained from a net with unobservable transition set T λ by removing all transitions in T \T λ and all related arcs Structurally bounded (SB) Petri net: Bounded for any finite initial marking Equivalent condition: y with positive integer entries such that y T D 0 T m Deadlock structurally bounded (DSB) Petri net: y with positive integer entries such that y T D < 0 T m Examples: Acyclic Petri nets without source transitions
48 Polynomial Bound Petri Nets with SB Unobservable Subnets Summary: Upper bound on C(ω) given (i) known labeled Petri net with initial state M 0 (ii) structurally bounded (SB) unobservable subnet (iii) observation sequence ω of length k State equation M = M 0 + D oσ o + D uoσ uo 0 n Multiply on the left by y T (where n is the number of places) y T M = y T M 0 + y T D oσ o + y T D uoσ uo y T M 0 + y T D oσ o Let c 1 = y T M 0 and c 2 be the maximal entry of y T D o M(p) y T M c 1 + c 2(1... 1)σ o c 1 + c 2k for any p P Straightforward bound: C(ω) (1 + c 1 + c 2k) n
49 Polynomial Bound Petri Nets with DSB Unobservable Subnets Summary: Upper bound on C(ω) given (i) known labeled Petri net with initial state M 0 (ii) unobservable subnet that is DSB (i.e., y with positive integer entries such that y T D < 0 T m) (iii) observation sequence ω of length k Recall y T M = y T M 0 + y T D oσ o + y T D uoσ uo 0 Deadlock structurally bounded unobservable subnet c 1 + c 2k y T M 0 + y T D oσ o y T D uoσ uo 1 T l λ σ uo = P t T λ σ(t) where T λ is the set of unobservable transitions, l λ = T λ Combinatorial bound: C(ω) Q j i=1 C le i 1 k ei +l ei 1 C l λ c1 +c 2 k+l λ Relaxed polynomial bound: C(ω) ( k j + l 2 )j(l 1) ((l 1)!) j C l λ c1 +c 2 k+l λ
50 State Estimation Estimation in Labeled Petri Nets: Part II State Estimation
51 State Estimation State Estimation in λ-free Labeled Petri Nets Estimate system state based on Knowledge of Petri net structure Initial state Observation of a sequence of labels Challenges Multiple consistent states due to label uncertainty Possible exponential increase of firing sequences Unobservable transitions
52 State Estimation Intuitive Algorithm Revisited Algorithm 1 [Giua, DEDS 2005] 1. Let i = 0, ω 0 = λ, C(ω 0) = {M 0} 2. Wait until a new event e is observed 3. Let i = i + 1, ω i = ω i 1 e, C(ω i ) = 4. For all M C(ω i 1 ) For all t such that t T e and M[t Compute M such that M[t M Set C(ω i ) = C(ω i ) {M } 5. Goto 2 Notation: ω i : observation at ith step λ: null label T e = {t L(t) = e} M[t : t is enabled at M M[t M : M is reached after firing t at M
53 State Estimation Algorithmic Analysis Let C(ω i ) = N i ; if e is observed after ω k 1, we need to: (i) Consider each t T e for every M C(ω k 1 ) and obtain the next marking M if it is enabled (ii) Compare M with other computed markings in C(ω k ) and add M to C(ω k ) if it does not exist Computational complexity at step k is N k 1 T e (n + n + nn k ) = O(nlk 2j(l 1) ) Overall complexity of computing C(ω k ) starting from M 0 is O(nlk 2j(l 1)+1 )
54 Least-Cost Transition Firing Sequence Estimation Estimation in Labeled Petri Nets: Part III Least-Cost Transition Firing Sequence Estimation
55 Least-Cost Transition Firing Sequence Estimation Labeled Petri nets with Transition Costs Introduce cost function C : T N 0 Assigns to each transition a nonnegative integer cost Cost can be Amount of workload needed to accomplish a task Power required to start a machine Example: a labeled Petri net with transition costs C(t 1 ) = 1, C(t 2 ) = 2, C(t 3 ) = 5 and C(t 4 ) = 3
56 Least-Cost Transition Firing Sequence Estimation Problem Formulation Given: A labeled Petri net with (i) initial marking M 0 (ii) no unobservable transitions (λ-free) (iii) nonnegative costs associated with each transition Goal: Find transition firing sequence(s) that a) is (are) consistent with the net structure b) is (are) consistent with the observed label sequence c) has (have) the least overall cost (cost of a sequence is the sum of the costs of individual transitions in the sequence) Challenge: The observed sequence of labels may correspond to a large number of transition sequences (possibly exponentially large)
57 Least-Cost Transition Firing Sequence Estimation Approach Fact: After observing a label sequence ω (of length-k), C(ω) is upper bounded by a polynomial function in k Our approach: Trellis diagram formulation on evolution of consistent markings Observed label sequence Consistent markings M ji C(l 1l 2... l j ) for j {1, 2,..., k} Arcs: transition firings that lead from one marking to another and match the label observed at corresponding stage
58 Least-Cost Transition Firing Sequence Estimation Algorithm Recursive online algorithm: When label l j is observed (1) Look at the set of transitions corresponding to l j (2) Compute consistent markings and corresponding least-cost transition firing sequence from (consistent) markings at previous time epoch j 1 When the same consistent marking is reached after firing transitions from different (consistent) markings at previous time epoch j 1, choose the transition sequence(s) with the least total cost (3) Store all consistent markings and corresponding least-cost firing sequence(s) (4) Wait until next label is observed
59 Least-Cost Transition Firing Sequence Estimation Algorithmic Complexity Analysis Space complexity Proportional to number of consistent markings l = max{ T lj }: maximum number of transitions corresponding to a label For each consistent marking at stage k At most l different transitions leading to it from stage k 1 Storage space proportional to l Total space needed: P k j=1 O(l j b ) = O(k b+1 ) = polynomial in k Computational complexity Number of consistent markings at (k 1) st stage: n k 1 = O((k 1) b ) Number of consistent markings at k th stage: n k = O(k b ) Total computation at k th stage: n k 1 l n k Total computation needed: P k j=1 O(l j 2b ) = O(k 2b+1 ) = polynomial in k
60 Least-Cost Transition Firing Sequence Estimation Illustrative Example: Two Parallel Working Machines 10 places: P = {p 1, p 2,..., p 10 }, 12 transitions: T = {t 1, t 2,..., t 12 } Initial marking: M 0 = [ ] T Labeling function: Transition t 3, t 5 t 4, t 6 t 7, t 9 t 8, t 10 t 1 t 2 t 11 t 12 Label a b c d e f g h Cost vector for transitions: C = [ ] T Note: No unobservable transitions (λ-free)
61 Least-Cost Transition Firing Sequence Estimation Complete Results Label Num of consistent markings Least cost {S min } e 1 5 t 1 e 1 10 t 1t 1 f 1 15 t 1t 1t 2 f 1 20 t 1t 1t 2t 2 a 2 30 t 1t 1t 2t 2t 3 a 3 40 t 1t 1t 2t 2t 3t 3 b 4 50 t 1t 1t 2t 2t 3t 3t 6 c 4 70 t 1t 1t 2t 2t 3t 5t 6t 9 t 1t 1t 2t 2t 5t 3t 6t 9 t 1t 1t 2t 2t 3t 5t 6t 7t 9 t 1t 1t 2t 2t 3t 5t 6t 9t 7 c t 1t 1t 2t 2t 5t 3t 6t 7t 9 t 1t 1t 2t 2t 5t 3t 6t 9t 7 t 1t 1t 2t 2t 5t 5t 4t 9t 9 d t 1t 1t 2t 2t 5t 5t 4t 9t 9t 8
62 Least-Cost Transition Firing Sequence Estimation Some Observations Case 1: Observed label sequence: ω 1 = eeffaab Least-cost firing sequence: S min = t 1t 1t 2t 2t 3t 3t 6 with total cost 50 Case 2: Observed label sequence: ω 2 = eeffaabccd Least-cost firing sequence: S min = t 1t 1t 2t 2t 5t 5t 4t 9t 9t 8 with total cost 110 Observation The two label sequences share the first seven labels The two least-cost sequences differ in the first 7 transitions Need to capture all consistent markings with least-cost sequence information at the previous stage
63 Summary Summary Polynomial bound on the number of consistent markings Bounds are attainable Bounds imply that state estimation problem and least-cost transition firing sequence estimation problem can be solved with complexity that is polynomial in k Bounds are useful in applications where system states reset or periodically become known Redundant Petri net embeddings Fault diagnosis/tolerance via bisimilar Petri net embeddings Fault-tolerant supervisor for arbitrary forbidden state specs
64 Future Work Future Work General framework Labeled Petri nets with inputs and outputs Key problems Sensor selection and actuator configuration Ability to systematically handle sensor/actuator faults Reconfiguration strategies Deadlock prevention and liveness enforcement Integration of estimation, diagnosis and control
65 References Related Work A. Giua and C. Seatzu, Observability of place/transition nets, IEEE Trans. Automat. Contr., vol. 47, pp , Sept S. Genc and S. Lafortune, Distributed diagnosis of discrete-event systems using Petri nets, in 24th Int. Conf. on Applications and Theory of Petri Nets, Lecture Notes in Computer Science Vol. 2679, Eindhoven, The Netherlands, June 2003, pp A. Ramírez-Treviño, I. Rivera-Rangel, and E. López-Mellado, Observability of discrete event systems modeled by interpreted Petri nets, IEEE Trans. Robot. Automat., vol. 19, pp , Aug A. Giua, D. Corona, and C. Seatzu, State estimation of λ-free labeled Petri nets with contact-free nondeterministic transitions, Discrete Event Dynamic Systems: Theory and Applications, vol. 15, pp , Mar
66 References Our Work (1) Y. Ru and C. N. Hadjicostis, State estimation in discrete event systems modeled by labeled Petri nets, in Proc. of 45th IEEE Conf. on Decision and Control, San Diego, USA, Dec. 2006, pp L. Li, Y. Ru, and C. N. Hadjicostis, Least-cost firing sequence estimation in labeled Petri nets, in Proc. of 45th IEEE Conf. on Decision and Control, San Diego, USA, Dec. 2006, pp Y. Ru and C. N. Hadjicostis, Bounds on the number of markings consistent with label observations in Petri nets, in preparation for journal submission, C. Hadjicostis and G. Verghese, Monitoring discrete event systems using Petri net embeddings, in Application and Theory of Petri Nets 1999 (Series Lecture Notes in Computer Science, vol. 1639), 1999, pp
67 References Our Work (2) L. Li and C. Hadjicostis, Fault detection and identification in Petri net controllers, in 43rd IEEE Conf. on Decision and Control, Atlantis, Bahamas, Dec. 2004, pp Y. Wu and C. Hadjicostis, Algebraic approaches for fault identification in discrete-event systems, IEEE Trans. Automat. Contr., vol. 50, pp , Dec Y. Ru and C. N. Hadjicostis, Fault-tolerant supervisory control of discrete event systems modeled by bounded Petri nets, to appear in Proc. of 2007 American Control Conference, New York, USA, L. Li, C. N. Hadjicostis, and R. S. Sreenivas, Designs of bisimilar Petri net controllers with fault tolerance capabilities, to appear in IEEE Transactions on Systems, Man and Cybernetics (Part A), 2007.
CONTROL AND DEADLOCK RECOVERY OF TIMED PETRI NETS USING OBSERVERS
5 e Conférence Francophone de MOdélisation et SIMulation Modélisation et simulation pour l analyse et l optimisation des systèmes industriels et logistiques MOSIM 04 du 1 er au 3 septembre 2004 - Nantes
More informationMarking Estimation in Labelled Petri nets by the Representative Marking Graph
DOI: 10.1109/XXXXXXXXXXXXXXXX. Marking Estimation in Labelled Petri nets by the Representative Marking Graph Ziyue Ma, Yin Tong, Zhiwu Li, and Alessandro Giua July 2017 Abstract In this paper a method
More informationNONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING. Alessandro Giua Xiaolan Xie
NONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING Alessandro Giua Xiaolan Xie Dip. Ing. Elettrica ed Elettronica, U. di Cagliari, Italy. Email: giua@diee.unica.it INRIA/MACSI Team, ISGMP, U. de Metz, France.
More informationSupervisory Control of Petri Nets with. Uncontrollable/Unobservable Transitions. John O. Moody and Panos J. Antsaklis
Supervisory Control of Petri Nets with Uncontrollable/Unobservable Transitions John O. Moody and Panos J. Antsaklis Department of Electrical Engineering University of Notre Dame, Notre Dame, IN 46556 USA
More information748 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 4, APRIL 2009
748 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 54, NO 4, APRIL 2009 An Efficient Approach for Online Diagnosis of Discrete Event Systems Francesco Basile, Member, IEEE, Pasquale Chiacchio, Gianmaria De
More informationModelling of Railway Network Using Petri Nets
Modelling of Railway Network Using Petri Nets MANDIRA BANIK 1, RANJAN DASGUPTA 2 1 Dept. of Computer Sc. & Engg., National Institute of Technical Teachers' Training & Research, Kolkata, West Bengal, India
More informationof Kentucky, Lexington, KY USA,
Controlled Petri Nets: A Tutorial Survey L. E. Holloway 1 and B. H. Krogh 2 1 Center for Manufacturing Systems and Dept. of Electrical Engineering, University of Kentucky, Lexington, KY 40506-0108 USA,
More informationTHE simulation of a continuous or discrete time system
770 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 28, NO. 6, DECEMBER 1998 Discrete Event Representation of Qualitative Models Using Petri Nets Alessandra Fanni, Member,
More informationA deadlock prevention method for railway networks using monitors for colored Petri nets
A deadlock prevention method for railway networks using monitors for colored Petri nets Maria Pia Fanti Dip di Elettrotecnica ed Elettronica Politecnico di Bari, Italy fanti@deemailpolibait Abstract The
More informationc 2014 Vijayalakshmi Deverakonda
c 214 Vijayalakshmi Deverakonda DISJUNCTIVE NORMAL FORMULA BASED SUPERVISORY CONTROL POLICY FOR GENERAL PETRI NETS BY VIJAYALAKSHMI DEVERAKONDA THESIS Submitted in partial fulfillment of the requirements
More informationLiveness enforcing supervisors for railway networks using ES 2 PR Petri nets
Liveness enforcing supervisors for railway networks using ES 2 PR Petri nets Alessandro Giua, Carla Seatzu Department of Electrical and Electronic Engineering, University of Cagliari, Piazza d Armi 923
More informationHYPENS Manual. Fausto Sessego, Alessandro Giua, Carla Seatzu. February 7, 2008
HYPENS Manual Fausto Sessego, Alessandro Giua, Carla Seatzu February 7, 28 HYPENS is an open source tool to simulate timed discrete, continuous and hybrid Petri nets. It has been developed in Matlab to
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationBasis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem Ziyue Ma, Yin Tong, Zhiwu Li, and Alessandro Giua June, 017 Abstract In this paper a compact
More informationResource-Oriented Petri Nets in Deadlock Avoidance of AGV Systems
Proceedings of the 2001 IEEE International Conference on Robotics & Automation Seoul, Korea May 21-26, 2001 Resource-Oriented Petri Nets in Deadlock Avoidance of AGV Systems Naiqi Wu Department of Mechatronics
More informationSupervisory control under partial observation is an important problem
2576 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 62, NO. 5, MAY 2017 Technical Notes and Correspondence Supervisor Synthesis for Mealy Automata With Output Functions: A Model Transformation Approach Xiang
More informationDesigning Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets through the Theory of Regions
Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets through the Theory of Regions Spyros A. Reveliotis 1 and Jin Young Choi 2 1 School of Industrial & Systems
More informationOPTIMAL TOKEN ALLOCATION IN TIMED CYCLIC EVENT GRAPHS
OPTIMAL TOKEN ALLOCATION IN TIMED CYCLIC EVENT GRAPHS Alessandro Giua, Aldo Piccaluga, Carla Seatzu Department of Electrical and Electronic Engineering, University of Cagliari, Italy giua@diee.unica.it
More informationBridging the Gap between Reactive Synthesis and Supervisory Control
Bridging the Gap between Reactive Synthesis and Supervisory Control Stavros Tripakis University of California, Berkeley Joint work with Ruediger Ehlers (Berkeley, Cornell), Stéphane Lafortune (Michigan)
More informationTime and Timed Petri Nets
Time and Timed Petri Nets Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr DISC 11, June 9th 2011 1 Time and Petri Nets 2 Timed Models 3 Expressiveness 4 Analysis 1/36 Outline 1 Time
More informationDISCRETE EVENT DIAGNOSIS USING PETRI NETS
Maria Paola Cabasino, Alessandro Giua and Carla Seatzu Department of Electrical and Electronic Engineering, University of Cagliari, Piazza D Armi, 09123 Cagliari, Italy {cabasino, giua, seatzu}@diee.unica.it
More informationCoding Approaches to Reliable DES Design Christoforos Hadjicostis
Coding Approaches to Reliable DES Design Christoforos Hadjicostis Decision and Control Laboratory Coordinated Science Laboratory and Dept. of Electrical and Computer Engineering University of Illinois
More informationPerformance Control of Markovian Petri Nets via Fluid Models: A Stock-Level Control Example
Performance Control of Markovian Petri Nets via Fluid Models: A Stock-Level Control Example C. Renato Vázquez Manuel Silva Abstract Petri nets is a well-know formalism for studying discrete event systems.
More informationDesigning Stable Inverters and State Observers for Switched Linear Systems with Unknown Inputs
Designing Stable Inverters and State Observers for Switched Linear Systems with Unknown Inputs Shreyas Sundaram and Christoforos N. Hadjicostis Abstract We present a method for estimating the inputs and
More informationAchieving Fault-tolerance and Safety of Discrete-event Systems through Learning
2016 American Control Conference (ACC) Boston Marriott Copley Place July 6-8, 2016. Boston, MA, USA Achieving Fault-tolerance and Safety of Discrete-event Systems through Learning Jin Dai, Ali Karimoddini,
More informationc 2011 Nisha Somnath
c 2011 Nisha Somnath HIERARCHICAL SUPERVISORY CONTROL OF COMPLEX PETRI NETS BY NISHA SOMNATH THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Aerospace
More informationDecentralized Diagnosis of Discrete Event Systems using Unconditional and Conditional Decisions
Decentralized Diagnosis of Discrete Event Systems using Unconditional and Conditional Decisions Yin Wang, Tae-Sic Yoo, and Stéphane Lafortune Abstract The past decade has witnessed the development of a
More informationA Polynomial Algorithm for Testing Diagnosability of Discrete Event Systems
A Polynomial Algorithm for Testing Diagnosability of Discrete Event Systems Shengbing Jiang, Zhongdong Huang, Vigyan Chandra, and Ratnesh Kumar Department of Electrical Engineering University of Kentucky
More informationAnalysis and Optimization of Discrete Event Systems using Petri Nets
Volume 113 No. 11 2017, 1 10 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Analysis and Optimization of Discrete Event Systems using Petri Nets
More informationSupervisory Control: Advanced Theory and Applications
Supervisory Control: Advanced Theory and Applications Dr Rong Su S1-B1b-59, School of EEE Nanyang Technological University Tel: +65 6790-6042, Email: rsu@ntu.edu.sg EE6226, Discrete Event Systems 1 Introduction
More informationPetri Net Modeling of Irrigation Canal Networks
Petri Net Modeling of Irrigation Canal Networks Giorgio Corriga, Alessandro Giua, Giampaolo Usai DIEE: Dip. di Ingegneria Elettrica ed Elettronica Università di Cagliari P.zza d Armi 09123 CAGLIARI, Italy
More informationIntegrated Fault Diagnosis Based on Petri Net Models
16th IEEE International Conference on Control Applications Part of IEEE Multi-conference on Systems and Control Singapore, 1-3 October 2007 TuC05.3 Integrated Fault Diagnosis Based on Petri Net Models
More informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationFinite-State Machine Embeddings for Nonconcurrent Error Detection and Identification
JOURNAL OF L A TEX CLASS FILES, VOL. 1, NO. 11, NOVEMBER 2002 1 Finite-State Machine Embeddings for Nonconcurrent Error Detection and Identification Christoforos N. Hadjicostis, Member, IEEE, Abstract
More informationPartially observed discrete-event systems: from state estimation to intrusion detection
Partially observed discrete-event systems: from state estimation to intrusion detection Carla Seatzu Department of Electrical and Electronic Engineering, University of Cagliari, Italy Sorrento, June 1
More informationDECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES. Wenbin Qiu and Ratnesh Kumar
DECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES Wenbin Qiu and Ratnesh Kumar Department of Electrical and Computer Engineering Iowa State University Ames, IA 50011, U.S.A.
More informationStructural Analysis of Resource Allocation Systems with Synchronization Constraints
Structural Analysis of Resource Allocation Systems with Synchronization Constraints Spyros Reveliotis School of Industrial & Systems Engineering Georgia Institute of Technology Atlanta, GA 30332 USA Abstract
More informationA reachability graph partitioning technique for the analysis of deadlock prevention methods in bounded Petri nets
2010 American Control Conference Marriott Waterfront, Baltimore, M, USA June 30-July 02, 2010 ThB07.3 A reachability graph partitioning technique for the analysis of deadlock prevention methods in bounded
More informationA Deadlock Prevention Policy for Flexible Manufacturing Systems Using Siphons
Proceedings of the 2001 IEEE International Conference on Robotics & Automation Seoul, Korea May 21-26, 2001 A Deadlock Prevention Policy for Flexible Manufacturing Systems Using Siphons YiSheng Huang 1
More informationA DISTRIBUTED ALGORITHM FOR ON-LINE DIAGNOSIS OF PLACE-BORDERED PETRI NETS 1. Şahika Genç, Stéphane Lafortune
A DISTRIBUTED ALGORITHM FOR ON-LINE DIAGNOSIS OF PLACE-BORDERED PETRI NETS 1 Şahika Genç, Stéphane Lafortune Department of Electrical Engineering and Computer Science, University of Michigan, 1301 Beal
More informationDiagnosis of Dense-Time Systems using Digital-Clocks
Diagnosis of Dense-Time Systems using Digital-Clocks Shengbing Jiang GM R&D and Planning Mail Code 480-106-390 Warren, MI 48090-9055 Email: shengbing.jiang@gm.com Ratnesh Kumar Dept. of Elec. & Comp. Eng.
More informationBerlekamp-Massey decoding of RS code
IERG60 Coding for Distributed Storage Systems Lecture - 05//06 Berlekamp-Massey decoding of RS code Lecturer: Kenneth Shum Scribe: Bowen Zhang Berlekamp-Massey algorithm We recall some notations from lecture
More informationSemi-asynchronous. Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER
Semi-asynchronous Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER 2017 NC A&T State University http://www.ncat.edu/ Alejandro White Semi-asynchronous http://techlav.ncat.edu/
More informationarxiv: v1 [math.oc] 21 Feb 2018
Noname manuscript No. (will be inserted by the editor) On detectability of labeled Petri nets with inhibitor arcs Kuize Zhang Alessandro Giua arxiv:1802.07551v1 [math.oc] 21 Feb 2018 Received: date / Accepted:
More informationDecentralized Modular Control of Concurrent Fuzzy Discrete Event Systems
2010 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 30-July 02, 2010 ThB07.2 Decentralized Modular Control of Concurrent Fuzzy Discrete Event Systems Awantha Jayasiri, George
More informationElementary Siphons of Petri Nets and Deadlock Control in FMS
Journal of Computer and Communications, 2015, 3, 1-12 Published Online July 2015 in SciRes. http://www.scirp.org/journal/jcc http://dx.doi.org/10.4236/jcc.2015.37001 Elementary Siphons of Petri Nets and
More informationSemi-asynchronous Fault Diagnosis of Discrete Event Systems
1 Semi-asynchronous Fault Diagnosis of Discrete Event Systems Alejandro White, Student Member, IEEE, Ali Karimoddini, Senior Member, IEEE Abstract This paper proposes a diagnostics tool for a Discrete-
More informationLecture 3: Error Correcting Codes
CS 880: Pseudorandomness and Derandomization 1/30/2013 Lecture 3: Error Correcting Codes Instructors: Holger Dell and Dieter van Melkebeek Scribe: Xi Wu In this lecture we review some background on error
More informationA Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems
A Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems Jin Dai, Ali Karimoddini and Hai Lin Abstract A fault-tolerant controller is a controller that drives the plant to satisfy
More informationONE NOVEL COMPUTATIONALLY IMPROVED OPTIMAL CONTROL POLICY FOR DEADLOCK PROBLEMS OF FLEXIBLE MANUFACTURING SYSTEMS USING PETRI NETS
Proceedings of the IASTED International Conference Modelling, Identification and Control (AsiaMIC 2013) April 10-12, 2013 Phuket, Thailand ONE NOVEL COMPUTATIONALLY IMPROVED OPTIMAL CONTROL POLICY FOR
More informationFOURIER-MOTZKIN METHODS FOR FAULT DIAGNOSIS IN DISCRETE EVENT SYSTEMS
FOURIER-MOTZKIN METHODS FOR FAULT DIAGNOSIS IN DISCRETE EVENT SYSTEMS by AHMED KHELFA OBEID AL-AJELI A thesis submitted to The University of Birmingham for the degree of DOCTOR OF PHILOSOPHY School of
More informationIN THIS paper we investigate the diagnosability of stochastic
476 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 50, NO 4, APRIL 2005 Diagnosability of Stochastic Discrete-Event Systems David Thorsley and Demosthenis Teneketzis, Fellow, IEEE Abstract We investigate
More informationModeling and Stability Analysis of a Communication Network System
Modeling and Stability Analysis of a Communication Network System Zvi Retchkiman Königsberg Instituto Politecnico Nacional e-mail: mzvi@cic.ipn.mx Abstract In this work, the modeling and stability problem
More information1 The linear algebra of linear programs (March 15 and 22, 2015)
1 The linear algebra of linear programs (March 15 and 22, 2015) Many optimization problems can be formulated as linear programs. The main features of a linear program are the following: Variables are real
More informationColoured Petri Nets Based Diagnosis on Causal Models
Coloured Petri Nets Based Diagnosis on Causal Models Soumia Mancer and Hammadi Bennoui Computer science department, LINFI Lab. University of Biskra, Algeria mancer.soumia@gmail.com, bennoui@gmail.com Abstract.
More informationLinear programming techniques for analysis and control of batches Petri nets
Linear programming techniques for analysis and control of batches Petri nets Isabel Demongodin, LSIS, Univ. of Aix-Marseille, France (isabel.demongodin@lsis.org) Alessandro Giua DIEE, Univ. of Cagliari,
More informationc 2005 by Shreyas Sundaram. All rights reserved.
c 25 by Shreyas Sundaram All rights reserved OBSERVERS FOR LINEAR SYSTEMS WITH UNKNOWN INPUTS BY SHREYAS SUNDARAM BASc, University of Waterloo, 23 THESIS Submitted in partial fulfillment of the requirements
More informationDecentralized Control of Discrete Event Systems with Multiple Local Specializations 1
Decentralized Control of Discrete Event Systems with Multiple Local Specializations Shengbing Jiang, Vigyan Chandra, Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington,
More informationSynthesis of Controllers of Processes Modeled as Colored Petri Nets
Discrete Event Dynamic Systems: Theory and Applications, 9, 147 169 (1999) c 1999 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Synthesis of Controllers of Processes Modeled as Colored
More informationPetri nets. s 1 s 2. s 3 s 4. directed arcs.
Petri nets Petri nets Petri nets are a basic model of parallel and distributed systems (named after Carl Adam Petri). The basic idea is to describe state changes in a system with transitions. @ @R s 1
More informationA REACHABLE THROUGHPUT UPPER BOUND FOR LIVE AND SAFE FREE CHOICE NETS VIA T-INVARIANTS
A REACHABLE THROUGHPUT UPPER BOUND FOR LIVE AND SAFE FREE CHOICE NETS VIA T-INVARIANTS Francesco Basile, Ciro Carbone, Pasquale Chiacchio Dipartimento di Ingegneria Elettrica e dell Informazione, Università
More informationThe Multi-Agent Rendezvous Problem - The Asynchronous Case
43rd IEEE Conference on Decision and Control December 14-17, 2004 Atlantis, Paradise Island, Bahamas WeB03.3 The Multi-Agent Rendezvous Problem - The Asynchronous Case J. Lin and A.S. Morse Yale University
More informationResolution of Initial-State in Security Applications of DES
Resolution of Initial-State in Security Applications of DES Christoforos N. Hadjicostis Abstract A non-deterministic labeled finite automaton is initial-state opaque if the membership of its true initial
More informationSymbolic Decentralized Supervisory Control
Symbolic Decentralized Supervisory Control SYMBOLIC DECENTRALIZED SUPERVISORY CONTROL BY URVASHI AGARWAL, B.Eng. a thesis submitted to the department of computing & software and the school of graduate
More informationIntersection Based Decentralized Diagnosis: Implementation and Verification
Intersection Based Decentralized Diagnosis: Implementation and Verification Maria Panteli and Christoforos N. Hadjicostis Abstract We consider decentralized diagnosis in discrete event systems that are
More informationOn the Block Error Probability of LP Decoding of LDPC Codes
On the Block Error Probability of LP Decoding of LDPC Codes Ralf Koetter CSL and Dept. of ECE University of Illinois at Urbana-Champaign Urbana, IL 680, USA koetter@uiuc.edu Pascal O. Vontobel Dept. of
More informationUsing Shared-Resource Capacity for Robust Control of Failure-Prone Manufacturing Systems
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL. 38, NO. 3, MAY 2008 605 Using Shared-Resource Capacity for Robust Control of Failure-Prone Manufacturing Systems Shengyong
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationLanguage Stability and Stabilizability of Discrete Event Dynamical Systems 1
Language Stability and Stabilizability of Discrete Event Dynamical Systems 1 Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Vijay Garg Department of
More informationLinear Programming Bounds for Robust Locally Repairable Storage Codes
Linear Programming Bounds for Robust Locally Repairable Storage Codes M. Ali Tebbi, Terence H. Chan, Chi Wan Sung Institute for Telecommunications Research, University of South Australia Email: {ali.tebbi,
More informationPetri nets design based on neural networks
Petri nets design based on neural networks Edouard LECLERCQ, Souleiman OULD EL MEDHI, Dimitri LEFEBVRE GREAH - Université du Havre - 5, rue Philippe LEBON - BP 54-7658 LE HAVRE Cedex Abstract. Petri net
More informationSub-Optimal Scheduling of a Flexible Batch Manufacturing System using an Integer Programming Solution
Sub-Optimal Scheduling of a Flexible Batch Manufacturing System using an Integer Programming Solution W. Weyerman, D. West, S. Warnick Information Dynamics and Intelligent Systems Group Department of Computer
More informationFORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES 1 R. D. Brandt 2,V.Garg 3,R.Kumar 3,F.Lin 2,S.I.Marcus 3, and W. M.
FORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES 1 R. D. Brandt 2,V.Garg 3,R.Kumar 3,F.Lin 2,S.I.Marcus 3, and W. M. Wonham 4 2 Department of ECE, Wayne State University, Detroit,
More informationControl Hierarchies and Tropical Algebras
Control Hierarchies and Tropical Algebras Jörg Raisch 1,2, Xavier David-Henriet 1,2,3, Tom Brunsch 1,3, Laurent Hardouin 3 1 Fachgebiet Regelungssysteme Fakultät Elektrotechnik und Informatik, TU Berlin
More informationMonomial subdigraphs of reachable and controllable positive discrete-time systems
Monomial subdigraphs of reachable and controllable positive discrete-time systems Rafael Bru a, Louis Caccetta b and Ventsi G. Rumchev b a Dept. de Matemàtica Aplicada, Univ. Politècnica de València, Camí
More informationOn the Design of Adaptive Supervisors for Discrete Event Systems
On the Design of Adaptive Supervisors for Discrete Event Systems Vigyan CHANDRA Department of Technology, Eastern Kentucky University Richmond, KY 40475, USA and Siddhartha BHATTACHARYYA Division of Computer
More informationLecture 6: Expander Codes
CS369E: Expanders May 2 & 9, 2005 Lecturer: Prahladh Harsha Lecture 6: Expander Codes Scribe: Hovav Shacham In today s lecture, we will discuss the application of expander graphs to error-correcting codes.
More informationLecture 22: Counting
CS 710: Complexity Theory 4/8/2010 Lecture 22: Counting Instructor: Dieter van Melkebeek Scribe: Phil Rydzewski & Chi Man Liu Last time we introduced extractors and discussed two methods to construct them.
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More informationComputability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
More informationOn Qualitative Analysis of Fault Trees Using Structurally Persistent Nets
On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets Ricardo J. Rodríguez rj.rodriguez@unileon.es Research Institute of Applied Sciences in Cybersecurity University of León, Spain
More informationPetri Nets (for Planners)
Petri (for Planners) B. Bonet, P. Haslum... from various places... ICAPS 2011 & Motivation Petri (PNs) is formalism for modelling discrete event systems Developed by (and named after) C.A. Petri in 1960s
More informationOn the Decidability and Complexity of Diagnosability for Labeled Petri Nets
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 62, NO. 11, NOVEMBER 2017 5931 On the Decidability and Complexity of Diagnosability for Labeled Petri Nets Xiang Yin, Member, IEEE, and Stéphane Lafortune,
More informationFAULT-TOLERANT CONTROL OF CHEMICAL PROCESS SYSTEMS USING COMMUNICATION NETWORKS. Nael H. El-Farra, Adiwinata Gani & Panagiotis D.
FAULT-TOLERANT CONTROL OF CHEMICAL PROCESS SYSTEMS USING COMMUNICATION NETWORKS Nael H. El-Farra, Adiwinata Gani & Panagiotis D. Christofides Department of Chemical Engineering University of California,
More informationPhD Course on Discrete event and hybrid systems
PhD Course on Discrete event and hybrid systems Discrete event systems Discrete event systems (DES) theory is the theoretical foundation to the study of dynamical man-made systems, whose evolution is related
More informationMATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet
More informationPetri Net Diagnoser for DES Modeled by Finite State Automata
51st IEEE Conference on Decision and Control December 10-13, 2012. Maui, Hawaii, USA Petri Net Diagnoser for DES Modeled by Finite State Automata Marcos V. Moreira and Felipe G. Cabral and Oumar Diene
More informationOptimal State Estimators for Linear Systems with Unknown Inputs
Optimal tate Estimators for Linear ystems with Unknown Inputs hreyas undaram and Christoforos N Hadjicostis Abstract We present a method for constructing linear minimum-variance unbiased state estimators
More informationMulti-Robotic Systems
CHAPTER 9 Multi-Robotic Systems The topic of multi-robotic systems is quite popular now. It is believed that such systems can have the following benefits: Improved performance ( winning by numbers ) Distributed
More informationEvaluation of deadlock control designs in automated manufacturing systems
Proceedings of the 2015 International Conference on Industrial Engineering and Operations Management Dubai, UAE, March 3 5, 2015 Evaluation of deadlock control designs in automated manufacturing systems
More informationLyapunov Stability of Linear Predictor Feedback for Distributed Input Delays
IEEE TRANSACTIONS ON AUTOMATIC CONTROL VOL. 56 NO. 3 MARCH 2011 655 Lyapunov Stability of Linear Predictor Feedback for Distributed Input Delays Nikolaos Bekiaris-Liberis Miroslav Krstic In this case system
More informationE. Salimi 1, N. Somnath 1 and R.S. Sreenivas 1
A Tutorial on the Synthesis of the Maximally Permissive Liveness Enforcing Supervisory Policy in Discrete-Event/Discrete-State Systems modeled by a Class of General Petri Nets E. Salimi 1, N. Somnath 1
More informationOn Controllability of Timed Continuous Petri Nets
On Controllability of Timed Continuous Petri Nets C Renato Vázquez 1, Antonio Ramírez 2, Laura Recalde 1, and Manuel Silva 1 1 Dep de Informática e Ingeniería de Sistemas, Centro Politécnico Superior,
More informationTHROUGHPUT ANALYSIS OF MANUFACTURING CELLS USING TIMED PETRI NETS
c 1994 IEEE. Published in the Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, San Antonio, TX, October 2 5, 1994. Personal use of this material is permitted. However,
More informationLinear Codes, Target Function Classes, and Network Computing Capacity
Linear Codes, Target Function Classes, and Network Computing Capacity Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth Zeger IEEE Transactions on Information Theory Submitted:
More informationSynthesis of Maximally Permissive Non-blocking Supervisors for Partially Observed Discrete Event Systems
53rd IEEE Conference on Decision and Control December 5-7, 24. Los Angeles, California, USA Synthesis of Maximally Permissive Non-blocking Supervisors for Partially Observed Discrete Event Systems Xiang
More informationEquivalence of dynamical systems by bisimulation
Equivalence of dynamical systems by bisimulation Arjan van der Schaft Department of Applied Mathematics, University of Twente P.O. Box 217, 75 AE Enschede, The Netherlands Phone +31-53-4893449, Fax +31-53-48938
More informationIN AN industrial automated manufacturing system (AMS),
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS: SYSTEMS, VOL. 45, NO. 11, NOVEMBER 2015 1459 Lexicographic Multiobjective Integer Programming for Optimal and Structurally Minimal Petri Net Supervisors
More informationDiscrete abstractions of hybrid systems for verification
Discrete abstractions of hybrid systems for verification George J. Pappas Departments of ESE and CIS University of Pennsylvania pappasg@ee.upenn.edu http://www.seas.upenn.edu/~pappasg DISC Summer School
More informationMOST OF the published research on control of discreteevent
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 1, JANUARY 1998 3 Discrete-Event Control of Nondeterministic Systems Michael Heymann and Feng Lin, Member, IEEE Abstract Nondeterminism in discrete-event
More information