DISTINGUISHABILITY RELATIONS BETWEEN INITIALIZED NONDETERMINISTIC FSMs. Nina Yevtushenko Tomsk State University, Russia April, 12, 2011
|
|
- Ami Dalton
- 5 years ago
- Views:
Transcription
1 DISTINGUISHABILITY RELATIONS BETWEEN INITIALIZED NONDETERMINISTIC FSMs Nina Yevtushenko Tomsk State University, Russia April, 12, 2011
2 Outline 1. Why do we need distinguishability relations? 2. External distinguishability relations - trace distinguishability - non-reduction relation - r-distinguishability - Separability Verona University 2
3 What are distinguishability relations for? Distinguishability relations usually show how different are two or more FSMs Distinguishability relations are - Non-reflexive - Sometimes symmetric but usually not transitive Applications: verification, testing, Verona University 3
4 Verification and testing: similarity and difference Verification Both machines, specification and implementation FSMs, are given The transition relation of both FSMs is known Question: is Imp a conforming implementation of Spec? Solution: need a conformance relation and a technique how to distinguish nonconforming Imp from Spec Spec Imp Testing Specification FSM is given Some info about faults of Imp is known Question: is Imp a conforming implementation of Spec? Solution: need a conformance relation and how to derive distinguishing sequences for an external experiment with Imp i FSM S s 0 s n-1 o! Internal conformance relations can be checked verdict! Only external conformance relations can be checked Verona University 4
5 Where verification and testing of nondeterministic behavior is needed Software verification and testing (the environment is unstable) Remote testing (limited controllabiltiy and observability) Testing embedded components (limited controllability and observability) When testing w.r.t. a number of options allowed by the specification Verona University 5
6 External distinguishability relations for deterministic and nondeterministic FSMs Deterministic FSMs Nondeterministic FSMs External relations - External (trace) distinguishabilty External relations - Trace distinguishability - Non-reduction - R-distinguishability - Separability Verona University 6
7 External distinguishability State s of FSM S is trace distinguishable or simply distinguishable from state p of FSM P (s p) if there exists an input sequence α s.t. α is a defined input sequence at both states s and p and out S (s, α) out P (p, α) Two initialized FSMs S and P are (trace) distinguishable (S P) if their initial states are distinguishable!for the sake of simplicity, all FSMs are assumed to be reduced and initially connected Verona University 7
8 How to check whether two FSMs are distinguishable during verification Theorem 4.1 Observable FSMs B and S are distinguishable iff there exists state bs of the intersection B S and input i s.t. the behaviors of FSMs B and S are defined at states b and s for input i and out B (b, i) out S (s, i)! For non-observable FSMs the above conditions are only necessary Verona University 8
9 Example of distinguishable FSMs Two FSMs S and P b/0 a/1 a/0 1 2 c/1 b/1 a,c/0 c/1 a/0 b/1 b/0 a/1 c/1 3 4 a,c/1 b/0 a/1 a/0 1 2 c/1 b/1 a,c/0 c/1 a/0 b/1 b/0 a/1 c/1 3 4 a,c/1 A part of the intersection S P 32 b/? a/0 Verona University 9 13 a/1 out S (1, ab) = {11, 00} out P (3, ab) = {11, 01} b/1
10 How to check whether two FSMs are distinguishable by external experiment Trace distinguishable FSMs have different external behaviors and can be distinguished by an external experiment However, «all weather conditions» assumption should be satisfied during the experiment Verona University 10
11 All weather conditions assumption What is it and is it realistic? It is assumed that FSM under experiment can produce each possible output response if an input sequence is applied appropriately many times Nobody knows how many times an input sequence should be applied but one performs a limited number of experiments hoping that they are enough and thus, this assumption is known as fairness assumption Verona University 11
12 All weather conditions assumption (Example 1) FSM composition I 1 O 1 A U V B I 2 O 2 Suppose we test B implementation via I 1 and O 1 Let V = {0, 1} If we apply each input of I 1 at least twice there is a higher probability that A will show each possible output to each i 1 I 1 Verona University 12
13 All weather conditions assumption (Example 2) An FSM Imp under test is a controller for a complex system The FSM has to work properly when it is rather cold and rather hot Solution: to run test against Imp at least twice when it is cold and when it is hot Verona University 13
14 The complexity of distinguishing states of a complete observable FSM Similar to deterministic complete reduced FSMs, the following statement can be established Two states of a complete reduced observable FSM with n states can be distinguished with an input sequence of length at most (n 1)!The upper bound is reachable i/0 i/0 i/0 1 2 n i/0 i/1 FSM S Verona University 14
15 The complexity of distinguishing states of a partial observable FSM Two distinguishable states of a partial observable reduced FSM S with n states can be distinguished by an input sequence of length up to C n 2 The upper bound is reachable i /0 2 i /0 k-1 i /0 2 1 i /0 2 i /0 k-1 i /0 3 n-1 n i k /0 i k /1 k = C n 2 Only one input is defined for each pair! The number of inputs is C n 2 Verona University 15
16 Why do we need to evaluate length of a distinguishing sequence If FSMs S and P are distinguishable which input sequence should be applied in order to check which FSM is under experiment? Apply a distinguishing sequence a limited number of times and check whether the set of output responses of an FSM under test coincides with that of the specification FSM S Suppose there is a faulty FSM P and P is trace distinguishable with the specification FSM S s 0 s n-1 Distinguishing sequence FSM S or P? o verdict Verona University 16
17 The complexity of distinguishing two initialized complete observable FSMs Theorem 4.1 If two initialized complete observable FSMs with m and n states are distinguishable then these FSMs can be distinguished with an input sequence of length at most m +n -1 The upper bound is reachable Input: complete observable FSM S and P Output: a distinguishing sequence if S and P are distinguishable 1. Derive the intersection S P If S P is complete then S and P are not distinguishable; END 2. Find a state sp of the intersection S P and an input i s.t. the behavior of FSMs S and P are defined at states s and p for input i and out S (s, i) out P (p, i) If there is no such state Then S and P are not distinguishable; END Otherwise, let α be an input sequence that takes S P to state sp Then αi is a distinguishing sequence of FSMs S and P Verona University 17
18 The complexity of distinguishing two initialized partial observable FSMs Theorem 4.2 If two initialized possibly partial observable FSMs with m and n states are distinguishable then these FSMs can be distinguished with an input sequence of length at most mn The upper bound is reachable The only pair of distinguishable states is s n t m (1 n-1 2) m with length nm is a shortest distinguishing sequence FSM S FSM P Intersection S P 2/0 2/1 Verona University 18
19 Non-observable FSMs: why do we consider them? Each non-observable FSM has an equivalent observable FSM (an FSM with the same external behavior) However, An equivalent observable FSM is derived by the use of subset construction and can have 2 n - 1 states when the initial non-observable FSM has n states! The upper bound on the number of states is reachable Verona University 19
20 The complexity of distinguishing two states of non-observable FSMs A non-observable FSM can be converted into an observable FSM by the use of subset construction Two distinguishable states of a non-observable complete FSM with n states can be distinguished by an input sequence of length at most 2 n - 2! Still unknown whether this upper bound is reachable An example exists only for a distinguishing sequence of length 2 n-1 2! Still unknown whether the upper bound is the same for partial non-observable FSMs Verona University 20
21 The complexity of distinguishing two non-observable FSMs Two non-observable complete FSMs with n and m states can be distinguished by an input sequence of length at most (2 n 1) + (2 m 1) - 1! Still unknown whether this upper bound is reachable An example exists only for a distinguishing sequence of length 2 n-1 2! Still unknown whether the upper bound is the same for partial nonobservable FSMs Each non-observable FSM with n states has an equivalent observable FSM with at most (2 n 1) states Two non-observable FSMs with n and m states can be distinguished by an input sequence of length at most (2 n 1)(2 m 1)! It is unknown whether the upper bound (2 n 1)(2 m 1) is tight Verona University 21
22 Non-reduction relation State s of FSM S is not a reduction of state p of FSM P (s p) if the behavior of S at state s is not contained in the behavior of P at state p, i.e., Tr S (s) Tr P (p) Initialized FSM S is not a reduction of initialized FSM P (S P) if s 1 is a not a reduction of p 1! However, If S is not a reduction of P it can well happen that the FSMs cannot be distinguished by external experiment It is just the case when FSMs are compatible Verona University 22
23 Distinguishing FSMs w.r.t. the reduction relation State p of FSM P is distinguishable w.r.t. the reduction relation (rdistinguishable) from state s of FSM S (p s) if p is not a quasireduction of state s, i.e., there exists an input sequence α s.t. α is a defined input sequence at both states p and s and out P (p, α) out S (s, α) Initialized FSM P is distinguishable w.r.t. the reduction relation from initialized FSM S (P S) if the initial state p 1 of P is a not a quasireduction of the initial state s 1 of S, i.e., there exists an input sequence α s.t. α is a defined input sequence for both FSMs and out P (p 1, α) out S (s 1, α) α is an r-distinguishing sequence that distinguishes (w.r.t. the reduction relation) state p from s (FSM P from S) Verona University 23
24 How to check the distinguishability w.r.t. the reduction relation during verification Theorem 4.2 FSM B is not a quasi-reduction of an observable FSM S iff there exists state bs of the intersection B S and input i that is a defined input at states b and s s.t. out B S (bs, i) out B (b, i)! For a non-observable FSM S the conditions of Theorem 4.2 are only necessary! Theorem 4.2 can be used when checking two FSMs with known transition relations Verona University 24
25 How to check the distinguishability w.r.t. the reduction relation during external experiment FSMs which are distinguishable w.r.t. the reduction relation have different external behaviors and can be distinguished by an external experiment However, «all weather conditions» assumption should be satisfied during the experiment Verona University 25
26 Example of distinguishing FSMs w.r.t. the reduction relation FSM S is not a reduction of P FSM S s i/o 2 q i/o 2.i/o 1 S i/o 2.i/o 1 P i/o 1 i/o 2 FSM P i/o 1 i/o 2 i/o 2.i/o 2.i/o 1 P i/o 2.i/o 2.i/o 1 S i/o 2 ii is an input sequence r-distinguishing S from P iii is an input sequence r-distinguishing P from S Verona University 26
27 Evaluating length of a distinguishing sequence for observable FSMs Theorem 4.3 If FSM P with m states is not a quasi-reduction of observable FSM S with n states then the length of an r- distinguishing sequence does not exceed mn! The upper bound is reachable for complete FSMs when FSM S is observable Verona University 27
28 Example of distinguishing FSMs w.r.t. the reduction relation FSMs S and P where n and m are relative primes FSM S FSM P The only pair of distinguishable states is nm Verona University 28
29 Evaluating length of a distinguishing sequence for non-observable FSMs In fact, there are no results for the length of an r- distinguishing sequence for non-observable FSMs If a non-observable FSM with n states is not a reduction of a non-observable FSM with m states then there exists an r-distinguishing sequence of length at most (2 n 1)(2 m 1)! Still unknown whether this upper bound is reachable No examples for non-observable FSMs Verona University 29
30 Separability relation State s of FSM S is separable with state p of FSM P (s p) if there exists an input sequence α s.t. α is a defined input sequence at both states s and p and out S (s, α) out P (p, α) = Initialized FSMs S and P are separable (S P) if their initial states are separable, i.e., there exists an input sequence α s.t. α is a defined input sequence for both FSMs and out S (s 1, α) out P (p 1, α) = α is a separating sequence of states s and p (FSMs S and P)! If states s and p (initialized FSMs S and P) are compatible or one of them is a quasi-reduction of the other then such states (such FSMs) are not separable! Two separable FSMs can be distinguished by external experiment without all weather conditions assumption Verona University 30
31 Example of separable FSMs Separable FSMs A shortest separating sequence is x 1 x 2 x 2 x 1 x 2 mn = 4 and a separating sequence has length 5 FSM S FSM P! Please check whether x 1 x 2 x 2 x 1 x 2 is a shortest separating sequence Verona University 31
32 Separating two complete initialized FSMs Theorem 4.4 Given complete initialized FSMs S and P, if their intersection is a complete FSM then S and P are not separable It is much more complex to check whether two FSMs with known transition relations are separable comparable to former relations! Usually is used for testing as does need all weather conditions assumption Verona University 32
33 Deriving a separating sequence for two initialized FSMs Input: Two complete initialized FSMs S and P Output: An input sequence that separates FSMs S and P (if FSMs S and P are separable) Step 1. Derive the intersection S P If is complete then FSMs S and P are non-separable END Step 2. Derive a truncated successor tree of S P where the root is labeled with the initial state of the intersection and the nodes are labeled with subsets of states of S P Successor tree of S i-successor K s 1 p 1 i-successor of K contains each state of S P that can be reached from some pair of K when i is applied with the same output Verona University 33
34 Termination rules for node with label P Termination rule 1 There exists an input i s.t. i separates states of each pair of the subset K are separable Termination rule 2 There exists a node at a j th level, j < k, labeled with the subset R s.t. K R a shortest separating sequence cannot be derived using this path Verona University 34
35 Deriving a separating sequence Theorem 4.5 If none of the paths of the truncated tree is terminated using Rule 1 then FSMs S and P are nonseparable Let there be a path labeled with α to a leaf node labeled with a subset s. t. each pair of states of the subset can be separated by i Then αi is a separating sequence for FSMs S and P Successor tree of S s 1 p 1 i α... P... Verona University 35
36 Example of deriving a separating sequence FSMs S and P Does a separating sequence exists? a1 x 1 X 2 (X 2 /3, ) a2,b1,b2 a1, x 1 x 2 FSM S FSM P a1 x 1 b1,b2 x 2 a1 b1 x 1 x 2 b2 Verona University 36 x 2 b1,b2
37 Upper bound on length of separating sequence The length of a shortest separating sequence can be exponential Given two FSMs S and P with n and m states, the upper bound 2 mn-1 is reachable! Algorithm is almost the same when FSMs are partial and non-observable Verona University 37
38 Separating sequences are good for testing purposes If FSMs S and P are separable the all-weather conditions assumption becomes unnecessary Apply a separating sequence and check whether an output response of an FSM under test is contained in the set of output responses of the specification FSM Suppose there is only one faulty FSM P and P is separable with the specification FSM S Separating sequence FSM S or P? o s 0 s n-1 verdict Verona University 38
39 How to check that several FSMs are separable A technique for checking whether an input sequence separates each two FSMs of a given set is almost the same! The upper bound is exponential Verona University 39
40 Non-separable states (FSMs) can still be distinguished without all weather conditions assumption Two non separable FSMs sometimes can be still distinguished without all weather conditions assumption States 1 and 3 are not separable but these states can be distinguished using an adaptive external experiment States 1 and 3 Verona University 40
41 Can we distinguish non-separable FSMs without all weather conditions assumption? Question: Given two initialized observable nonseparable FSMs S and P, can they be distinguished without all weather conditions assumption? Reply: YES iff the FSMs S and P are r-distinguishable! It may well happen that FSMs S and P cannot be distinguished by a single input sequence However, if two initialized observable FSMs S and P are not r- compatible then they can be distinguished by external adaptive experiment without all weather conditions assumption Verona University 41
42 R-distinguishable states Given complete FSM S, two states s 1 and s 2 of S are r-distinguishable (s 1 s 2 ) if for any complete FSM, the behavior of this FSM at any state is not contained in the behavior of S at state s 1 and at state s 2 Generally, two states s 1 and s 2 of S are r- distinguishable if they do not have common quasi-reduction!r-distinguishable states can be distinguished by an adaptive distinguishing experiment Verona University 42
43 R-distinguishable states of FSM cannot correspond to the same state of its quasi-reduction It cannot happen that FSM B is a quasi-reduction of S and states 1 and 3 correspond to one and the same state of B! If FSM B is a quasireduction of S then there cannot exist two input/output sequences of B that take the intersection B S to states b1 and b3 correspondingly FSM S Verona University 43
44 How to check if two states are r-distinguishable Given observable FSM S and state s of S S/s is the initialized FSM S with the initial state s Theorem 4.7 States s 1 and s 2 of a complete observable FSM S are r-distinguishable if and only if the intersection S/s 1 S/s 2 has no complete submachine Application: when deriving tests w.r.t. the reduction relation Verona University 44
45 How to check if two initialized complete observable FSMs are r- compatible Input: initialized complete observable FSMs S and P Output: an appropriate message Derive the intersection S P Derive the largest complete submachine of the intersection S P If there exists the largest complete submachine of the intersection S P then produce the message FSMs are r-compatible If the largest complete submachine of the intersection S P does not exist then produce the message FSMs are not r-compatible!still a question remains how to distinguish r-distinguishable FSMs by external experiment, i.e., which inputs to apply? Verona University 45
46 k-discriminative states Observable complete FSM S S/s 1 S/s 2 = <Q, I, O, T, s 1 s 2 > state q Q is 1-discriminative if there exists input i I such that there is no transition (q, i, o, q ) T for any pair (o, q ) O Q given k > 1, state q Q is k-discriminative if state q is (k - 1)-discriminative or there exists input i I such that for each transition (q, i, o, q ) T state q is (k - 1)-discriminative Verona University 46
47 Example of 2- discriminative states FSM S, states 1 and 3 States 1 and 3 are 2- discriminative b/0 a/1 1 2 a/0 c/1 b/1 a,c/0 a/0 c/1 b/1 32 a/0 13 a/1 24 b/0 3 a/1 a,c/1 4 c/1 States 1 and 2, 1 and 4, 2 and 3, 2 and 4, 3 and 4 are 1-discriminative states!they can be separated by a single input Verona University 47
48 R-distinguishing FSM R-distinguishing (distinguishing) FSM over input alphabet I and output alphabet O is an observable FSM R (S,P) = (R, I, O, T R, r 0 ) that has two designated states S and P such that R (S,P) is an acyclic FSM States S, P are deadlock states If r { S, P } then only one input i is defined at state r with all possible outputs, i.e., out R (t, i) = O Verona University 48
49 Representing adaptive experiment by distinguishing FSM Given r-distinguishable FSMs S and P, r- distinguishing FSM R (S,P) distinguishes FSMs S and P if when intersecting R (S,P) and S state P is never reached and when intersecting R (S,P) and P state S is never reached! If after the experiment state S ( P ) is reached then FSM S (P) is under experiment Verona University 49
50 Separating sequences are good for testing purposes Distinguishing FSM R (S,P) for FSMs S and P b/0 a/0 b/1 S p 1 s 1 a/1 a/0 a/1 P Suppose there is only one faulty FSM P and P is r- distinguishable with the specification FSM S I FSM S or P? o s 0 s n-1 Distinguishing FSM R (S,P) verdict Verona University 50
51 Deriving distinguishable FSM for r-distinguishable observable FSMs Initialized FSMs S and P are r-distinguishable if they do not have common quasireduction Algorithm for deriving a distinguishing FSM for complete observable FSMs S and P Input: Complete observable FSMs S and P Output: A distinguishing FSM for FSMs S and P (if FSMs S and P are r- distinguishable) Derive the intersection S P If the intersection is complete then FSMs S and P are not r-distinguishable; END Otherwise, for each k-discriminative state q Q, determine input i q I such that there is no transition (q, i q, o, q ) all (o, q ) O Q (k = 1) or for each transition (q, i q, o, q ) state q is (k - 1)-discriminative (k > 1) for each k-discriminative state q and i q, delete from Q each transition (q, i, o, q ), i i q, add a transition (q, i q, o, r s1 ) if o out S (s 1, i q ) and (q, i q, o, r s2 ) if o out S (p 1, i q ) A distinguishing machine is a submachine of the obtained FSM with the smallest set of states which are reachable from q = (s 1, p 1 ) Verona University 51
52 Representing adaptive experiment as an FSM b/0 FSM S with different initial states 1 and 3 b/0 a,c/0 a/ c/1 a/0 a/1 a,c/1 c/1 b/1 4 a/0 b/1 c/1 A distinguishing FSM R (S,P) for FSMs S = S/1 and P = S/3 23 b/0 a/0 b/1 S/1 13 a/1 a/0 a/1 S/3 24 Verona University 52
53 Complexity of distinguishing r- distinguishable states (FSMs) Theorem 4.8 For two r-distinguishable states of an observable FSM with n states a distinguishing FSM has at most n 2 states and n 2 O transitions Only one sequence is applied during the adaptive experiment Its length is at most n 2 Application: FSM testing w.r.t. the reduction relation, w.r.t. r-compatibility relation Verona University 53
54 Complexity of distinguishing two observable FSMs Theorem 4.9 For two r-distinguishable observable FSMs with n and m states a distinguishing FSM has at most nm states and nm O transitions Only one sequence is applied during the adaptive experiment Its length is at most nm Verona University 54
55 Distinguishing several FSM by an adaptive experiment Only started this research Seems that we have to consider subsets of states the upper bound can be exponential Verona University 55
56 The relationship between various external distinguishability relations for complete FSMs For non-deterministic FSMs For deterministic FSMs = = = - r-distinguishability - separability - non-reduction - trace distinguishable r- distinguishability separability Non-reduction trace distinguishability Verona University 56
57 For verification issues internal distinguishability relations can be used When transition relations of Spec and Imp are known Homomorphism and isomorphism can be checked Simulation and bisimulation relations can be checked s-distinguishability relation Verona University 57
58 Nowadays applications 1. Test derivation for telecommunication protocols 2. Discrete event system verification 3. Software testing and verification 4. Verona University 58
59 Conclusions Distinguishability relations between nondeterministic FSMs have been considered 1. The all weather conditions assumption used when testing nondeterministic implementations does not seem to be very realistic Question what kind of checking can be guaranteed without this assumption? 2. Many upper bounds are exponential when evaluating the complexity of checking external distinguishability relations However we need at least to know what can be checked and at what price 3. There are other distinguishability relations between non-deterministic FSMs (refusal relation, for example) which need additional research Applications: analysis and synthesis of discrete event systems Verona University 59
60 References 1. Starke P.H. Abstract Automata, Elsevier, T. Kam, T. Villa, R. Brayton, A. Sangiovanni- Vincentelli, Synthesis of FSMs: functional optimization, Kluwer Academic Publishers, N.Yevtushenko, A.Petrenko, M.Vetrova, S.Tihkomirova, Nondeterministic FSMs: Analysis and synthesis: Parts 1 and 2, Tomsk State University Publishers, 2006, 2010 (in Russian) Verona University 60
61 Thanks for your attention! Verona University 61
DISTINGUING 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 informationDescribing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata Natalia Kushik and Nina Yevtushenko Tomsk State University, Russia 2 Motivation Relies
More informationDIAGNOSING MULTIPLE FAULTS IN COMMUNICATING FINITE STATE MACHINES
DIAGNOSING MULTIPLE FAULTS IN COMMUNICATING FINITE STATE MACHINES Khaled El-Fakih+, Nina Yevtushenko++ and Gregor v. Bochmann+ +School of Information Technology and Engineering,University of Ottawa, ON,
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 informationFSM Based Interoperability Testing Methods for Multi Stimuli Model
FSM Based Interoperability Testing Methods for Multi Stimuli Model Khaled El-Fakih 1, Vadim Trenkaev 2, Natalia Spitsyna 2, Nina Yevtushenko 2 1 American University of Sharjah, PO Box 26666, Sharjah, United
More informationTesting Distributed Systems
Testing Distributed Systems R. M. Hierons Brunel University, UK rob.hierons@brunel.ac.uk http://people.brunel.ac.uk/~csstrmh Work With Jessica Chen Mercedes Merayo Manuel Nunez Hasan Ural Model Based Testing
More informationComparing State Machines: Equivalence and Refinement
Chapter 14 Comparing State Machines: Equivalence and Refinement Hongwei Zhang http://www.cs.wayne.edu/~hzhang/ Ack.: this lecture is prepared in part based on slides of Lee, Sangiovanni-Vincentelli, Seshia.
More informationModel-Based Testing: Testing from Finite State Machines
Model-Based Testing: Testing from Finite State Machines Mohammad Mousavi University of Leicester, UK IPM Summer School 2017 Mousavi FSM-Based Testing IPM 2017 1 / 64 Finite State Machines Outline 1 Finite
More informationA General Testability Theory: Classes, properties, complexity, and testing reductions
A General Testability Theory: Classes, properties, complexity, and testing reductions presenting joint work with Luis Llana and Pablo Rabanal Universidad Complutense de Madrid PROMETIDOS-CM WINTER SCHOOL
More informationEmbedded systems specification and design
Embedded systems specification and design David Kendall David Kendall Embedded systems specification and design 1 / 21 Introduction Finite state machines (FSM) FSMs and Labelled Transition Systems FSMs
More informationFoundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
More informationPRINCIPLES AND METHODS OF TESTING FINITE STATE MACHINES A SURVEY. David Lee. Mihalis Yannakakis. AT&T Bell Laboratories Murray Hill, New Jersey
PRINCIPLES AND METHODS OF TESTING FINITE STATE MACHINES A SURVEY David Lee Mihalis Yannakakis AT&T Bell Laboratories Murray Hill, New Jersey ABSTRACT With advanced computer technology, systems are getting
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 informationTesting from a Finite State Machine: An introduction 1
Testing from a Finite State Machine: An introduction 1 The use of Finite State Machines (FSM) to model systems has lead to much interest in deriving tests from them. Having derived a test sequence from
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 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 informationDeterministic Timed Finite State Machines: Equivalence Checking and Expressive Power
Deterministic Timed Finite State Machines: Equivalence Checking and Expressive Power Davide Bresolin University of Bologna Bologna, Italy davide.bresolin@unibo.it Khaled El-Fakih American University of
More informationOverview. Discrete Event Systems Verification of Finite Automata. What can finite automata be used for? What can finite automata be used for?
Computer Engineering and Networks Overview Discrete Event Systems Verification of Finite Automata Lothar Thiele Introduction Binary Decision Diagrams Representation of Boolean Functions Comparing two circuits
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
More informationUsing a Minimal Number of Resets when Testing from a Finite State Machine
Using a Minimal Number of Resets when Testing from a Finite State Machine R. M. Hierons a a Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UB8 3PH, United Kingdom
More informationEquivalence of Regular Expressions and FSMs
Equivalence of Regular Expressions and FSMs Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Regular Language Recall that a language
More informationFinite Automata - Deterministic Finite Automata. Deterministic Finite Automaton (DFA) (or Finite State Machine)
Finite Automata - Deterministic Finite Automata Deterministic Finite Automaton (DFA) (or Finite State Machine) M = (K, Σ, δ, s, A), where K is a finite set of states Σ is an input alphabet s K is a distinguished
More informationHoming and Synchronizing Sequences
Homing and Synchronizing Sequences Sven Sandberg Information Technology Department Uppsala University Sweden 1 Outline 1. Motivations 2. Definitions and Examples 3. Algorithms (a) Current State Uncertainty
More informationA framework based on implementation relations for implementing LOTOS specifications
Published in: Computer Networks and ISDN Systems, 25 (1992), 23-41 A framework based on implementation relations for implementing LOTOS specifications Guy Leduc Research Associate of the National Fund
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
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 informationPOLYNOMIAL SPACE QSAT. Games. Polynomial space cont d
T-79.5103 / Autumn 2008 Polynomial Space 1 T-79.5103 / Autumn 2008 Polynomial Space 3 POLYNOMIAL SPACE Polynomial space cont d Polynomial space-bounded computation has a variety of alternative characterizations
More informationPart V. Matchings. Matching. 19 Augmenting Paths for Matchings. 18 Bipartite Matching via Flows
Matching Input: undirected graph G = (V, E). M E is a matching if each node appears in at most one Part V edge in M. Maximum Matching: find a matching of maximum cardinality Matchings Ernst Mayr, Harald
More informationCPSC 421: Tutorial #1
CPSC 421: Tutorial #1 October 14, 2016 Set Theory. 1. Let A be an arbitrary set, and let B = {x A : x / x}. That is, B contains all sets in A that do not contain themselves: For all y, ( ) y B if and only
More informationVerification of Probabilistic Systems with Faulty Communication
Verification of Probabilistic Systems with Faulty Communication P. A. Abdulla 1, N. Bertrand 2, A. Rabinovich 3, and Ph. Schnoebelen 2 1 Uppsala University, Sweden 2 LSV, ENS de Cachan, France 3 Tel Aviv
More informationCSE 311 Lecture 23: Finite State Machines. Emina Torlak and Kevin Zatloukal
CSE 3 Lecture 3: Finite State Machines Emina Torlak and Kevin Zatloukal Topics Finite state machines (FSMs) Definition and examples. Finite state machines with output Definition and examples. Finite state
More informationFinite Universes. L is a fixed-length language if it has length n for some
Finite Universes Finite Universes When the universe is finite (e.g., the interval 0, 2 1 ), all objects can be encoded by words of the same length. A language L has length n 0 if L =, or every word of
More informationFormal Testing from Timed Finite State Machines
Formal Testing from Timed Finite State Machines Mercedes G. Merayo a, Manuel Núñez a and Ismael Rodríguez a a Departamento de Sistemas Informáticos y Computación Universidad Complutense de Madrid, E-28040
More informationData Structures in Java
Data Structures in Java Lecture 21: Introduction to NP-Completeness 12/9/2015 Daniel Bauer Algorithms and Problem Solving Purpose of algorithms: find solutions to problems. Data Structures provide ways
More informationUses of finite automata
Chapter 2 :Finite Automata 2.1 Finite Automata Automata are computational devices to solve language recognition problems. Language recognition problem is to determine whether a word belongs to a language.
More informationNODIA AND COMPANY. GATE SOLVED PAPER Computer Science Engineering Theory of Computation. Copyright By NODIA & COMPANY
No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical, photocopying, or otherwise without the prior permission of the author. GATE SOLVED PAPER Computer
More informationSchool of Information Technology and Engineering University of Ottawa Ottawa, Canada
Using Adaptive Distinguishing Sequences in Checking Sequence Constructions Robert M. Hierons Guy-Vincent Jourdan Hasan Ural Husnu Yenigun School of Information Systems, Computing and Mathematics Brunel
More informationAutomata-Theoretic Model Checking of Reactive Systems
Automata-Theoretic Model Checking of Reactive Systems Radu Iosif Verimag/CNRS (Grenoble, France) Thanks to Tom Henzinger (IST, Austria), Barbara Jobstmann (CNRS, Grenoble) and Doron Peled (Bar-Ilan University,
More informationSection 1 (closed-book) Total points 30
CS 454 Theory of Computation Fall 2011 Section 1 (closed-book) Total points 30 1. Which of the following are true? (a) a PDA can always be converted to an equivalent PDA that at each step pops or pushes
More informationProperty Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms
Property Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms Wen-ling Huang and Jan Peleska University of Bremen {huang,jp}@cs.uni-bremen.de MBT-Paradigm Model Is a partial
More informationOur Problem. Model. Clock Synchronization. Global Predicate Detection and Event Ordering
Our Problem Global Predicate Detection and Event Ordering To compute predicates over the state of a distributed application Model Clock Synchronization Message passing No failures Two possible timing assumptions:
More informationSimplification of finite automata
Simplification of finite automata Lorenzo Clemente (University of Warsaw) based on joint work with Richard Mayr (University of Edinburgh) Warsaw, November 2016 Nondeterministic finite automata We consider
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
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 informationClasses and conversions
Classes and conversions Regular expressions Syntax: r = ε a r r r + r r Semantics: The language L r of a regular expression r is inductively defined as follows: L =, L ε = {ε}, L a = a L r r = L r L r
More informationExplicit State Model Checking Algorithm for CTL. CSE 814 CTL Explicit-State Model Checking Algorithm
Explicit State Model Checking for CTL 1 CTL Model Checking Problem Given A model describing the behaviors of a system A set of specifications expressed in CTL ically Check that every behavior satisfies
More informationTransition Predicate Abstraction and Fair Termination
Transition Predicate Abstraction and Fair Termination Andreas Podelski and Andrey Rybalchenko Max-Planck-Institut für Informatik Saarbrücken, Germany POPL 2005 ETH Zürich Can Ali Akgül 2009 Introduction
More informationSFM-11:CONNECT Summer School, Bertinoro, June 2011
SFM-:CONNECT Summer School, Bertinoro, June 20 EU-FP7: CONNECT LSCITS/PSS VERIWARE Part 3 Markov decision processes Overview Lectures and 2: Introduction 2 Discrete-time Markov chains 3 Markov decision
More informationA Compositional Approach to Bisimulation of Arenas of Finite State Machines
A Compositional Approach to Bisimulation of Arenas of Finite State Machines Giordano Pola, Maria D. Di Benedetto and Elena De Santis Department of Electrical and Information Engineering, Center of Excellence
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 informationTheory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 3: Finite State Automata Motivation In the previous lecture we learned how to formalize
More informationAntichain Algorithms for Finite Automata
Antichain Algorithms for Finite Automata Laurent Doyen 1 and Jean-François Raskin 2 1 LSV, ENS Cachan & CNRS, France 2 U.L.B., Université Libre de Bruxelles, Belgium Abstract. We present a general theory
More informationFinite-State Machines (Automata) lecture 12
Finite-State Machines (Automata) lecture 12 cl a simple form of computation used widely one way to find patterns 1 A current D B A B C D B C D A C next 2 Application Fields Industry real-time control,
More informationSanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Explicit-State Model Checking: Additional Material Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: G. Holzmann Checking if M satisfies : Steps 1. Compute Buchi
More informationThe Pumping Lemma. for all n 0, u 1 v n u 2 L (i.e. u 1 u 2 L, u 1 vu 2 L [but we knew that anyway], u 1 vvu 2 L, u 1 vvvu 2 L, etc.
The Pumping Lemma For every regular language L, there is a number l 1 satisfying the pumping lemma property: All w L with w l can be expressed as a concatenation of three strings, w = u 1 vu 2, where u
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 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 informationCS5371 Theory of Computation. Lecture 9: Automata Theory VII (Pumping Lemma, Non-CFL, DPDA PDA)
CS5371 Theory of Computation Lecture 9: Automata Theory VII (Pumping Lemma, Non-CFL, DPDA PDA) Objectives Introduce the Pumping Lemma for CFL Show that some languages are non- CFL Discuss the DPDA, which
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationTesting for Refinement in CSP
Author manuscript, published in "Formal Methods and Software Engineering, ICFEM 2007, Boca-Raton : United States (2007)" Testing for Refinement in CSP Ana Cavalcanti 1 and Marie-Claude Gaudel 2 1 University
More informationEinführung in die Computerlinguistik
Einführung in die Computerlinguistik Context-Free Grammars (CFG) Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2016 1 / 22 CFG (1) Example: Grammar G telescope : Productions: S NP VP NP
More informationPeter Wood. Department of Computer Science and Information Systems Birkbeck, University of London Automata and Formal Languages
and and Department of Computer Science and Information Systems Birkbeck, University of London ptw@dcs.bbk.ac.uk Outline and Doing and analysing problems/languages computability/solvability/decidability
More informationLecture 2 Automata Theory
Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray Outline: Transition systems Linear-time properties Regular propereties EECI, 14 May 2012 This short-course is on this picture applied
More informationIterative minimization of partial Finite State Machines
Cent. Eur. J. Comp. Sci. 3(2) 2013 91-103 DOI: 10.2478/s13537-013-0106-0 Central European Journal of Computer Science Iterative minimization of partial Finite State Machines Research Article Alex D.B.
More informationhal , version 1-10 Sep 2013
Verification of Modular Systems with Unknown Components Combining Testing and Inference Roland Groz 1, Keqin Li 2, Alexandre Petrenko 3 1 Université de Grenoble, LIG Lab, France. Roland.Groz@imag.fr 2
More information6.045 Final Exam Solutions
6.045J/18.400J: Automata, Computability and Complexity Prof. Nancy Lynch, Nati Srebro 6.045 Final Exam Solutions May 18, 2004 Susan Hohenberger Name: Please write your name on each page. This exam is open
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata COMP2600 Formal Methods for Software Engineering Katya Lebedeva Australian National University Semester 2, 206 Slides by Katya Lebedeva. COMP 2600 Nondeterministic Finite
More informationMore on NP and Reductions
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data
More informationCSE 311: Foundations of Computing. Lecture 23: Finite State Machine Minimization & NFAs
CSE : Foundations of Computing Lecture : Finite State Machine Minimization & NFAs State Minimization Many different FSMs (DFAs) for the same problem Take a given FSM and try to reduce its state set by
More informationSynthesis from Probabilistic Components
Synthesis from Probabilistic Components Yoad Lustig, Sumit Nain, and Moshe Y. Vardi Department of Computer Science Rice University, Houston, TX 77005, USA yoad.lustig@gmail.com, nain@cs.rice.edu, vardi@cs.rice.edu
More informationThe priority promotion approach to parity games
The priority promotion approach to parity games Massimo Benerecetti 1, Daniele Dell Erba 1, and Fabio Mogavero 2 1 Università degli Studi di Napoli Federico II 2 Università degli Studi di Verona Abstract.
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 5 CHAPTER 2 FINITE AUTOMATA 1. Deterministic Finite Automata DFA 2. Nondeterministic Finite Automata NDFA 3. Finite Automata
More informationBinary decision diagrams for security protocols
for Instytut Informatyki Teoretycznej i Stosowanej Politechnika Częstochowska 4 czerwca 2012 roku 1 2 3 4 Infrastructure with Intruder Threat template 5 References BDD definition Definition An BDD G
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationLecture 2 Automata Theory
Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray EECI, 18 March 2013 Outline Modeling (discrete) concurrent systems: transition systems, concurrency and interleaving Linear-time
More informationFormal Models in NLP
Formal Models in NLP Finite-State Automata Nina Seemann Universität Stuttgart Institut für Maschinelle Sprachverarbeitung Pfaffenwaldring 5b 70569 Stuttgart May 15, 2012 Nina Seemann (IMS) Formal Models
More informationThis lecture covers Chapter 7 of HMU: Properties of CFLs
This lecture covers Chapter 7 of HMU: Properties of CFLs Chomsky Normal Form Pumping Lemma for CFs Closure Properties of CFLs Decision Properties of CFLs Additional Reading: Chapter 7 of HMU. Chomsky Normal
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationChapter Two: Finite Automata
Chapter Two: Finite Automata In theoretical computer science, automata theory is the study of abstract machines (or more appropriately, abstract 'mathematical' machines or systems) and the computational
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
More informationIntelligent Agents. Formal Characteristics of Planning. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University
Intelligent Agents Formal Characteristics of Planning Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University Extensions to the slides for chapter 3 of Dana Nau with contributions by
More informationKruskal s Theorem Rebecca Robinson May 29, 2007
Kruskal s Theorem Rebecca Robinson May 29, 2007 Kruskal s Theorem Rebecca Robinson 1 Quasi-ordered set A set Q together with a relation is quasi-ordered if is: reflexive (a a); and transitive (a b c a
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 informationThe purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational
1 The purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational model. We'll remind you what a Turing machine is --- you
More informationReduced Ordered Binary Decision Diagrams
Reduced Ordered Binary Decision Diagrams Lecture #12 of Advanced Model Checking Joost-Pieter Katoen Lehrstuhl 2: Software Modeling & Verification E-mail: katoen@cs.rwth-aachen.de December 13, 2016 c JPK
More informationSTGs may contain redundant states, i.e. states whose. State minimization is the transformation of a given
Completely Specied Machines STGs may contain redundant states, i.e. states whose function can be accomplished by other states. State minimization is the transformation of a given machine into an equivalent
More informationFinite Automata. BİL405 - Automata Theory and Formal Languages 1
Finite Automata BİL405 - Automata Theory and Formal Languages 1 Deterministic Finite Automata (DFA) A Deterministic Finite Automata (DFA) is a quintuple A = (Q,,, q 0, F) 1. Q is a finite set of states
More informationFinite-State Model Checking
EECS 219C: Computer-Aided Verification Intro. to Model Checking: Models and Properties Sanjit A. Seshia EECS, UC Berkeley Finite-State Model Checking G(p X q) Temporal logic q p FSM Model Checker Yes,
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 informationPDF hosted at the Radboud Repository of the Radboud University Nijmegen
PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a preprint version which may differ from the publisher's version. For additional information about this
More informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
More informationTheory of Computation 4 Non-Deterministic Finite Automata
Theory of Computation 4 Non-Deterministic Finite Automata Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Theory of Computation
More information2. Elements of the Theory of Computation, Lewis and Papadimitrou,
Introduction Finite Automata DFA, regular languages Nondeterminism, NFA, subset construction Regular Epressions Synta, Semantics Relationship to regular languages Properties of regular languages Pumping
More informationReview of Complexity Theory
Review of Complexity Theory Breno de Medeiros Department of Computer Science Florida State University Review of Complexity Theory p.1 Turing Machines A traditional way to model a computer mathematically
More informationBisimulation, the Supervisory Control Problem and Strong Model Matching for Finite State Machines
Discrete Event Dynamic Systems: Theory and Applications, 8, 377 429 (1998) c 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Bisimulation, the Supervisory Control Problem and
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 informationClosure Properties of Regular Languages. Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism
Closure Properties of Regular Languages Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism Closure Properties Recall a closure property is a statement
More informationSymmetry Reductions. A. Prasad Sistla University Of Illinois at Chicago
Symmetry Reductions. A. Prasad Sistla University Of Illinois at Chicago Model-Checking Concurrent PGM Temporal SPEC Model Checker Yes/No Counter Example Approach Build the global state graph Algorithm
More information