Diagnosis of Dense-Time Systems using Digital-Clocks
|
|
- Stanley Fowler
- 6 years ago
- Views:
Transcription
1 Diagnosis of Dense-Time Systems using Digital-Clocks Shengbing Jiang GM R&D and Planning Mail Code Warren, MI Ratnesh Kumar Dept. of Elec. & Comp. Eng. Iowa State University Ames, IA Abstract We study failure diagnosis of timed discreteevent systems modeled as dense timed-automata for which reachability is decidable [1], [6]. Failure diagnosis of such systems was first studied in [21], assuming that a diagnoser has partial observation of events but can measure (or observe ) time perfectly. In this paper we relax the latter requirement since in practice time cannot be measured precisely. Thus in our setting we have partial observability of events as well as of time. We model the observability of time based on a digitalclock of finite precision and of finite drift, i.e., the clock that a diagnoser uses to measure time ticks every [ ± δ] units of time. We show that the discrete-time behavior observed using such a clock is regular, i.e., can be represented using a finite (untimed) automaton. In our analysis we allow the non-failure behavior to be also represented as a separate dense timedautomaton that is deterministic (also decidable), which can be viewed as another extension. We show that the verification of diagnosability (ability to detect specification violation within a bounded delay) as well as the off-line synthesis of a diagnoser for a diagnosable system is decidable by reducing the problem to the untimed domain. The reduction to the untimed domain also suggests an effective method for an on-line diagnosis. Keywords: Discrete event systems, diagnosis, timed automaton, diagnosability, dense-time, digital-clock I. INTRODUCTION A failure in a system is consider to be its abnormal behavior, i.e., one that violates the specification of a normal behavior. The task of diagnosis of a system requires detecting the occurrence of a failure by observing the system behavior, whereas the diagnosability property requires that the occurrence of a failure be detected within a bounded delay. For untimed discrete-event systems diagnosability has been examined in [17], [25], [8], [24], and a stronger notion of state-observability was examined in [12]. Extensions to decentralized setting can be found in [5], [13], [22] and to distributed setting in [5], [18], [16], [2], [19], [14], [15]. Extensions to diagnosis of repeatable/intermittent-failures can be found in [11], [23], [9], [3], [27], to the temporal logic setting in [10], [9], and to the probabilistic setting in [20]. Above cited work explore diagnosis of untimed discrete event systems. There has also been some research on diagnosis of timed discrete event systems, which includes diagnosis in discrete-time setting [26] and in dense-time setting [7], [4], [21]. It is known that the class of discrete-time systems is a subclass of dense-time ones, and the property of diagnosability of such dense-time systems, modeled as timed automata [1], [6], was first examined in [21] under the assumption that a diagnoser has partial observation of events but it can measure time perfectly. It was shown that the verification of diagnosability in this setting is decidable and on-line diagnosis can be effectively performed. However, no comments were made about the off-line synthesis of a diagnoser. In this paper we generalize the work reported in [21] in two different ways. First, we relax the requirement that a diagnoser be able to measure time precisely since that is not possible in practice. Thus in our setting we have partial observability of events as well as of time. We model the observability of time based on a digital-clock of finite precision and of finite drift, i.e., the clock that the diagnoser uses to measure time ticks every [ ± δ] units of time. ( > δ 0, and both and δ are rationals.) Second, we allow the representation of the non-failure specification also to be a dense timed-automaton. Since the computation of the failure-specification from a non-failure specification requires complementation, we assume the non-failure specification to be accepted by a deterministic dense timed-automaton. We show the decidability of the diagnosis problem in this general setting. This decidability result we obtain is based on two main results reported in this paper: (i) We show that the discretetime behavior observed using a digital-clock of the type mentioned above is regular, i.e., can be represented using a finite (untimed) automaton. (ii) Diagnosability of a pair of dense-timed system and a deterministic dense-time specification is reducible to the diagnosability of a single untimed system in which failures are represented through faulty events. With these two observations we are able to reduce the problem of diagnosis in the dense-time setting to that of diagnosis in the untimed setting. It then follows from the results in the untimed setting that even in the dense-time setting the verification of diagnosability as well as the offline synthesis of a diagnoser is decidable, and the on-line diagnosis can be effectively performed. The rest of the paper is organized as follows. Section 2 gives the notations and preliminaries. Section 3 shows that that the discrete-time behavior of a dense timed-automaton as observed through a digital clock of finite precision and finite drift is an untimed regular language. Section 4 formulates and studies diagnosability in the dense time setting for sys-
2 tems in which faults are specified using faulty events. Section 5 looks at the extension where non-failure specification is given, a violation of which corresponds to the occurrence of a fault. Conclusion is presented in Section 6. II. NOTATIONS AND PRELIMINARIES A timed automaton A is a tuple (Q, Σ, Ξ, Υ, Q 0, I), where Q is a finite set of discrete states; Σ is a finite set of events; Ξ is a finite set of clocks; Υ Q Q Σ Φ 2 Ξ is a set of transitions. Here Φ is the set of clock constraints. A clock constraint φ Φ is a boolean formula with atomic constraints of the form ξ c or ξ 1 ξ 2 c, where ξ 1, ξ 2 Ξ, {, <, =, >, }, and c is a rational constant. Each transition υ Υ is a tuple (q, q, σ, φ, r) with q is the source discrete state, q is the destination discrete state, σ is the event associated with the transition, φ is a clock constraint representing the guard condition of the transition, r is the set of clocks to be reset by the transition when entering the destination discrete state q. Q 0 Q is the set of initial states; I : Q Φ is the invariant function, which assigns invariants to discrete states. Let R + be the set of nonnegative real numbers. A timed trace over Σ is a sequence ν =< σ 0, t 0 >< σ 1, t 1 > < σ i, t i > < σ n, t n > with t i R + for all i = 0, 1,, n, t i t i+1 and σ i Σ for all i = 0, 1,, n 1, and σ n Σ {ɛ}, where ɛ is the null event. The corresponding untimed trace of ν is ν untime = σ 0 σ n. A time assignment is a function v : Ξ R + assigning a nonnegative real value to every clock. Constants may be added to time assignments, where (v + c)(ξ) = v(ξ) + c. [r 0]v is the time assignment that maps every clock in r Ξ to time 0 and keeps all other clocks same as in v. We say that the clocks in r are reset. The time assignment 0 v maps every clock to 0. A run of A over a timed trace ν =< σ 0, t 0 >< σ 1, t 1 > < σ i, t i > < σ n, t n > is a sequence of the form (q 0, v 0 ) <σi,ti> (q i+1, v i+1 ) <σn,tn> (q n+1, v n+1 ) with q i Q and v i being the time assignments, satisfying the following requirements: Initialization: q 0 Q 0 and v 0 = 0 v Invariance: i = 0, 1, n, t [0, t i t i 1 ], v i + t satisfies I(q i ), where t 1 = 0 Consecution: i = 0, 1, n 1, (q i, q i+1, σ i, φ i, r i ) Υ such that v i + t i t i 1 satisfies φ i and v i+1 = [r i 0](v i + t i t i 1 ), where t 1 = 0; if σ n ɛ then there is a tuple (q n, q n+1, σ n, φ n, r n ) Υ such that v n + t n t n 1 satisfies φ n and v n+1 = [r n 0](v n + t n t n 1 ), otherwise q n+1 = q n and v n+1 = v n + t n t n 1. A timed automaton A accepts a timed trace ν if A has a run over ν. The timed language accepted by A is the set of all timed traces accepted by A, which is denoted by L(A). It is obvious that L(A) is prefix closed. The untimed language of A is L untime (A) = {ν untime ν L(A)}. It is required that in a timed automaton, when the invariant of a discrete state is violated, some outgoing transition must be enabled; and the automaton is non-zeno, i.e., there does not exist any run of the automaton that contains infinite transitions in a finite interval of time. The product of two timed automata is defined as follows. Let A 1 = (Q 1, Σ 1, Ξ 1, Υ 1, Q 1 0, I 1 ) and A 2 = (Q 2, Σ 2, Ξ 2, Υ 2, Q 2 0, I 2 ) be two timed automata. Assume that the clock sets Ξ 1 and Ξ 2 are disjoint. Then, the product is the timed automaton A 1 A 2 = (Q 1 Q 2, Σ 1 Σ 2, Ξ 1 Ξ 2, Υ, Q 1 0 Q 2 0, I), where I(q 1, q 2 ) = I 1 (q 1 ) I 2 (q 2 ) and the transition set Υ is defined by: 1) σ Σ 1 Σ 2, (q 1, q 1, σ, φ 1, r 1 ) Υ 1, (q 2, q 2, σ, φ 2, r 2 ) Υ 2, we have ((q 1, q 2 ), (q 1, q 2), σ, φ 1 φ 2, r 1 r 2 ) Υ. 2) σ Σ 1 Σ 2, (q 1, q 1, σ, φ 1, r 1 ) Υ 1, q 2 Q 2, we have ((q 1, q 2 ), (q 1, q 2 ), σ, φ 1, r 1 ) Υ. 3) σ Σ 2 Σ 1, (q 2, q 2, σ, φ 2, r 2 ) Υ 2, q 1 Q 1, we have ((q 1, q 2 ), (q 1, q 2), σ, φ 2, r 2 ) Υ. From [1], [6], we have the following result. Theorem 1: The untimed language L untime (A) of a timed automaton A is regular. To introduce partial observation of events, let M : Σ {ɛ} Λ {ɛ} be an event observation mask with M(ɛ) = ɛ, where Λ is the set of output symbols. An untimed trace s = σ 0 σ 1 σ i is observed through the mask M as M(s) = M(σ 0 )M(σ 1 ) M(σ i ). Given an untimed closed language K Σ, the event masked language M(K) is given by, M(K) := {M(s) Λ s K}. To introduce the faults, let F = {F 1, F 2,, F m } be the set of failure types, ψ : Σ 2 F be the fault assignment function for each event, where ψ(σ) = means σ is a good event otherwise σ is a faulty event and ψ(σ) is the set of fault types that σ is associated with. Hereafter, when we write that a fault of type F i has occurred, we will mean that some faulty event σ has occurred such that F i ψ(σ). For an untimed trace s = σ 0 σ 1 σ i, if F i ψ(σ i ) for some event σ i in the trace, then we say that a fault of type F i has occurred in s, which is denoted as F i s. The definition of diagnosability for untimed discrete event systems is given below ([17]). Definition 1: A prefix-closed language K Σ is said to be diagnosable with respect to the event mask M and the fault assignment function ψ if the following holds: ( F i F)( N i > 0) ( s = σ 0 σ j K, F i s) ( t = sσ j+1 σ j+n K, n N i ) ( w L, M(w) = M(t) (F i w) A discrete event system is diagnosable if its generated language is diagnosable.
3 Polynomial algorithms for the test of the above diagnosability and the synthesis of the on-line diagnoser can be found in [8], [24], [11]. III. TIMING MASKED LANGUAGE AND ITS REGULARITY In this section we define the discrete-time behavior of a dense timed-automaton as observed using a digital clock of finite precision and finite drift. We show that such as a discrete-time behavior is a regular language, i.e., can be accepted by a (untimed) automaton. To introduce the observation mask for the time, suppose we have a digital-clock with the precision of and the clock drift of δ with > δ 0 and both and δ are rational numbers, then for every T [ δ, + δ] time units the clock will generate a special tick event τ Σ. We will denote such a digital clock by clock (,δ). Definition 2: Given a clock clock (,δ), the timing mask function M (,δ) for timed traces is defined as: for every timed trace ν =< σ 0, t 0 >< σ 1, t 1 > < σ i, t i >, M (,δ) (ν) := τ t0/t0 σ 0 τ t1/t1 t0/t0 σ 1 τ ti/ti ti 1/Ti 1 σ i where τ 0 = ɛ, τ i+1 = τ τ i and T i [ δ, + δ] for all i 0. The timing masked language of A under clock (,δ) is M (,δ) (L(A)) = {M (,δ) (ν) ν L(A)}. It is obvious that M (,δ) (L(A)) is prefix closed and is a language over Σ {τ}, i.e., M (,δ) (L(A)) (Σ {τ}). Since τ is just another symbol (a tick symbol), this implies that the timing masked language is an untimed language. We show below that when A is a dense timed-automaton, its timing masked language is a regular untimed language. Theorem 2: Given a timed automaton A, let L(A) be its timed language, then its timing masked language M (,δ) (L(A)) is regular. Sketch of Proof: Let C = (Q c, Σ c, Ξ c, Υ c, Q c 0, I c ) be the timed automaton model for the digital clock clock (,δ) with Q c = Q c 0 = {q 0 }, Σ c = {τ}, Ξ = {ξ c }, Υ c = {(q 0, q 0, τ, [ξ c δ] [ξ c + δ], {ξ c })}, and I c (q 0 ) = [ξ c 0] [ξ c + δ]; and let P = A C be the product timed automaton of A and C. It can be proved that M (,δ) (L(A)) = L untime (P ). Then the result follows directly from Theorem 1. IV. FAILURE DIAGNOSIS WITH EVENT AND TIMING MASKS In this section we study the failure diagnosis problem of timed discrete event systems modeled by timed automata with both timing and event observation masks. Let A = (Q, Σ, Ξ, Υ, Q 0, I) be the timed automata model of the system, M (,δ) be the timing mask, M : Σ {ɛ} Λ {ɛ} be the event observation mask, F = {F 1, F 2,, F m } be the set of failure types, ψ : Σ 2 F be the fault assignment function for each event. For a timed trace ν =< σ 0, t 0 >< σ 1, t 1 > < σ i, t i >, if F i ψ(σ i ) for some event σ i in the trace, then we say that a fault of type F i has occurred in ν, which is denoted as F i ν. A timed trace ν =< σ 0, t 0 >< σ 1, t 1 > < σ i, t i > observed through the event observation mask M is M(ν) = < M(σ i ) ɛ, t i >. The trace ν observed through both timing and event masks is M M (,δ) (ν) = τ t0/ M(σ 0 )τ t1/ t0/ M(σ 1 ) τ ti/ ti 1/ M(σ i ) It is not difficult to verify that M M (,δ) (ν) = M (,δ) M(ν). The event and timing masked language of A is M M (,δ) (L(G)) = {M M (,δ) (ν) ν L(A)}. Now we give the definition of diagnosability. Definition 3: A prefix-closed timed language L is said to be diagnosable with respect to the timing mask M (,δ), the event mask M, and the fault assignment function ψ if the following holds: ( F i F)( B i R + ) ( µ =< σ 0, t 0 > < σ j, t j > L, F i µ) ( µ = µ < σ j+1, t j+1 > < σ n, t n > L, t n (t j + B i )) ( ν L, M M (,δ) (ν) = M M (,δ) (µ )) (F i ν) A dense-time system A is said to be diagnosable if its timed language L(A) is diagnosable. The diagnosis problem of dense-time systems with both timing and event masks can be reduced to the diagnosis problem of untimed systems with only event observation mask. In the following, we first show that the timing masked language of a timed automaton is regular, and next establish the equivalence of the diagnosabilities of a timed language and its timing masked language. Theorem 3: A prefix-closed timed language L is diagnosable with respect to the timing mask M (,δ), the event mask M, and the fault assignment function ψ if and only if its timing masked language M (,δ) (L) is diagnosable with respect to the event mask M and the fault assignment function ψ. Sketch of Proof: For the sufficiency, suppose M (,δ) (L) is diagnosable, i.e., for any F i there exists a N i such that the conditions in Definition 1 are satisfied. Then by picking B i = N i ( + δ) for the parameter B i in Definition 3, we can directly prove the diagnosability of L based on the following two facts. Fact 1: for any segment of a timed trace, if the time duration of the segment is longer than N i ( +δ) then the timing mask of the segment contains at least N i tick events. Fact 2: for any timed trace µ L, F i µ if and only if F i M (,δ) (µ). For the necessity, Suppose the timed language L is diagnosable, i.e., for any F i there exists a B i such that the conditions in Definition 3 are satisfied. From the assumption that the system is non-zeno, we know that given a T R +, there exists an integer K T such that for any segment of a timed trace in L, if the segment contains more than K T events then the time duration of the segment is longer than T. Let K Bi denote the above bound for the number
4 of events within a time duration of B i, then by picking N i = K Bi + B i /( δ) + 1 for the parameter N i in Definition 1, we can directly prove the diagnosability of M (,δ) (L) based on the following facts. Fact 1: for any segment of a timing mask trace in M (,δ) (L), if it contains more than N i events, then it either contains more than K Bi events in Σ or contains more than B i /( δ) tick events, and in either case the duration of the segment is longer than B i. Fact 2: for any timing mask of a timed trace µ L, F i M (,δ) (µ) if and only if F i µ. From Theorems 2 and 3, the diagnosis problem of densetime systems with both timing and event observation masks can be reduced to the diagnosis problem of untimed discrete event systems with event observation mask. Thus, the results for the diagnosis of untimed discrete event systems like [8], [24], [11] can be applied for the test of diagnosability and the synthesis of on-line as well as off-line diagnoser. V. DIAGNOSIS WITH DENSE TIME SPECIFICATION We study the diagnosis problem where one dense timedautomaton is given as the system model and another dense timed-automaton as the specification model which specifies the non-failure behavior. The task of diagnosis is to diagnose any faulty behavior of the system (with respect to the specification) within a bounded delay of its occurrence in the presence of both timing and event masks. In other words, the fault is not specified as faulty events directly. This notion of diagnosability is captured by the following definition. Definition 4: Given a system with a timed automaton model G = (Q, Σ, Ξ, Υ, Q 0, I), a specification with a timed automaton model R = (Q R, Σ, Ξ R, Υ R, Q R 0, I R ), the timing mask M (,δ), and the event mask M, (G, R) is said to be diagnosable with respect to M (,δ) and M if the following holds: ( B R + ) ( µ =< σ 0, t 0 > < σ j, t j > L(G) L(R)) ( µ = µ < σ j+1, t j+1 > < σ n, t n > L(G), t n (t j + B)) ( ν L(G), M M (,δ) (ν) = M M (,δ) (µ )) (ν L(R)) For any deterministic specification R, the above diagnosis problem for a pair of timed automata can be transferred to the diagnosis problem of a single timed automaton with faulty event as defined in Definition 3. For this, we first complete the specification R by adding a dump state and all the missing transitions. Let R denote the automaton derived; it is constructed as follows: R = (Q R {dump}, Σ, Ξ R, Υ R Υ add, Q R 0, I R ), where q Q R, I R (q) = I R (q), I R (dump) = true, and the set of added transitions Υ add is defined as q Q R, σ Σ, suppose there are n 0 out-going transitions from q labeled with σ, and let {φ 1 σ,, φ n σ} be the set of guard conditions associated with those n transitions, then (q, dump, ( n i=1 φi σ), σ, ) Υ add. σ Σ, (dump, dump, true, σ, ) Υ add. It is obvious that R accepts any timed trace over the event set Σ, if a timed trace leads to the state dump, then the trace is not accepted by R, and in which case it indicates a fault. In order to represent such a fault using a faulty event, next we split the dump state into dump 1 and dump 2 states; make all self-loop transitions of dump as self-loop transitions of dump 2 ; make all incoming non-selfloop transitions of dump as incoming transitions of dump 1 ; add an outgoing transition on f from dump 1 to dump 2. The automaton obtained is denoted as R f and it is defined as follows. R f = (Q R {dump 1, dump 2 }, Σ {f}, Ξ R {ξ f }, Υ R Υ f add, QR 0, I f R ), where q Q R, I f R (q) = I R(q), I f R (dump 1) = (ξ f = 0), I f R (dump 2) = true, and the set of transitions Υ f add is defined as q Q R, σ Σ, suppose there are n 0 out-going transitions from q labeled with σ, and let {φ 1 σ,, φ n σ} be the set of guard conditions associated with those n transitions, then (q, dump 1, ( n i=1 φi σ), σ, {ξ f }) Υ f add. σ Σ, (dump 2, dump 2, true, σ, ) Υ f add. (dump 1, dump 2, ξ f = 0, f, ) Υ f add. Then we can compose G with R f and obtain the product timed automaton G R f with the faulty event f. Since f Σ, the event f occurs asynchronously in the composition (i.e., without the participation of G), whereas all other events occur synchronously. For the automaton G R f, we have only one failure type, i.e., F = {F 1 }, and the corresponding fault assignment function ψ f is defined as ψ f (f) = {F 1 } and ψ f (σ) = for any σ Σ. From the construction of G R f it can be proved that (G, R) is diagnosable according to Definition 4 if and only if G R f is diagnosable according to Definition 3. Also the problem can be further reduced to the diagnosis of untimed systems as established above. We have the following theorem. Theorem 4: Given a system G, a deterministic specification R, the timing mask M (,δ), and the event mask M, (G, R) is diagnosable with respect to M (,δ) and M if and only if G R f is diagnosable with respect to M (,δ), M, and ψ f. Sketch of Proof: The result follows directly from the facts that there is a one-to-one mapping between the timed languages of G and G R f ; and for any timed trace ν L(G), ν L(R) if and only if ν f, which is the corresponding trace of ν in L(G R f ), contains the faulty event f, i.e., F 1 ν f. VI. CONCLUSION The paper considered the diagnosis of timed discrete event systems where the model of the system as well as of the non-failure specification is allowed to be dense timedautomaton [1], [6]. (The non-failure specification model is deterministic.) While it is meaningful for a system as well as its specification of non-failure behavior to have a densetime semantics, it is not practical for a diagnoser to be
5 able to measure dense-time precisely. An imprecision in measurement of time can be viewed as partial observability of time, just as the presence of imprecise sensors leads to a partial observability of events. A main observation is that for a diagnoser with access to a digital-clock, the discrete-time behavior as observed by the diagnoser is regular as long as the digital-clock can be modeled as a dense timed-automaton. (This for example is the case for a digital-clock with finite precision and a bounded drift.) Another observation is that the diagnosability property is preserved under timing masking. Based on these two observations it was shown that the problem of diagnosis of dense-time systems can be reduced to one of untimed systems. Consequently, results from the untimed setting such as those reported in [11] can be applied to perform the diagnosis of a dense-time system against a dense-time specification in the presence of partial observation of events as well as imprecise measurement of time. ACKNOWLEDGMENT The research was supported in part by the National Science Foundation under the grants NSF-ECS , NSF- ECS , NSF-EPNES , and NSF REFERENCES [1] R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126: , [2] R. K. Boel and J. H. van Schuppen. Decentralized failure diagnosis for discrete-event systems with constrained communication between diagnosers. In Proceedings of International Workshop on Discrete Event Systems, [3] O. Contant, S. Lafortune, and D. Teneketzis. Diagnosis of intermittent faults. Discrete Event Dynamical Systems: Theory and Application, 14: , [4] S. R. Das and L. E. Holloway. Characterizing a confidence space for discrete event timings for fault monitoring using discrete sensing and actuation signals. IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans, 30(1):52 66, [5] R. Debouk, S. Lafortune, and D. Teneketzis. Coordinated decentralized protocols for failure diagnosis of discrete event systems. Discrete Event Dynamical Systems: Theory and Applications, 10:33 79, [6] T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model-checking for real-time systems. Information and Computation, 111: , [7] L. E. Holloway and S. Chand. Distributed fault monitoring in manufacturing systems using concurrent discrete-event observations. Integrated Computer-Aided Engineering, 3(4): , [8] S. Jiang, Z. Huang, V. Chandra, and R. Kumar. A polynomial time algorithm for diagnosability of discrete event systems. IEEE Transactions on Automatic Control, 46(8): , [9] S. Jiang and R. Kumar. Diagnosis of repeated failures for discrete event systems with linear-time temporal logic specifications. In Proceedings of IEEE Conference on Decision and Control, pages , Maui, Hawaii, [10] S. Jiang and R. Kumar. Failure diagnosis of discrete event systems with linear-time temporal logic fault specifications. IEEE Transactions on Automatic Control, 49(6): , [11] S. Jiang, R. Kumar, and H. E. Garcia. Diagnosis of repeated/intermittent failures in discrete event systems. IEEE Transactions on Robotics and Automation, 19(2): , [12] C. M. Ozveren and A. S. Willsky. Observability of discrete event dynamical systems. IEEE Transactions on Automatic Control, 35(7): , [13] W. Qiu and R. Kumar. Decentralized failure diagnosis of discrete event systems. In Proceedings of 2004 International Workshop on Discrete Event Systems, Reim, France, September [14] W. Qiu and R. Kumar. Distributed failure diagnosis under bounded delay using immediate observation passing protocol. In Proceedings of 2005 American Control Conference, Portland, OR, June [15] W. Qiu, R. Kumar, and S. Jiang. Decidability of distributed diagnosis under unbounded-delay communication. IEEE Transactions on Automatic Control, Submitted. [16] S. L. Ricker and J. H. van Schuppen. Decentralized failure diagnosis with asynchronous communication between supervisors. In Proceedings of the European Control Conference, pages , [17] M. Sampath, R. Sengupta, S. Lafortune, K. Sinaamohideen, and D. Teneketzis. Diagnosability of discrete event systems. IEEE Transactions on Automatic Control, 40(9): , September [18] R. Sengupta and S. Tripakis. Decentralized diagnosis of regular language is undecidable. In Proceedings of IEEE Conference on Decision and Control, pages , Las Vegas, NV, December [19] R. Su, W. M. Wonham, J. Kurien, and X. Koutsoukos. Distributed diagnosis for qualitative systems. In Proceedings of International Workshop on Discrete Event Systems, [20] D. Thorsley and D. Teneketzis. Diagnosability of stochastic discreteevent systems. IEEE Transactions on Automatic Control, 50(4): , [21] S. Tripakis. Fault diagnosis for timed automata. In Formal Techniques in Real Time and Fault Tolerant Systems, volume 2469 of Lecture Notes in Computer Science. Springer Verlag, [22] Y. Wang, T.-S. Yoo, and S. Lafortune. New results on decentralized diagnosis of discrete-event systems. In Proceedings of 2004 Annual Allerton Conference, [23] T. Yoo and H. E. Garcia. Event diagnosis of discrete-event systems with uniformly and nonuniformly bounded diagnosis delays. In Proceedings of 2004 American Control Conference, pages , Boston, MA, June [24] T. S. Yoo and S. Lafortune. Polynomial-time verification of diagnosability of partially observed discrete-event systems. IEEE Transactions on Automatic Control, 47(9): , [25] S. H. Zad, R. H. Kwong, and W. M. Wonham. Fault diagnosis in discrete-event systems: Framework and model reduction. IEEE Transactions on Automatic Control, 48(7): , [26] S. H. Zad, R. H. Kwong, and W. M. Wonham. Fault diagnosis in discrete-event systems: Incorporating timing information. IEEE Transactions on Automatic Control, 50(7): , [27] C. Zhou and R. Kumar. Computation of diagnosable fault-occurrence indices for systems with repeatable-faults. In Proceeding of 2005 IEEE Conference on Decision and Control and European Control Conference, Seville, Spain, December 2005.
DECENTRALIZED 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 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 informationDiagnosis of Repeated/Intermittent Failures in Discrete Event Systems
Diagnosis of Repeated/Intermittent Failures in Discrete Event Systems Shengbing Jiang, Ratnesh Kumar, and Humberto E. Garcia Abstract We introduce the notion of repeated failure diagnosability for diagnosing
More informationFailure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications
Failure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications Shengbing Jiang and Ratnesh Kumar Abstract The paper studies failure diagnosis of discrete event systems with
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 informationDecentralized Failure Diagnosis of Discrete Event Systems
IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL., NO., 2005 1 Decentralized Failure Diagnosis of Discrete Event Systems Wenbin Qiu, Student Member, IEEE, and Ratnesh Kumar,
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 informationFailure Diagnosis of Discrete-Time Stochastic Systems subject to Temporal Logic Correctness Requirements
Failure Diagnosis of Discrete-Time Stochastic Systems subject to Temporal Logic Correctness Requirements Jun Chen, Student Member, IEEE and Ratnesh Kumar, Fellow, IEEE Dept. of Elec. & Comp. Eng., Iowa
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 informationOnline Failure Diagnosis of Stochastic Discrete Event Systems
Online Failure iagnosis of Stochastic iscrete Event Systems Jun Chen, Student Member, IEEE and Ratnesh Kumar, Fellow, IEEE Abstract This paper deals with the detection of (permanent) fault in the setting
More informationMonitoring and Fault-Diagnosis with Digital Clocks
Author manuscript, published in "6th Int. Conf. on Application of Concurrency to System Design (ACSD'06) (2006)" Monitoring and Fault-Diagnosis with Digital Clocks Karine Altisen Verimag Laboratory Karine.Altisen@imag.fr
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 informationDiagnosis of Discrete-Event Systems in Rules-based Model using First-order Linear Temporal Logic
Diagnosis of Discrete-Event Systems in Rules-based Model using First-order Linear Temporal Logic Zhongdong Huang and Siddhartha Bhattacharyya Dept. of Elec. & Comp. Eng., Univ. of Kentucky, Lexington,
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 informationDecentralized Failure Diagnosis of Stochastic Discrete Event Systems
Decentralized Failure Diagnosis of Stochastic Discrete Event Systems Jun Chen, Student Member, IEEE and Ratnesh Kumar, Fellow, IEEE Abstract In decentralized diagnosis the system behavior is monitored
More informationDISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES
DISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES Maxim Gromov 1, Khaled El-Fakih 2, Natalia Shabaldina 1, Nina Yevtushenko 1 1 Tomsk State University, 36 Lenin Str.. Tomsk, 634050, Russia gromov@sibmail.com,
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 informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
Control Synthesis of Discrete Manufacturing Systems using Timed Finite utomata JROSLV FOGEL Institute of Informatics Slovak cademy of Sciences ratislav Dúbravská 9, SLOVK REPULIC bstract: - n application
More information7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing-
7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing- Constrained Systems, Proc. 4th Workshop Computer-Aided Verication, Lecture Notes in Computer Science 663, Springer-Verlag,
More informationDiagnosability Analysis of Discrete Event Systems with Autonomous Components
Diagnosability Analysis of Discrete Event Systems with Autonomous Components Lina Ye, Philippe Dague To cite this version: Lina Ye, Philippe Dague. Diagnosability Analysis of Discrete Event Systems with
More informationOn decision problems for timed automata
On decision problems for timed automata Olivier Finkel Equipe de Logique Mathématique, U.F.R. de Mathématiques, Université Paris 7 2 Place Jussieu 75251 Paris cedex 05, France. finkel@logique.jussieu.fr
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 informationAutomata-theoretic analysis of hybrid systems
Automata-theoretic analysis of hybrid systems Madhavan Mukund SPIC Mathematical Institute 92, G N Chetty Road Chennai 600 017, India Email: madhavan@smi.ernet.in URL: http://www.smi.ernet.in/~madhavan
More informationFolk Theorems on the Determinization and Minimization of Timed Automata
Folk Theorems on the Determinization and Minimization of Timed Automata Stavros Tripakis VERIMAG Centre Equation 2, avenue de Vignate, 38610 Gières, France www-verimag.imag.fr Abstract. Timed automata
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 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 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 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 informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationCoordinated Decentralized Protocols for Failure Diagnosis of Discrete Event Systems
Discrete Event Dynamic Systems: Theory and Applications, 10, 33 86 (2000) c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Coordinated Decentralized Protocols for Failure Diagnosis
More informationTimed Automata VINO 2011
Timed Automata VINO 2011 VeriDis Group - LORIA July 18, 2011 Content 1 Introduction 2 Timed Automata 3 Networks of timed automata Motivation Formalism for modeling and verification of real-time systems.
More informationOn Controllability and Normality of Discrete Event. Dynamical Systems. Ratnesh Kumar Vijay Garg Steven I. Marcus
On Controllability and Normality of Discrete Event Dynamical Systems Ratnesh Kumar Vijay Garg Steven I. Marcus Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin,
More informationFinally the Weakest Failure Detector for Non-Blocking Atomic Commit
Finally the Weakest Failure Detector for Non-Blocking Atomic Commit Rachid Guerraoui Petr Kouznetsov Distributed Programming Laboratory EPFL Abstract Recent papers [7, 9] define the weakest failure detector
More informationNew Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (Extended Abstract) Gaoyan Xie, Cheng Li and Zhe Dang School of Electrical Engineering and
More informationfor System Modeling, Analysis, and Optimization
Fundamental Algorithms for System Modeling, Analysis, and Optimization Stavros Tripakis UC Berkeley EECS 144/244 Fall 2013 Copyright 2013, E. A. Lee, J. Roydhowdhury, S. A. Seshia, S. Tripakis All rights
More informationThe algorithmic analysis of hybrid system
The algorithmic analysis of hybrid system Authors: R.Alur, C. Courcoubetis etc. Course teacher: Prof. Ugo Buy Xin Li, Huiyong Xiao Nov. 13, 2002 Summary What s a hybrid system? Definition of Hybrid Automaton
More informationTimed Fault Tolerant Supervisory Control
Timed Fault Tolerant Supervisory Control TIMED FAULT TOLERANT SUPERVISORY CONTROL BY AMAL ALSUWAIDAN, B. IT. a thesis submitted to the department of computing and software and the school of graduate studies
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 informationA Simplified Approach for Testing Real-Time Systems Based on Action Refinement
A Simplified Approach for Testing Real-Time Systems Based on Action Refinement Saddek Bensalem, Moez Krichen, Lotfi Majdoub, Riadh Robbana, Stavros Tripakis Verimag Laboratory, Centre Equation 2, avenue
More informationAuthor's personal copy
Automatica 46 (2010) 1165 1175 Contents lists available at ScienceDirect Automatica journal homepage: www.elsevier.com/locate/automatica Optimal sensor activation for diagnosing discrete event systems
More informationThe efficiency of identifying timed automata and the power of clocks
The efficiency of identifying timed automata and the power of clocks Sicco Verwer a,b,1,, Mathijs de Weerdt b, Cees Witteveen b a Eindhoven University of Technology, Department of Mathematics and Computer
More informationModels for Efficient Timed Verification
Models for Efficient Timed Verification François Laroussinie LSV / ENS de Cachan CNRS UMR 8643 Monterey Workshop - Composition of embedded systems Model checking System Properties Formalizing step? ϕ Model
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 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 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 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 informationTimed Automata. Semantics, Algorithms and Tools. Zhou Huaiyang
Timed Automata Semantics, Algorithms and Tools Zhou Huaiyang Agenda } Introduction } Timed Automata } Formal Syntax } Operational Semantics } Verification Problems } Symbolic Semantics & Verification }
More informationUndecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae XXI (2001) 1001 1025 1001 IOS Press Undecidability Results for Timed Automata with Silent Transitions Patricia Bouyer LSV, ENS Cachan, CNRS, France bouyer@lsv.ens-cachan.fr Serge
More informationComparing diagnosability in Continuous and Discrete-Event Systems
Comparing diagnosability in Continuous and Discrete-Event Systems Marie-Odile Cordier IRISA, Université de Rennes 1 Rennes, France Louise Travé-Massuyès and Xavier Pucel LAAS-CNRS Toulouse, France Abstract
More informationSUPERVISORY CONTROL AND FAILURE DIAGNOSIS OF DISCRETE EVENT SYSTEMS: A TEMPORAL LOGIC APPROACH
University of Kentucky UKnowledge University of Kentucky Doctoral Dissertations Graduate School 2002 SUPERVISORY CONTROL AND FAILURE DIAGNOSIS OF DISCRETE EVENT SYSTEMS: A TEMPORAL LOGIC APPROACH Shengbing
More informationA new Abstraction-Refinement based Verifier for Modular Linear Hybrid Automata and its Implementation
A new Abstraction-Refinement based Verifier for Modular Linear Hybrid Automata and its Implementation Hao Ren 1 (ren@iastate.edu), Jing Huang 2 (freescaler@live.com), Shengbing Jiang 3 (shengbing.jiang@gm.com)
More informationFault Tolerant Controllability
2015 American Control Conference Palmer House Hilton July 1-3, 2015. Chicago, IL, USA Fault Tolerant Controllability Simon Radel, Aos Mulahuwaish, and Ryan J. Leduc Abstract In this paper we investigate
More informationMasked Prioritized Synchronization for Interaction and Control of Discrete Event Systems
Masked Prioritized Synchronization for Interaction and Control of Discrete Event Systems Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Michael Heymann
More informationReal-Time Systems. Lecture 15: The Universality Problem for TBA Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany
Real-Time Systems Lecture 15: The Universality Problem for TBA 2013-06-26 15 2013-06-26 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: Extended Timed
More informationPredictable real-time software synthesis
Real-Time Syst (2007) 36: 159 198 DOI 10.1007/s11241-007-9013-6 Predictable real-time software synthesis Jinfeng Huang Jeroen Voeten Henk Corporaal Published online: 28 March 2007 Springer Science+Business
More informationMonitoring and Active Diagnosis for Discrete-Event Systems
Monitoring and Active Diagnosis for Discrete-Event Systems Elodie Chanthery, Yannick Pencolé LAAS-CNRS, University of Toulouse, Toulouse, France (e-mail: [elodie.chanthery, yannick.pencole]@laas.fr) University
More informationApproximately Bisimilar Finite Abstractions of Stable Linear Systems
Approximately Bisimilar Finite Abstractions of Stable Linear Systems Antoine Girard Université Joseph Fourier Laboratoire de Modélisation et Calcul B.P. 53, 38041 Grenoble, France Antoine.Girard@imag.fr
More informationA. Disjunctive Prognosers
2009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 10-12, 2009 FrB11.4 Multi-Decision Decentralized Prognosis of Failures in Discrete Event Systems Ahmed Khoumsi and Hicham
More informationThe Verification of Real Time Systems using the TINA Tool
Proceedings of the 17th World Congress The International Federation of Automatic Control The Verification of Real Time Systems using the TINA Tool Pedro M. Gonzalez del Foyo Jose Reinaldo Silva Dept. Of
More informationVerification of Linear Duration Invariants by Model Checking CTL Properties
UNU-IIST International Institute for Software Technology Verification of Linear Duration Invariants by Model Checking CTL Properties Miaomiao Zhang, Dang Van Hung and Zhiming Liu June 2008 UNU-IIST Report
More informationDiagnosis of Labeled Time Petri Nets Using Time Interval Splitting
Preprints of the 19th World Congress The International Federation of Automatic Control Diagnosis of Labeled Time Petri Nets Using Time Interval Splitting Baisi Liu, Mohamed Ghazel, Armand Toguyéni, Univ.
More informationDiagnosability of Stochastic Discrete-Event Systems Under Unreliable Observations
Diagnosability of Stochastic Discrete-Event Systems Under Unreliable Observations David Thorsley, Tae-Sic Yoo, and Humberto E. Garcia Abstract We investigate diagnosability of stochastic discrete-event
More informationTIMED-EVENT-STATE-BASED DIAGNOSER FOR MANUFACTURING SYSTEMS
TIMED-EVENT-STATE-BASED DIAGNOSER FOR MANUFACTURING SYSTEMS M. Sayed-Mouchaweh, A. Philippot, V. Carre-Menetrier, B. Riera Universite de Reims, CReSTIC -LAM Moulin de la Mousse B.P. 39 5687 REIMS Cedex
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 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 informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationSupervision Patterns in Discrete Event Systems Diagnosis
Supervision Patterns in Discrete Event Systems Diagnosis Thierry Jéron, Hervé Marchand, Sophie Pinchinat, Marie-Odile Cordier IRISA, Campus Universitaire de Beaulieu, 35042 Rennes, rance {irstame.ame}@irisa.r
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 informationTIMED automata, introduced by Alur and Dill in [3], have
1 Language Inclusion Checking of Timed Automata with Non-Zenoness Xinyu Wang, Jun Sun, Ting Wang, and Shengchao Qin Abstract Given a timed automaton P modeling an implementation and a timed automaton S
More informationTESTING is one of the most important parts of the
IEEE TRANSACTIONS 1 Generating Complete Controllable Test Suites for Distributed Testing Robert M. Hierons, Senior Member, IEEE Abstract A test suite is m-complete for finite state machine (FSM) M if it
More informationFormally Correct Monitors for Hybrid Automata. Verimag Research Report n o TR
Formally Correct Monitors for Hybrid Automata Goran Frehse, Nikolaos Kekatos, Dejan Nickovic Verimag Research Report n o TR-2017-5 September 20, 2017 Verimag, University of Grenoble Alpes, Grenoble, France.
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationTowards Decentralized Synthesis: Decomposable Sublanguage and Joint Observability Problems
2014 American Control Conference (ACC) June 4-6, 2014. Portland, Oregon, USA Towards Decentralized Synthesis: Decomposable Sublanguage and Joint Observability Problems Liyong Lin, Alin Stefanescu, Rong
More informationAutomatic Synthesis of Distributed Protocols
Automatic Synthesis of Distributed Protocols Rajeev Alur Stavros Tripakis 1 Introduction Protocols for coordination among concurrent processes are an essential component of modern multiprocessor and distributed
More informationEECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization
EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Discrete Systems Lecture: Automata, State machines, Circuits Stavros Tripakis University of California, Berkeley Stavros
More informationUnbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods
Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods Sanjit A. Seshia and Randal E. Bryant Computer Science Department Carnegie Mellon University Verifying Timed Embedded Systems
More informationAbstractions and Decision Procedures for Effective Software Model Checking
Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture
More informationModelling Real-Time Systems. Henrik Ejersbo Jensen Aalborg University
Modelling Real-Time Systems Henrik Ejersbo Jensen Aalborg University Hybrid & Real Time Systems Control Theory Plant Continuous sensors actuators Task TaskTask Controller Program Discrete Computer Science
More informationS. Xu, S. Jiang, and R. Kumar, Fellow, IEEE
1 Diagnosis o Dense-Time Systems under Event and Timing Masks S. Xu, S. Jiang, and R. Kumar, Fellow, IEEE Abstract We study diagnosis o timed discrete-event systems (TDESs) modeled as timed-automata. Earlier
More informationTimed Automata. Chapter Clocks and clock constraints Clock variables and clock constraints
Chapter 10 Timed Automata In the previous chapter, we have discussed a temporal logic where time was a discrete entities. A time unit was one application of the transition relation of an LTS. We could
More informationAssertions and Measurements for Mixed-Signal Simulation
Assertions and Measurements for Mixed-Signal Simulation PhD Thesis Thomas Ferrère VERIMAG, University of Grenoble (directeur: Oded Maler) Mentor Graphics Corporation (co-encadrant: Ernst Christen) October
More informationTESTING TIMED FINITE STATE MACHINES WITH GUARANTEED FAULT COVERAGE
TESTING TIMED FINITE STATE MACHINES WITH GUARANTEED FAULT COVERAGE Khaled El-Fakih 1, Nina Yevtushenko 2 *, Hacene Fouchal 3 1 American University o Sharjah, PO Box 26666, UAE kelakih@aus.edu 2 Tomsk State
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
More informationOptimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency
Optimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency Vahid Saeidi a, Ali A. Afzalian *b, Davood Gharavian c * Phone +982173932626, Fax +982177310425 a,b,c Department of Electrical
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 informationAn introduction to Uppaal and Timed Automata MVP5 1
An introduction to Uppaal and Timed Automata MVP5 1 What is Uppaal? (http://www.uppaal.com/) A simple graphical interface for drawing extended finite state machines (automatons + shared variables A graphical
More informationLinear Time Logic Control of Discrete-Time Linear Systems
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering December 2006 Linear Time Logic Control of Discrete-Time Linear Systems Paulo Tabuada
More informationDecidability of Single Rate Hybrid Petri Nets
Decidability of Single Rate Hybrid Petri Nets Carla Seatzu, Angela Di Febbraro, Fabio Balduzzi, Alessandro Giua Dip. di Ing. Elettrica ed Elettronica, Università di Cagliari, Italy email: {giua,seatzu}@diee.unica.it.
More informationAn Active Learning Approach For Inferring Discrete Event Automata
An Active Learning Approach For Inferring Discrete Event Automata Mohammad Mahdi Karimi PhD. Candidate, ECE Supervisor: Dr Ali Karimoddini Summer 2015 1 Content 1. Discrete Event Systems Definitions Applications
More informationSupervisory Control of Hybrid Systems
X.D. Koutsoukos, P.J. Antsaklis, J.A. Stiver and M.D. Lemmon, "Supervisory Control of Hybrid Systems, in Special Issue on Hybrid Systems: Theory and Applications, Proceedings of the IEEE, P.J. Antsaklis,
More informationAPPROXIMATE SIMULATION RELATIONS FOR HYBRID SYSTEMS 1. Antoine Girard A. Agung Julius George J. Pappas
APPROXIMATE SIMULATION RELATIONS FOR HYBRID SYSTEMS 1 Antoine Girard A. Agung Julius George J. Pappas Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia, PA 1914 {agirard,agung,pappasg}@seas.upenn.edu
More informationComputing Accumulated Delays in Real-time Systems
Computing Accumulated Delays in Real-time Systems P~jeev Alur 1, Costas Courcoubetis u *, Thomas A. Henzinger 3 ** i AT&T Bell Laboratories, Murray Hill 2 Department of Computer Science, University of
More informationSafety Verification of Fault Tolerant Goal-based Control Programs with Estimation Uncertainty
2008 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June 11-13, 2008 WeAI01.6 Safety Verification of Fault Tolerant Goal-based Control Programs with Estimation Uncertainty Julia
More informationEE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories. Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo
EE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories 1 Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo Outline: Contracts and compositional methods for system design Where and why using
More informationSerge Haddad Mathieu Sassolas. Verification on Interrupt Timed Automata. Research Report LSV-09-16
Béatrice Bérard Serge Haddad Mathieu Sassolas Verification on Interrupt Timed Automata Research Report LSV-09-16 July 2009 Verification on Interrupt Timed Automata Béatrice Bérard 1, Serge Haddad 2, Mathieu
More informationAn On-the-fly Tableau Construction for a Real-Time Temporal Logic
#! & F $ F ' F " F % An On-the-fly Tableau Construction for a Real-Time Temporal Logic Marc Geilen and Dennis Dams Faculty of Electrical Engineering, Eindhoven University of Technology P.O.Box 513, 5600
More informationThe Element of Surprise in Timed Games
In Proc. of CONCUR 2003: 14th International Conference on Concurrency Theory, Lectures Notes in Computer Science, Springer-Verlag, 2003. The Element of Surprise in Timed Games Luca de Alfaro 1, Marco Faella
More informationComposability of Infinite-State Activity Automata
& Composability of Infinite-State Activity Automata Zhe Dang, Oscar H. Ibarra, and Jianwen Su School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Department
More informationOn Timed Components and their Abstraction
On Timed Components and their Abstraction Ramzi Ben Salah VERIMAG 2, av. de Vignate 386 Gieres, France Ramzi.Salah@imag.fr Marius Bozga VERIMAG 2, av. de Vignate 386 Gieres, France Marius.Bozga@imag.fr
More information