Conference
On Improving Backwards Verification of Timed Automata (Extended Abstract)
Abstract
Verification techniques for Timed Automata [2] built in tools like Kronos [7] are based on the fixpoint calculus of an appropriate operator. In this work, we present different alternatives to calculate that fixpoint, which have direct impact in the number of iterations needed to converge.
Authors
Braberman V; Pombo CL; Olivero A
Volume
65
Pagination
pp. 60-67
Publisher
Elsevier
Publication Date
June 2002
DOI
10.1016/s1571-0661(04)80469-9
Conference proceedings
Electronic Notes in Theoretical Computer Science
Issue
6
ISSN
1571-0661