ISSN:
1572-8102
Keywords:
finite-state system
;
timers
;
verification
;
reachability analysis
;
shortest path
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We consider a finite-state system with a finite number of clocks, where the transitions may depend on the values of the clocks, and may reset some of the clocks. We address the complexity and provide algorithms for the following problems. Suppose that the system starts from a given current state with a given assignment of values to the clocks. Can a given target state ever appear in the history of the system? What is the earliest time it can appear? What is the latest time it can appear?
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00709157
Permalink