## Minimization of Timed Transition Systems (1992)

Citations: | 77 - 6 self |

### BibTeX

@INPROCEEDINGS{Alur92minimizationof,

author = {Rajeev Alur and Costas Courcoubetis and N. Halbwachs and D. Dill and H. Wong-toi},

title = {Minimization of Timed Transition Systems},

booktitle = {},

year = {1992},

pages = {340--354},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

1179 | Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications
- Clarke, Emerson, et al.
- 1986
(Show Context)
Citation Context ...G Institute Grenoble, France D. Dill, H. Wong-Toi Stanford University Stanford, California 1 Introduction Model checking is a powerful technique for the automatic verification of finite-state systems =-=[9, 13, 8]-=-. A model-checking algorithm determines whether a finite-state system, represented by its statetransition graph, satisfies its specification given as a temporal logic formula. For speed independent or... |

470 | Symbolic model checking for real-time systems
- Henzinger, Nicollin, et al.
- 1994
(Show Context)
Citation Context ...in the number of clocks and in the length of timing constraints. Recently, to overcome this problem Henzinger et al. have shown how to compute certain timing properties of timed automata symbolically =-=[15]-=-. We propose another approach, namely, of applying a stateminimization algorithm while constructing the region graph to reduce its size. The objective of the minimization algorithm is to construct a m... |

405 |
Automata for modelling real-time systems
- Alur, Dill
- 1990
(Show Context)
Citation Context ...fine a region graph in which every region contains a single state. But this is not useful, because a timed automaton has infinitely many states. The following proposition, which is the main result of =-=[2]-=-, states that it can always be folded into a finite region graph: Proposition : For any timed automaton G and the initial partition R 0 = fhs; IR n i j s 2 Sg, there exists a finite region graph RG(G;... |

360 |
Model-checking for realtime systems
- Alur, Courcoubetis, et al.
- 1990
(Show Context)
Citation Context ...ting protocols and circuits [7]. Only recently there have been attempts to extend these techniques to verification of timing properties that explicitly depend upon the actual magnitudes of the delays =-=[14, 4, 2, 1, 17, 3]-=-. Because of the practical need for some support for developing reliable real-time systems, the interest in studying these techniques further is considerable. The initial theoretical results indicate ... |

323 |
Symbolic model checking: 10 states and beyond
- Burch, Clarke, et al.
- 1990
(Show Context)
Citation Context ...G Institute Grenoble, France D. Dill, H. Wong-Toi Stanford University Stanford, California 1 Introduction Model checking is a powerful technique for the automatic verification of finite-state systems =-=[9, 13, 8]-=-. A model-checking algorithm determines whether a finite-state system, represented by its statetransition graph, satisfies its specification given as a temporal logic formula. For speed independent or... |

238 | A Really Temporal Logic
- Alur, Henzinger
- 1994
(Show Context)
Citation Context ...ting protocols and circuits [7]. Only recently there have been attempts to extend these techniques to verification of timing properties that explicitly depend upon the actual magnitudes of the delays =-=[14, 4, 2, 1, 17, 3]-=-. Because of the practical need for some support for developing reliable real-time systems, the interest in studying these techniques further is considerable. The initial theoretical results indicate ... |

221 |
Timing assumptions and verification of finite-state concurrent systems
- Dill
- 1989
(Show Context)
Citation Context ... develop heuristics. In this paper, we show how to apply state-minimization techniques to verification algorithms for real-time systems. We use timed automata as a representation of real-time systems =-=[11, 2]-=-. A timed automaton provides a way of annotating a state-transition graph of the system with timing constraints. It operates with a finite-state control and a finite number of fictitious time-measurin... |

202 | The benefits of relaxing punctuality
- Alur, Feder, et al.
- 1996
(Show Context)
Citation Context ...ting protocols and circuits [7]. Only recently there have been attempts to extend these techniques to verification of timing properties that explicitly depend upon the actual magnitudes of the delays =-=[14, 4, 2, 1, 17, 3]-=-. Because of the practical need for some support for developing reliable real-time systems, the interest in studying these techniques further is considerable. The initial theoretical results indicate ... |

123 | Parametric quantitative temporal reasoning
- Emerson, Trefler
- 1999
(Show Context)
Citation Context |

80 |
Modalities for model checking: Branching time logic strikes back
- Emerson, Lei
- 1987
(Show Context)
Citation Context ...G Institute Grenoble, France D. Dill, H. Wong-Toi Stanford University Stanford, California 1 Introduction Model checking is a powerful technique for the automatic verification of finite-state systems =-=[9, 13, 8]-=-. A model-checking algorithm determines whether a finite-state system, represented by its statetransition graph, satisfies its specification given as a temporal logic formula. For speed independent or... |

80 | From ATP to Timed Graphs and Hybrid Systems
- Nicollin, Yovine
- 1991
(Show Context)
Citation Context ...ng constraints. It operates with a finite-state control and a finite number of fictitious time-measuring elements called clocks . Various problems have been studied in the framework of timed automata =-=[2, 1, 3, 19, 18]-=-. Before we can say how we improve the existing algorithms, let us recall how these algorithms work. First notice that a state of a timed automaton needs to record the location of the control and the ... |

75 | Automatic Verification of Sequential Circuits Using Temporal Logic
- Browne, Clarke, et al.
- 1986
(Show Context)
Citation Context ...e retaining only the sequencing of state-transitions. For such systems, model checking has a long history spanning over ten years, and has been shown to be useful in validating protocols and circuits =-=[7]-=-. Only recently there have been attempts to extend these techniques to verification of timing properties that explicitly depend upon the actual magnitudes of the delays [14, 4, 2, 1, 17, 3]. Because o... |

64 |
Decidability of Bisimulation Equivalences for Parallel Timer Processes
- ˘Cerāns
- 1992
(Show Context)
Citation Context ...ng constraints. It operates with a finite-state control and a finite number of fictitious time-measuring elements called clocks . Various problems have been studied in the framework of timed automata =-=[2, 1, 3, 19, 18]-=-. Before we can say how we improve the existing algorithms, let us recall how these algorithms work. First notice that a state of a timed automaton needs to record the location of the control and the ... |

62 |
Minimum and maximum delay problems in real-time systems
- Courcoubetis, Yannakakis
- 1991
(Show Context)
Citation Context ...r solving many problems. For instance, it can be used for testing emptiness of a timed automaton [2], real-time model-checking [1], testing bisimulation equivalence [19], finding bounds on the delays =-=[10]-=-, and controller synthesis [20]. The main hurdle in implementing such algorithms using the region graph is that it's too big -- it is exponential in the number of clocks and in the length of timing co... |

59 |
Online minimization of transition systems
- Lee, Yannakakis
- 1992
(Show Context)
Citation Context ...constructing the full region graph first. Recently, algorithms have been proposed for performing simultaneously the reachability analysis and minimization from an implicitly defined transition system =-=[5, 6, 16]-=-. First we show how these algorithms can be adapted to our needs to construct the minimal region graph. Next we extend these methods to propose an algorithm for the problem of deciding whether a timed... |

58 |
Minimal model generation
- Bouajjani, Fernandez, et al.
- 1990
(Show Context)
Citation Context ...constructing the full region graph first. Recently, algorithms have been proposed for performing simultaneously the reachability analysis and minimization from an implicitly defined transition system =-=[5, 6, 16]-=-. First we show how these algorithms can be adapted to our needs to construct the minimal region graph. Next we extend these methods to propose an algorithm for the problem of deciding whether a timed... |

34 |
Using branching-time temporal logic to synthesize synchronization skeletons
- Emerson, Clarke
- 1982
(Show Context)
Citation Context ...on graph to check properties specified in the branching-time logic TCTL. 6.1 The logic TCTL Let us briefly review the logic TCTL of [1]. It is a real-time extension of the branching-time logic CTL of =-=[12]. The synt-=-ax of TCTL allows putting subscripts on the temporal operators of CTL to restrict their scope in time. Thus one can write 93!3 p meaning "along some run within time 3." Formally, let AP be a... |

33 |
The Control of Dense Real-Time Discrete Event Systems
- Wong-Toi, Hoffmann
- 1991
(Show Context)
Citation Context ...stance, it can be used for testing emptiness of a timed automaton [2], real-time model-checking [1], testing bisimulation equivalence [19], finding bounds on the delays [10], and controller synthesis =-=[20]-=-. The main hurdle in implementing such algorithms using the region graph is that it's too big -- it is exponential in the number of clocks and in the length of timing constraints. Recently, to overcom... |

30 |
A logic of concrete time intervals
- Lewis
- 1990
(Show Context)
Citation Context |

27 | Minimal state graph generation
- Bouajjani, Fernandez, et al.
- 1992
(Show Context)
Citation Context ...constructing the full region graph first. Recently, algorithms have been proposed for performing simultaneously the reachability analysis and minimization from an implicitly defined transition system =-=[5, 6, 16]-=-. First we show how these algorithms can be adapted to our needs to construct the minimal region graph. Next we extend these methods to propose an algorithm for the problem of deciding whether a timed... |