Abstract
Timed behavior automata allow surprisingly efficient model checking of delay-constrained reactive systems when partial-order methods for delay-insensitive systems are adapted for real time. The complexity of timing verification is a sensitive function of the precise abstraction of real time used in the model. Untimed behavior automata [14] are modified in two ways: (i) process output actions are performed inside a timing window relative to the holding of their presets, and (ii) acknowledgment of process input actions is replaced by observing minimum delays between old and new inputs. We prove timing-window bounds on system responses, and show that system inputs do not arrive too fast. Since nonsingleton presets are common, we develop a semantics to reason about nonbinary delay constraints. Model checking starts by coupling specification mirror to implementation network; in timed systems, questions of graph connectivity become questions of constraint graph satisfaction that are computed by optimized linear-time shortest-path algorithms. In the generalized TBA model, nondeterministic input choice is process-scheduled testing of an environment-controlled state predicate; the generalized model, which focuses on mixed-type critical races, is deferred.
This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under grants A3363, A0921 and MEF0040121. probst@crim.ca and probst@vlsi.concordia.ca.
Chapter PDF
Similar content being viewed by others
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
M. Abadi and L. Lamport, An Old-Fashioned Recipe for Real Time, in W.-P. de Roever (Ed.), Real-Time: Theory in Practice, REX Workshop on Real-Time, Proceedings, Lecture Notes in Computer Science 600, Springer-Verlag, 1992.
R. Alur, Techniques for automatic verification of real-time systems, Ph.D. Thesis, Department of Computer Science, Stanford University, Report STAN-CS-91-1378, August 1991.
R. Casley, R.F. Crew, J. Meseguer and V.R. Pratt, Temporal Structures, Math. Structures in Computer Science, 1:2, July 1991, pp. 179–213.
C. Courcoubetis and M. Yannakakis, Minimum and maximum delay problems in real-time systems, in K.G. Larsen and A. Skou, (Eds.), Third Workshop on Computer-Aided Verification, Proceedings, Department of Mathematics and Computer Science, Aalborg University, Report IR-91-5, July 1991, pp. 467–477. Also Lecture Notes in Computer Science 575, Springer-Verlag, 1992.
W.-P. de Roever (Ed.), Real-Time: Theory in Practice, REX Workshop on Real-Time, Proceedings, Lecture Notes in Computer Science 600, Springer-Verlag, 1992.
D.L. Dill, Trace theory for automatic hierarchical verification of speed-independent circuits, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Report CMU-CS-88-119, February 1988. Also MIT Press, 1989.
D.L. Dill, Timing assumptions and verification of finite-state concurrent systems, in J. Sifakis, (Ed.), Automatic Verification Methods for Finite State Systems, Proceedings, First Workshop on Computer-Aided Verification, Lecture Notes in Computer Science 407, Springer-Verlag, 1990, pp. 197–212.
T.A. Henzinger, The temporal specification and verification of real-time systems, Ph.D. Thesis, Department of Computer Science, Stanford University, Report STAN-CS-91-1380, August 1991.
F. Jahanian and A.K.-L. Mok, A graph-theoretic approach for timing analysis and its implementation, IEEE Trans. on Computers, C-36:8, August 1987, pp. 961–975.
P.K. Khordoc et al., A stimulus/response system based on hierarchical timing diagrams, Proceedings of ICCAD '91, Santa Clara, CA, November 1991.
V.R. Pratt, Modelling concurrency with partial orders, Int. Journal of Parallel Prog., 15:1, February 1986, pp. 33–71.
D.K. Probst and H.F. Li, Abstract specification, composition and proof of correctness of delay-insensitive circuits and systems, Technical Report, Department of Computer Science, Concordia University, CS-VLSI-88-2, April 1988 (Revised March 1989).
D.K. Probst and H.F. Li, Using partial-order semantics to avoid the state explosion problem in asynchronous systems, in E.M. Clarke and R.P. Kurshan, (Eds.), Second Workshop on Computer-Aided Verification, June 1990, DIMACS Series, Vol. 3, 1991, pp. 15–24. Also Lecture Notes in Computer Science 531, Springer-Verlag, 1991.
D.K. Probst and H.F. Li, Partial-order model checking: A guide for the perplexed, in K.G. Larsen and A. Skou, (Eds.), Third Workshop on Computer-Aided Verification, Proceedings, Department of Mathematics and Computer Science, Aalborg University, Report IR-91-5, July 1991, pp. 405–416. Also Lecture Notes in Computer Science 575, Springer-Verlag, 1992, pp. 322–331.
D.K. Probst and L.C. Jensen, Controlling state explosion during automatic verification of delay-insensitive and delay-constrained VLSI systems using the POM verifier, in S. Whitaker, (Ed.), Proceedings of the 3rd NASA Symposium on VLSI Design, Moscow, ID, October 1991, pp. 8.2.1–8.2.8.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Probst, D.K., Li, H.F. (1993). Verifying timed behavior automata with nonbinary delay constraints. 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_11
Download citation
DOI: https://doi.org/10.1007/3-540-56496-9_11
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