In this paper, the problem of checking a timed automaton for a Duration Cal-culus formula of the form Temporal Duration Property is addressed. It is shown that TemporalDuration Properties are in the class of discretis...In this paper, the problem of checking a timed automaton for a Duration Cal-culus formula of the form Temporal Duration Property is addressed. It is shown that TemporalDuration Properties are in the class of discretisable real-time properties of Timed Automata,and an algorithm is given to solve the problem based on linear programming techniques andthe depth-first search method in the integral region graph of the automaton. The complexityof the algorithm is in the same class as that of the solution of the reachability problem of timedautomata.展开更多
文摘In this paper, the problem of checking a timed automaton for a Duration Cal-culus formula of the form Temporal Duration Property is addressed. It is shown that TemporalDuration Properties are in the class of discretisable real-time properties of Timed Automata,and an algorithm is given to solve the problem based on linear programming techniques andthe depth-first search method in the integral region graph of the automaton. The complexityof the algorithm is in the same class as that of the solution of the reachability problem of timedautomata.