## Two examples of verification of multirate timed automata with Kronos (1995)

Venue: | In Proc. 1995 IEEE Real-Time Systems Symposium, RTSS'95 |

Citations: | 60 - 12 self |

### BibTeX

@INPROCEEDINGS{Daws95twoexamples,

author = {C. Daws and S. Yovine},

title = {Two examples of verification of multirate timed automata with Kronos},

booktitle = {In Proc. 1995 IEEE Real-Time Systems Symposium, RTSS'95},

year = {1995},

pages = {66--75},

publisher = {IEEE Computer Society Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

Multirate timed automata [2] are an extension of timed automata [3] where each clock has its own speed varying between a lower and an upper bound that may change from one control location to another. This formalism is well-suited for specifying hybrid systems where the dynamics of the continuous variables are defined or can be approximated by giving the minimal and maximal rate of change. To avoid the difficulties inherent in the verification of multirate timed automata, we follow the approach suggested in [8]. This approach consists of first transforming the multirate timed automata into timed automata and then applying the symbolic techniques implemented in Kronos. We show the practical interest of this approach analyzing two examples recently proposed in the literature and considered to be realistic case studies: the manufacturing plant of [10] and the Philips audio control protocol [4, 7]. 1 Introduction Multirate timed automata [2] are an extension of timed automata [3] where clo...

### Citations

2138 | A theory of timed automata - Alur, Dill - 1994 |

651 | The algorithmic analysis of hybrid systems
- Alur, Courcoubetis, et al.
- 1995
(Show Context)
Citation Context ... examples of verification of multirate timed automata with Kronos C. Daws and S. Yovine y VERIMAG z Miniparc-Zirst, Rue Lavoisier 38330 Montbonnot St. Martin, France Abstract Multirate timed automata =-=[2]-=- are an extension of timed automata [3] where each clock has its own speed varying between a lower and an upper bound that may change from one control location to another. This formalism is well-suite... |

507 | Symbolic Model Checking for Real-Time Systems
- Henzinger, Nicollin, et al.
- 1992
(Show Context)
Citation Context ...ce for analyzing non-trivial systems with Kronos. The paper is organized as follows. In section 2 we define the syntax and semantics of multirate timed automata. In section 3 we review the logic TCTL =-=[1, 6]-=- (Timed Computation Tree Logic) that we use to specify the real-time properties. We briefly discuss the symbolic algorithms implemented in Kronos, as well as the main results of [8]. In the last two s... |

87 |
Model checking in dense real time
- Alur, Courcoubetis, et al.
- 1993
(Show Context)
Citation Context ...ce for analyzing non-trivial systems with Kronos. The paper is organized as follows. In section 2 we define the syntax and semantics of multirate timed automata. In section 3 we review the logic TCTL =-=[1, 6]-=- (Timed Computation Tree Logic) that we use to specify the real-time properties. We briefly discuss the symbolic algorithms implemented in Kronos, as well as the main results of [8]. In the last two s... |

53 | Verification of an audio-control protocol
- Bosscher, Polak, et al.
- 1994
(Show Context)
Citation Context ...nterest of this approach analyzing two examples recently proposed in the literature and considered to be realistic case studies: the manufacturing plant of [10] and the Philips audio control protocol =-=[4, 7]-=-. 1 Introduction Multirate timed automata [2] are an extension of timed automata [3] where clocks do not advance at an uniform rate, but each clock has its own speed varying between a lower and an upp... |

51 | Decidability of hybrid systems with rectangular differential inclusions,” Computer Aided Verification
- Puri, Varaiya
- 1994
(Show Context)
Citation Context ...and 2). 4.1 Model The G-Robot (figure 4) picks up a box on the right side of the belt and deposits it on the station where boxes get serviced. middle G-STAY G-PICK ys8 G-TURN-L ys90 [15; 18] G-TURN-R =-=[9; 15]-=- ys90 G-WAIT G-PUT ys2 G-ELONG ys60 [15; 20] s-empty y := 0 y = 90 y := 0 3sys8 g-pick, y := 0 y := 0 y = 90 y := 0 y = 60 1sys2 g-put, y := 0 y := 0 Figure 4: G-Robot. The robot waits at the 40 feet ... |

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

47 | Automated Analysis of an Audio Control Protocol
- Ho, Wong-Toi
- 1995
(Show Context)
Citation Context ...nterest of this approach analyzing two examples recently proposed in the literature and considered to be realistic case studies: the manufacturing plant of [10] and the Philips audio control protocol =-=[4, 7]-=-. 1 Introduction Multirate timed automata [2] are an extension of timed automata [3] where clocks do not advance at an uniform rate, but each clock has its own speed varying between a lower and an upp... |

19 | Using abstractions for the verification of linear hybrid systems
- Olivero, Sifakis, et al.
- 1994
(Show Context)
Citation Context ...efined or can be approximated by giving the minimal and maximal rate of change. To avoid the difficulties inherent in the verification of multirate timed automata, we follow the approach suggested in =-=[8]-=-. This approach consists of first transforming the multirate timed automata into timed automata and then applying the symbolic techniques implemented in Kronos. We show the practical interest of this ... |

19 | Verification of hybrid systems using abstractions
- Puri, Varaiya
- 1995
(Show Context)
Citation Context ...plemented in Kronos. We show the practical interest of this approach analyzing two examples recently proposed in the literature and considered to be realistic case studies: the manufacturing plant of =-=[10]-=- and the Philips audio control protocol [4, 7]. 1 Introduction Multirate timed automata [2] are an extension of timed automata [3] where clocks do not advance at an uniform rate, but each clock has it... |