#### DMCA

## The Tool KRONOS (1996)

### Cached

### Download Links

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

### Other Repositories/Bibliography

Venue: | In Proc. of Hybrid Systems III, LNCS 1066 |

Citations: | 268 - 39 self |

### Citations

2645 | D.: A Theory of Timed Automata
- Alur, Dill
- 1994
(Show Context)
Citation Context ...France. 1 Introduction Kronos [6, 8] is a tool developed with the aim to assist the user to validate complex real-time systems. The tool checks whether a real-time system modeled by a timed automaton =-=[4]-=- satisfies a timing property specified by a formula of the temporal logic Tctl [3]. Kronos implements the symbolic model-checking algorithm presented in [11], where set of states are symbolically repr... |

576 | Symbolic model checking for real-time systems
- Henzinger, Nicollin, et al.
- 1994
(Show Context)
Citation Context ...al-time system modeled by a timed automaton [4] satisfies a timing property specified by a formula of the temporal logic Tctl [3]. Kronos implements the symbolic model-checking algorithm presented in =-=[11]-=-, where set of states are symbolically represented by linear constraints over the clocks of the timed automaton. In this work we present two other verification approaches we have recently implemented ... |

89 |
Model checking in dense real time
- Alur, Courcoubetis, et al.
- 1993
(Show Context)
Citation Context ...Gamma := fB 2 \Pi init j B " I 6= ;g ; \Delta := ; ; while (9B 2 \Gamma n \Delta) do f CB := Split(B; \Pi) ; (1) if (CB = fBg) then f (2) \Delta := \Delta [ fBg ; \Gamma := \Gamma [ Succs l \Pi (=-=B) ; (3) g else f -=-(4) \Gamma := \Gamma n fBg ; \Pi := (\Pi n fBg) [ CB ; \Delta := \Delta n P reds l \Pi (B) ; (5) if B " I 6= ; then \Gamma := \Gamma [ fC 2 CB ; j C " I 6= ;g ; g g where \Gamma is the set o... |

71 | Compositional and symbolic model-checking of real-time systems
- Larsen, Pettersson, et al.
- 1995
(Show Context)
Citation Context ...information on how to obtain the tool, please contact the authors. We stress the fact that Fischer's protocol has been analyzed many times, using other real--time verification tools, in particular in =-=[2, 13]-=-. None of these two analyses, however, deals with starvation, while the versions of the protocol used are simpler. Finally, both forward analysis and minimization prove helpful not only for verificati... |

67 | Two examples of verification of multirate timed automata with KRONOS - Daws, Yovine - 1995 |

61 | An implementation of three algorithms for timing verification based on automata emptiness
- Alur, Courcoubefis, et al.
- 1992
(Show Context)
Citation Context ...eneration algorithm given in [5]. In the next section we show that testing our algorithm on the Fischer's mutual exclusion protocol reveals more efficient than the minimization algorithm developed in =-=[2]-=-. automaton formula backward forward eval #sta #loc #arcs #clocks time iter time symb 3 19 25 7 (1) 0.50 9 0.15 20 true (2) 25 29 6 1018 true 4 25 33 9 (1) 2.50 12 0.30 44 true (2) 3680 47 66 5522 tru... |

49 | Verifying ET-LOTOS programs with KRONOS - Daws, Olivero, et al. - 1994 |

44 |
An old-fashioned recipe for realtime.
- Abadi, Lamport
- 1991
(Show Context)
Citation Context ...nos, and in section 4 we apply this method for verifying the FDDI protocol [12]. In section 5 we present the minimization algorithm and in section 6 we analyze the Fischer's mutual exclusion protocol =-=[1]-=-. ? In DIMACS Workshop on Verification and Control of Hybrid Systems, October 1995. Lecture Notes in Computer Science 1066, Springer-Verlag. ?? E-mail: fConrado.Daws,Stavros.Tripakis,Sergio.Yovineg@im... |

30 | Minimal state graph generation
- Bouajjani, Fernandez, et al.
- 1992
(Show Context)
Citation Context ...ed for simulations(symb). 5 Minimization We briefly present in this section the main ideas of the algorithm developed in [15] which is an adaptation of the minimal model generation algorithm given in =-=[5]-=-. In the next section we show that testing our algorithm on the Fischer's mutual exclusion protocol reveals more efficient than the minimization algorithm developed in [2]. automaton formula backward ... |

28 | Analysis of timed systems based on time{abstracting bisimulations
- Tripakis, Yovine
- 1996
(Show Context)
Citation Context ...me symbolic representation of the state space. The emphasis is given in illustrating the interest of the two approaches rather than thoroughly presenting their technical details which can be found in =-=[15, 7]-=-. Forward analysis is based on the symbolic simulation of a timed automaton. By computing the set of all possible runs, starting from some given set of initial states, we can verify some interesting t... |

26 |
FDDI Handbook: High-Speed Networking Using Fiber And Other
- Jain
- 1994
(Show Context)
Citation Context ...e review timed automata. In section 3 we present the basis of symbolic forward analysis and the algorithms implemented in Kronos, and in section 4 we apply this method for verifying the FDDI protocol =-=[12]-=-. In section 5 we present the minimization algorithm and in section 6 we analyze the Fischer's mutual exclusion protocol [1]. ? In DIMACS Workshop on Verification and Control of Hybrid Systems, Octobe... |

7 |
A tool set for deciding behavioural equivalences
- Fernandez, Mounier
- 1991
(Show Context)
Citation Context ... setX02 Fig. 2. Fischer's mutual--exclusion protocol specification with TA the labels; and (3) we further reduce the resulting graph with respect to the a bisimulation (sa ), using the tool Aldebaran =-=[9]-=-. Performance results 6 are shown in table 2. Gmin denotes the minimal model, and Gsa its reduction with respect tosa . For each n, two versions of the protocol are tested : a correct one, for \Delta ... |

7 |
Modélisation et analyse de systémes temporisés et hybrides
- Olivero
- 1994
(Show Context)
Citation Context ...as a time transition to (s; v + t), denoted (s; v) ! ; t (s; v + t), if for all t 0st, v + t 0 2 I s . 5 The usual definition of timed automata only allows resetting clocks to 0. It has been shown in =-=[14]-=- that assignments of clock values does not affect decidability. 3 The forward analysis The forward analysis verification technique is based on the computation of the symbolic runs from a given set of ... |

1 |
Symbolic forward analysis of timed automata
- Daws, Yovine
- 1995
(Show Context)
Citation Context ...me symbolic representation of the state space. The emphasis is given in illustrating the interest of the two approaches rather than thoroughly presenting their technical details which can be found in =-=[15, 7]-=-. Forward analysis is based on the symbolic simulation of a timed automaton. By computing the set of all possible runs, starting from some given set of initial states, we can verify some interesting t... |

1 |
Binary coded graphs --- reference manuals of the bcg tools
- Garavel, Mateescu, et al.
- 1995
(Show Context)
Citation Context ...ow only the time taken for minimization. The reduction with respect tosa takes negligible time, except in the case marked y, where aldebaran needs 23 secs. 7 This figure has been produced by bcg draw =-=[10]-=-, a tool for displaying graphs, included in the Aldebaran package. 8 [2] have used a DEC-5100 with 40 Mbytes of main memory. 2 0 1 setX02 enter_1 setX01 enter_2 6 5 0 2 1 3 4 enter_1 enter_2 setX02 en... |

1 |
An implementation of three algorithms for timing verification based on automata emptiness
- Halbwachs, Wong-Toi
- 1992
(Show Context)
Citation Context ...neration algorithm given in [5]. In the next section we show that. testing our algorithm on the Fischer's mutual exclusion protocol reveals more efficient than the minimization algorithm developed in =-=[2]-=-.214 automaton ~ormula! backward Jorward eval #sta #1oc]#arcsl#clocks time iter time symb 3 19 25 7 (1) 0.50 9 0.15 20 true (2) 25 29 6 1018true 4 25 33 9 (1) 2.50 12 0.30 44true (2) 3680 47 66 5522t... |

1 |
C.Ratel. Minimal state graph generation
- Halbwachs, Raymond
- 1992
(Show Context)
Citation Context ...ed for sinmlation (symb). 5 Minimization We briefly present in this section the main ideas of the algorithm developed in [15] which is an adaptation of the minimal model generation algorithm given in =-=[5]-=-. In the next section we show that. testing our algorithm on the Fischer's mutual exclusion protocol reveals more efficient than the minimization algorithm developed in [2].214 automaton ~ormula! bac... |

1 | Verifying ET-LOTOS programs with I,:RONOS - Olivero, Yovine - 1994 |

1 |
Symbolic model checking for real-time systems
- Sifakis, Yovine
- 1994
(Show Context)
Citation Context ...l-tinae system modeled by a timed automaton [4] satisfies a timing property specified by a formula of the temporal logic TCTL [3]. KRONOS implements the symbolic model-checking algorithm presented in =-=[11]-=-, where set of states are symbolically represented by linear constraints over the clocks of the timed automaton. In this work we present two other verification approaches we have recently implemented ... |

1 |
Compositional and symbolic modelchecking of real-time systems
- Wang
(Show Context)
Citation Context ...ormation on how to obtain the tool, please contact the authors.219 We stress the fact that Fischer's protocol has been analyzed many times. using other real-time verification tools, in particular in =-=[2, 13]-=-. None of these two analyses, however, deals with starvation, while the versions of the protocol used are simpler. Finally, both forward analysis and minimization prove helpful not only for verificati... |

1 |
Mod61isation et analyse de syst~mes temporis6s et hybrides. Th6se. Institut National Polytechnique de
- Ohvero
- 1994
(Show Context)
Citation Context ...has a time transition to (s., v + t), denoted (s, v) --~ (s, v + t). if for all t t _< t, v + t' E I,. 4 The usual definition of timed automata only allows resetting clocks to 0. It has been shown in =-=[14]-=- that assignments of clock values does not affect decidability.210 3 The forward analysis The forward analysis verification technique is based on the computation of the symbolic runs from a given set... |