We describe finite-state programs over real-numbered time in
a guarded-command language with real-valued clocks or, equivalently,
as finite automata with real-valued clocks. Model checking answers the question which states of a
real-time program satisfy a branching-time specification (given in an extension
of CTL with clock variables). We develop an algorithm that computes this set of states symbolically
as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose,
we introduce a -calculus on computation trees over real-numbered time. Unfortunately, many standard program properties,
such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints:
we show that the expressiveness of the timed -calculus is incomparable to the expressiveness of timed CTL. Fortunately,
this result does not impair the symbolic verification of "implementable" real-time programs---those whose safety...
We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a -calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed -calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" real-time programs---those whose safety...
การแปล กรุณารอสักครู่..