## Verifying Automata Specifications of Probabilistic Real-time Systems (1991)

Venue: | Real-Time: Theory in Practice, Springer LNCS 600 |

Citations: | 35 - 3 self |

### BibTeX

@INPROCEEDINGS{Alur91verifyingautomata,

author = {Rajeev Alur and Costas Courcoubetis and David Dill},

title = {Verifying Automata Specifications of Probabilistic Real-time Systems},

booktitle = {Real-Time: Theory in Practice, Springer LNCS 600},

year = {1991},

pages = {28--44},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We present a model-checking algorithm for a system presented as a generalized semi-Markov process and a specification given as a deterministic timed automaton. This leads to a method for automatic verification of timing properties of finite-state probabilistic real-time systems. Keywords: Real-time, Probabilistic systems, Automatic verification. 1 Introduction There is increasing awareness that unexpected behavior from interacting processes can cause serious problems. This observation applies not only to programs and digital systems, but also to physical processes, such as robots, automobiles, manufacturing processes, and so on. Indeed, as digital systems become smaller and cheaper, their use to control and interact with physical processes will inevitably increase. Formal verification of these systems seeks mathematical methods for reasoning about their behavior. Automatic formal verification is particularly promising, because it requires far less labor than the manual techniques. ...

### Citations

477 |
Automata on infinite objects
- Thomas
(Show Context)
Citation Context ... logics. In this paper we use deterministic timed automata [AD90] as a specification formalism. The formalism of timed automata is a generalization of finite-state machines over infinite strings (see =-=[Th90]-=- for an exposition to !-automata). While !-automata accept infinite words, timed automata are additionally constrained by timing requirements and accept timed words (see the article The Theory of Time... |

405 |
Automata for modelling real-time systems
- Alur, Dill
- 1990
(Show Context)
Citation Context ... logic CTL [EC82] that allowed the inclusion of explicit constant upper and lower time bounds in formulas. Here, we describe a different modelchecking algorithm that uses deterministic timed automata =-=[AD90] to s-=-pecify properties to be checked. These automata can express certain types of linear behavior that cannot be described using TCTL. An example of such a requirement is the "convergent bounded respo... |

360 |
Model-checking for realtime systems
- Alur, Courcoubetis, et al.
- 1990
(Show Context)
Citation Context ...h have been studied by researchers in the field of stochastic modeling [Sh87, Wh80]. In previous work [ACD91], we developed an algorithm for checking whether such a system satisfied a formula in TCTL =-=[ACD90]-=-, an extension of the branching-time temporal logic CTL [EC82] that allowed the inclusion of explicit constant upper and lower time bounds in formulas. Here, we describe a different modelchecking algo... |

323 |
Symbolic model checking: 10 states and beyond
- Burch, Clarke, et al.
- 1990
(Show Context)
Citation Context ...oblems are typically PSPACE, even in the absence of real-time and probabilities. We feel hopeful that the techniques emerging from the ongoing research on how to cope with the state-explosion problem =-=[BCMDH90]-=-, [GW90] will be useful in implementing the algorithm presented here. Acknowledgements: We thank Gerald Shedler for pointing us to the existing literature on modeling systems as generalized semi-Marko... |

245 | A logic for reasoning about time and reliability - Hansson, Jonsson - 1994 |

238 | A Really Temporal Logic - Alur, Henzinger - 1994 |

215 | Automatic verification of probabilistic concurrent finite state programs - Vardi - 1985 |

196 | Specifying real-time properties with metric temporal logic. RealTime Systems 2(4 - Koymans - 1990 |

113 | A partial approach to model checking - Godefroid, Wolper - 1994 |

83 | Model-checking for probabilistic real-time systems
- Alur, Courcoubetis, et al.
- 1991
(Show Context)
Citation Context ...utions with the delays. This extension makes our processes generalized semi-markov processes, which have been studied by researchers in the field of stochastic modeling [Sh87, Wh80]. In previous work =-=[ACD91]-=-, we developed an algorithm for checking whether such a system satisfied a formula in TCTL [ACD90], an extension of the branching-time temporal logic CTL [EC82] that allowed the inclusion of explicit ... |

34 | Verifying temporal properties of finite-state probabilistic programs - Courcoubetis, Yannakakis - 1988 |

34 |
Using branching-time temporal logic to synthesize synchronization skeletons
- Emerson, Clarke
- 1982
(Show Context)
Citation Context ...odeling [Sh87, Wh80]. In previous work [ACD91], we developed an algorithm for checking whether such a system satisfied a formula in TCTL [ACD90], an extension of the branching-time temporal logic CTL =-=[EC82]-=- that allowed the inclusion of explicit constant upper and lower time bounds in formulas. Here, we describe a different modelchecking algorithm that uses deterministic timed automata [AD90] to specify... |

34 | Reasoning with time and chance - Lehman, Shelah |

30 | A logic of concrete time intervals - Lewis - 1990 |

29 | Continuity of generalized semi-markov processes - Whitt - 1980 |

16 | Probabilistic verification by tableaux - Pnueli, Zuck - 1986 |

16 | Regeneration and Networks of Queues - Shedler - 1987 |