#### DMCA

## State identification problems for timed automata (2005)

### Cached

### Download Links

- [www-verimag.imag.fr]
- [www-verimag.imag.fr]
- [www-verimag.imag.fr]
- [www-verimag.imag.fr]
- DBLP

### Other Repositories/Bibliography

Venue: | Proc. of the 17th IFIP Int’l Conf. on Testing of Communicating Systems (TestCom 2005). LNCS 3502 |

Citations: | 6 - 2 self |

### Citations

2619 | The theory of timed automata
- Alur, Dill
- 1991
(Show Context)
Citation Context ...produced with variable delays governed by complex timing constraints. In this paper, we study state identification (in particular, distinguishing and homing) problems in the context of timed automata =-=[2]-=-. The latter have been recognized as a useful model for real-time systems. Although some work has been done for this model on problems of conformance testing (e.g., see references in [7]) we are not a... |

331 | Principles and Methods of Testing Finite State Machines - A Survey
- Lee, Yannakakis
- 1996
(Show Context)
Citation Context ...ad the machine to a given state (synchronizing experiments), etc. An extensive theory is available on state identification problems for finitestate machine models such as Mealy or Moore machines (see =-=[8]-=- for an excellent survey). These models are well-suited for some applications (e.g., synchronous circuits) but not for others. In particular, the assumption that inputs and outputs are synchronous mak... |

270 | The tool Kronos
- Daws, Olivero, et al.
- 1995
(Show Context)
Citation Context ... the region graph [2] but this is obviously to be avoided if we want our method to be tractable. An alternative is to use the forward reachability graph used in TA model-checking tools such as Kronos =-=[4]-=-. Unfortunately, this graph does not have the necessary properties for testing a purposes. In particular, it is not pre-stable, that is, if S1 → S2 is a transition in the abstract graph then there mig... |

202 |
Gedanken-Experiments on Sequential Machines”, in
- Moore
- 1956
(Show Context)
Citation Context ... to different classes of testing problems, for instance, conformance testing or performance testing. A particularly interesting class of testing problems, pioneered in the seminal 1956 paper of Moore =-=[9]-=-, is state identification. We are given a machine with known state-transition diagram but unknown initial state. We are asked to perform an experiment in order to, either find the unknown initial stat... |

83 | Modeling urgency in timed systems
- Bornot, Sifakis, et al.
(Show Context)
Citation Context ...r and gives some directions for future work.s2 The model The basic model is timed automata with inputs and outputs (TAIO) as defined in [7]. These are timed automata with deadlines to capture urgency =-=[10, 3]-=- and edges labeled by an input action in a finite set Actin = {a, b, · · ·}, an output action in a finite set Actout = {v, w, · · ·} or an unobservable action τ �∈ Actin ∪ Actout. Let R be the set of ... |

73 | Black-box conformance testing for real-time systems
- Krichen, Tripakis
(Show Context)
Citation Context ...imed automata [2]. The latter have been recognized as a useful model for real-time systems. Although some work has been done for this model on problems of conformance testing (e.g., see references in =-=[7]-=-) we are not aware of any previous work on problems of state identification in a real-time setting. Since timed automata (TA) are based on a dense-time semantics, the first choice to make when dealing... |

71 | Analysis of timed systems using time-abstracting bisimulations
- Tripakis, Yovine
- 2001
(Show Context)
Citation Context ...abstract state S1 then the abstract system will move to S2; however, the concrete system is not guaranteed to do so. Our choice is, then, to use the time-abstracting bisimulation (TAB) quotient graph =-=[11]-=-. This graph has the same properties as the region graph (in particular, pre-stability) and is typically much smaller than the latter. Thus, it presents a good compromise between property preservation... |

45 | Distinguishing tests for nondeterministic and probabilistic machines
- Alur, Courcoubetis, et al.
- 1995
(Show Context)
Citation Context ... tester because of its digital clock. The last step consists in transforming G into a non-deterministic Mealy machine M, on which state-identification problems can be solved using existing techniques =-=[1]-=-. This is an original, to our knowledge, transformation technique which is general enough to be used for any finite LTS provided it satisfies some properties on boundedness of number of outputs (see b... |

39 |
Compositional specification of timed systems
- Sifakis, Yovine
- 1996
(Show Context)
Citation Context ...r and gives some directions for future work.s2 The model The basic model is timed automata with inputs and outputs (TAIO) as defined in [7]. These are timed automata with deadlines to capture urgency =-=[10, 3]-=- and edges labeled by an input action in a finite set Actin = {a, b, · · ·}, an output action in a finite set Actout = {v, w, · · ·} or an unobservable action τ �∈ Actin ∪ Actout. Let R be the set of ... |

14 |
State-identification experiments in finite automata
- Gill
- 1961
(Show Context)
Citation Context ...occupying at the end of the experiment − the homing problem). An input/output experiment consists in applying inputs on A and observing the generated outputs. The experiment may be preset or adaptive =-=[5]-=-. 1 In a preset experiment the input sequence the tester applies is totally known in advance (before the experiment starts). In an adaptive experiment the tester is allowed to decide which inputs to a... |

9 | Learning of event-recording automata - Grinchtein, Jonsson, et al. - 2004 |