Abstract
Verification of many properties can be done without regard to the speed of the components of a finite-state system. However, some of the properties can be verified only under certain timing constraints. We propose a new verification strategy for timing constrained finite-state systems. The strategy can avoid the state space explosion problem for a class of systems. A model of such systems, called timed L-process, compatible with the strategy, is also developed.
Chapter PDF
References
Rajeev Alur and David L. Dill. Automata for modelling real-time systems. In M.S. Paterson, editor, ICALP 90 Automata, languages, and programming: 17th international colloquium. Springer-Verlag, 1990. LNCS vol. 443.
Rajeev Alur, Alon Itai, R. P. Kurshan, and M. Yannakakis. Timing verification by successive approximation. In Proceeding of the Forth Workshop on Computer-Aided Verification (CAV '92), June 1992.
Felice Balarin and Alberto L. Sangiovanni-Vincentelli. Formal verification of timing constrained finite-state systems. Technical report, University of California Berkeley, 1992. UCB ERL M92/8.
David L. Dill. Timing assumptions and verifications of finite-state concurrent systems. In Joseph Sifakis, editor, Automatic Verification Methods for Finite-State Systems. Springer-Verlag, 1989. LNCS vol. 407.
Z. Har'El and R. P. Kurshan. Software for analysis of coordination. In Proceedings of the International Conference on System Science, pages 382–385, 1988.
R. P. Kurshan. Analysis of discrete event coordination. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, pages 414–453. Springer-Verlag, 1990. LNCS vol. 430.
R. P. Kurshan, 1991. private communications.
Robert Endre Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balarin, F., Sangiovanni-Vincentelli, A.L. (1993). A verification strategy for timing constrained systems. In: von Bochmann, G., Probst, D.K. (eds) Computer Aided Verification. CAV 1992. Lecture Notes in Computer Science, vol 663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56496-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-56496-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56496-6
Online ISBN: 978-3-540-47572-9
eBook Packages: Springer Book Archive