Abstract
By definitionTimedAutomata have an infinite state-space, thus for verification purposes, an exact finite abstraction is required. We propose a locationbased finite zone abstraction, which computes an abstraction based on the relevant guards for a particular state of the model (as opposed to all guards).We show that the location-based zone abstraction is sound and complete with respect to location reachability; that it generalises active-clock reduction, in the sense that an inactive clock has no relevant guards at all; that it enlarges the class of timed automata, that can be verified. We generalise the new abstraction to the case of networks of timed automata, and experimentally demonstrate a potentially exponential speedup compared to the usual abstraction.
Supported by a BRICS grant. The work has been mainly carried out while the author had a post-doctoral position at Aalborg University.
Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An Implementation of Three Algorithms for Timing Verification Based on Automata Emptiness. In Proc. 13th IEEE Real-Time Systems Symp. (RTSS’92), pp. 157–166. IEEE Computer Society Press, 1992.
R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of Timed Transition Systems. In Proc. 3rd Int. Conf. on Concurrency Theory (CONCUR’92), vol. 630 of LNCS, pp. 340–354. Springer, 1992.
R. Alur and D. Dill. ATheory ofTimedAutomata. Theoretical Computer Science, 126(2):183–235, 1994.
G. Behrmann, K. G. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In Proc. 11th Int. Conf. on Computer Aided Verification (CAV’99), vol. 1633 of LNCS, pp. 341–353. Springer, 1999.
J. Bengtsson. Clocks, DBMs ans States in Timed Systems. PhD thesis, Dept. of Information Technology, Uppsala Univ., Uppsala, Sweden, 2002.
J. Bengtsson, K. G. Larsen, Fredrik Larsson, P. Pettersson, W. Yi, and Carsten Weise. New Generation of uppaal. In Proc. Int. Workshop on Software Tools for Technology Transfer (STTT’98), BRICS Notes, pp. 43–52, 1998.
A. Boudet and H. Comon. Diophantine Equations, PresburgerArithmetic and FiniteAutomata. In Proc. 21st Int. Coll. on Trees in Algebra and Programming (CAAP’96), vol. 1059 of LNCS, pp. 30–43. Springer, 1996.
P. Bouyer. Timed Automata May Cause Some Troubles. Research Report LSV-02-9, LSV, ENS de Cachan, France, 2002.
P. Bouyer. Untameable Timed Automata! In Proc. 20th Annual Symp. on Theoretical Aspects of Computer Science (STACS’2003), 2003. To appear.
P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are timed automata updatable? In Proc. 12th Int. Conf. on Computer Aided Verification (CAV’2000), vol. 1855 of LNCS, pp. 464–479. Springer, 2000.
P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Expressiveness of updatable timed automata. In Proc. 25th Int. Symp. on Mathematical Foundations of Computer Science (MFCS’2000), vol. 1893 of LNCS, pp. 232–242. Springer, 2000.
M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: a Model-Checking Tool for Real-Time Systems. In Proc. 10th Int. Conf. on Computer Aided Verification (CAV’98), vol. 1427 of LNCS, pp. 546–550. Springer, 1998.
V. Braberman, D. Garbervetsky, and A. Olivero. Improving the Verification of Timed Systems Using Influence Information. In Proc. 8th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’02), vol. 2280 of LNCS, pp. 21–36. Springer, 2002.
E. Clarke, O. Grumberg, and D. Peled. Model-Checking. The MIT Press, 1999.
C. Daws and S. Tripakis. Model-Checking of Real-Time Reachability Properties using Abstractions. In Proc. 4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’98), vol. 1384 of LNCS, pp. 313–329. Springer, 1998.
D. Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. In Proc. of theWorkshop on Automatic Verification Methods for Finite State Systems, vol. 407 of LNCS, pp. 197–212. Springer, 1989.
E. Domenjoud. Solving Systems of Linear Diophantine Equations: an Algebraic Approach. In Proc. 16th Int. Symp. on Mathematical Foundations of Computer Science (MFCS’91), vol. 520 of LNCS, pp. 141–150. Springer, 1991.
K. Havelund, A. Skou, K.G. Larsen, and K. Lund. Formal Modeling and Analysis of an Audio/Video Protocol: an Industrial Case Study using uppaal. In Proc. 18th IEEE Real-Time Systems Symp. (RTSS’97), pp. 2–13. IEEE Computer Society Press, 1997.
F. Laroussinie and K.G. Larsen. CMC: a Tool for Compositional Model-Checking of Real-Time Systems. In Proc. IFIP Int. Conf. on Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE-PSTV’98), pp. 439–456. Kluwer Academic, 1998.
K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Software Tools for Technology Transfer, 1(1–2):134–152, 1997.
J. Møller, J. Lichtenberg, H.R. Andersen, and H. Hulgaard. Difference Decision Diagrams. In Proc. 13th Int. Workshop on Computer Science Logic (CSL’99), vol. 1683 of LNCS, pp. 111–125. Springer, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behrmann, G., Bouyer, P., Fleury, E., Larsen, K.G. (2003). Static Guard Analysis in Timed Automata Verification. In: Garavel, H., Hatcliff, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36577-X_18
Download citation
DOI: https://doi.org/10.1007/3-540-36577-X_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00898-9
Online ISBN: 978-3-540-36577-8
eBook Packages: Springer Book Archive