In real-time systems, correctness depends on the time at which events occur. Examples of real-time systems include timed protocols and many embedded system controllers. Timed automata are an extension of finite-state automata that include real-valued clock variables used to measure time. Given a timed automaton, an equivalent finite-state region automaton can be constructed, which guarantees decidability. Timed model checking tools like UPPAL, KRONOS, and RED use specialized data structures to represent the real-valued clock variables. A different approach, called integer-discretization, is to define clock variables that can assume only integer values, but, in general, this does not preserve continuous-time semantics. This paper describes an implicit representation of the region automaton to which ordinary model checking tools can be applied directly. This approach differs from integer discretization because it is able to handle real-valued clock variables using a finite representation and preserves the continuous-time semantics of timed automata. In this framework, we introduce the GOABSTRACTION, a technique to reduce the size of the state space. Based on a conservative approximation of the region automaton, GOABSTRACTION makes it possible to verify larger systems. In order to make the abstraction precise enough to prove meaningful properties, we introduce auxiliary variables, called Go variables, that limit the drifting of clock variables in the abstract system. The paper includes preliminary experimental results showing the effectiveness of our technique using both symbolic and bounded model checking tools.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rajeev Alur, Costas Courcoubetis, and David L. Dill. Model-Checking for Real-Time Systems. In Proc. of the 5th Annual IEEE Symposium on Logic in Computer Science, 1990.
Rajeev Alur and David L. Dill. A Theory of Timed Automata. Theoretical Computer Science, 126 (2):183-235, April 1994.
Thomas Ball and Sriram K. Rajamani. Automatically Validating Temporal Safety Properties of Interfaces. In Proc. of the 8th International SPIN Workshop, 2001.
Dirk Beyer, Claus Lewerentz, and Andreas Noack. Rabbit: A Tool for BDD-Based Verifica-tion of Real-Time Systems. In Proc. of the 15th International Conference on Computer Aided Verification (CAV), 2003.
Marius Bozga, Oded Maler, and Stavros Tripakis. Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics. In Proc. of 10th Conference on Correct Hardware Design and Verification Methods (CHARME), 1999.
Edmund M. Clarke, Orna Grumberg, and David E. Long. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, 1994.
David Dill. Timing Assumptions and Verification of Finite-Sate Concurrent Systems. In Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, 1989.
Aleks G oll ü , Anuj Puri, and Pravin Varaiya. Discretization of Timed Automata. In Proc. of the 33rd IEEE Conference on Decision and Control, 1994.
Thomas A. Henzinger and Orna Kupferman. From Quantity to Quality. In Proc. of International Workshop on Hybrid and Real-Time Systems (HART), 1997.
Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. What Good Are Digital Clocks? In Proc. of the 19th International Colloquium on Automata, Languages and Programming, 1992.
Leslie Lamport. Real-Time Model Checking is Really Simple. In Proc. of 13th Conference on Correct Hardware Design and Verification Methods (CHARME), 2005.
Kim G. Larsen, Paul Pettersson, and Wang Yi. Compositional and Symbolic Model-Checking of Real-Time Systems. In Proc. of the 16th IEEE Real-Time Systems Symposium, 1995.
Jesper Møller, Henrik Hulgaard, and Henrik Reif Andersen. Symbolic model checking of timed guarded commands using difference decision diagrams. Journal of Login and Algebraic Pro-gramming, 52-53:52-57, July-August 2002.
M. Oliver M öller, Harald Rueß, and Maria Sorea. Predicate Abstraction for Dense Real-Time Systems. In Proc. of the Workshop on Theory and Practice of Timed Systems, 2002.
Maria Sorea. Verification of Real-Time Systems through Lazy Approximations. PhD thesis, University of Ulm, Germany, 2004.
Stavros Tripakis and Sergio Yovine. Analysis of Timed Systems Using Time-Abstracting Bisimulations. Formal Methods in System Design, 18(1):25-68, January 2001.
Farn Wang. Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems. In Proc. of the 6th International Conference on Tools and Algorithms for the Con-struction and Analysis of Systems (TACAS), 2000.
Farn Wang. Region Encoding Diagram for Fully Symbolic Verification of Real-Time Systems. In Proc. of the 20th Annual International Computer Software and Applications Conference, 2000.
Farn Wang. RED: Model-Checker for Timed Automata with Clock-Restriction Diagram. In Proc. of Workshop on Real-Time Tools, 2001.
Farn Wang. Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Dia-gram. In Proc. of the 21st International Conference on Formal Techniques for Networked and Distributed Systems, 2001.
Sergio Yovine. KRONOS: a verification tool for real-time systems. International Journal on Software Tools for Technology Transfer, 1(1-2):123-133, December 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this paper
Cite this paper
Clarke, E.M., Lerda, F., Talupur, M. (2007). An Abstraction Technique for Real-Time Verification. In: Ramesh, S., Sampath, P. (eds) Next Generation Design and Verification Methodologies for Distributed Embedded Control Systems. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6254-4_1
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6254-4_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6253-7
Online ISBN: 978-1-4020-6254-4
eBook Packages: EngineeringEngineering (R0)