Symbolic Model Checking for Real-time Systems


We describe nite-state programs over real-numbered time in a guardedcommand language with real-valued clocks or, equivalently, as nite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time speci cation (given in an extension of CTL with clock variables). We develop an algorithm… (More)
DOI: 10.1109/LICS.1992.185551


5 Figures and Tables


Citations per Year

1,446 Citations

Semantic Scholar estimates that this publication has 1,446 citations based on the available data.

See our FAQ for additional information.