Abstract
We study the digitisation of dense-time behaviours of timed processes, and show how this leads to exact verification methods for a large class of dense-time specifications. These specifications are all closed under inverse digitisation, a robustness property first introduced by Henzinger, Manna, and Pnueli (on timed traces), and extended here to timed failures, enabling us to consider liveness issues in addition to safety properties. We discuss a corresponding model checking algorithm and show that, in many cases, automated verification of such dense-time specifications can in fact be directly performed on the model checker FDR (a commercial product of Formal Systems (Europe) Ltd.). We illustrate this with a small case study (the railway level crossing problem). Finally, we show that integral—or digitised—behaviours are fully abstract with respect to specifications closed under inverse digitisation, and relate this to the efficiency of our model checking algorithm.
This research was supported in part by the U.S. Office of Naval Research under contract N00014-95-1-0520 and by the Fonds FCAR (Québec).
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
R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS 90), pages 414–425. IEEE Computer Society Press, 1990.
R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2–34, 1993.
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
R. Alur and T. A. Henzinger. Real-time logics: Complexity and expressiveness. Information and Computation, 104(1):35–77, 1993.
R. Alur and T. A. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181–204, 1994.
R. Alur and R. P. Kurshan. Timing analysis in Cospan. In Proceedings of Hybrid Systems III, volume 1066, pages 220–231. Springer LNCS, 1996.
J. Bengtsson, K. G. Larsen, F. Larsen, P. Pettersson, and W. Yi. UppAal: A tool-suite for automatic verification of real-time systems. In Proceedings of Hybrid Systems III, volume 1066, pages 232–243. Springer LNCS, 1996.
C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool Kronos. In Proceedings of Hybrid Systems III, volume 1066, pages 208–219. Springer LNCS, 1996.
C. L. Heitmeyer, R. D. Jeffords, and B. G. Labaw. A benchmark for comparing different approaches for specifying and verifying real-time systems. In Proceedings of the Tenth International Workshop on Real-Time Operating Systems and Software, 1993.
T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: A model checker for hybrid systems. In Proceedings of the Ninth International Conference on Computer-Aided Verification (CAV 97), volume 1254, pages 460–463. Springer LNCS, 1997.
T. A. Henzinger and O. Kupferman. From quantity to quality. In Proceedings of the First International Workshop on Hybrid and Real-time Systems (HART97), volume 1201, pages 48–62. Springer LNCS, 1997.
T. A. Henzinger, O. Kupferman, and M. Y. Vardi. A space-efficient on-the-.y algorithm for real-time model checking. In Proceedings of the Seventh International Conference on Concurrency Theory (CONCUR 96), volume 1119, pages 514–529. Springer LNCS, 1996.
T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proceedings of the Nineteenth International Colloquium on Automata, Languages, and Programming (ICALP 92), volume 623, pages 545–558. Springer LNCS, 1992.
T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193–244, 1994.
D. M. Jackson. Logical Verification of Reactive Software Systems. PhD thesis, Oxford University, 1992.
F. Laroussinie and K. G. Larsen. Compositional model checking of real time systems. In Proceedings of the Sixth International Conference on Concurrency Theory (CONCUR 95), volume 962, pages 27–41. Springer LNCS, 1995.
J. Ouaknine. Specification as refinement in timed systems. In preparation.
J. Ouaknine. Discrete Analysis of Continuous Behaviour in Real-Time Concurrent Systems. PhD thesis, Oxford University, 2001. Technical report PRG-RR-01-06.
J. Ouaknine and G. M. Reed. Model-checking temporal behaviour in CSP. In Proceedings of the 1999 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 99). CSREA Press, 1999.
G. M. Reed. A Mathematical Theory for Real-Time Distributed Computing. PhD thesis, Oxford University, 1988.
G. M. Reed and A. W. Roscoe. The timed failures-stability model for CSP. Theoretical Computer Science, 211:85–127, 1999.
G. M. Reed, A. W. Roscoe, and S. A. Schneider. CSP and timewise refinement. In Proceedings of the Fourth BCS-FACS Refinement Workshop, Cambridge, 1991. Springer WIC.
A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall International, London, 1997.
S. A. Schneider. Correctness and Communication in Real-Time Systems. PhD thesis, Oxford University, 1989.
S. A. Schneider. An operational semantics for Timed CSP. Information and Computation, 116:193–213, 1995.
S. A. Schneider. Timewise refinement for communicating processes. Science of Computer Programming, 28:43–90, 1997.
S. A. Schneider. Concurrent and Real Time Systems: the CSP approach. John Wiley, 2000.
O. V. Sokolsky and S. A. Smolka. Local model checking for real time systems. In Proceedings of the Seventh International Conference on Computer-Aided Verification (CAV 95), volume 939, pages 211–224. Springer LNCS, 1995.
Y. Yu, P. Manolios, and L. Lamport. Model checking TLA+ specifications. In Proceedings of the Tenth Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME 99), volume 1703, pages 54–66. Springer LNCS, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ouaknine, J. (2002). Digitisation and Full Abstraction for Dense-Time Model Checking. In: Katoen, JP., Stevens, P. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2002. Lecture Notes in Computer Science, vol 2280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46002-0_4
Download citation
DOI: https://doi.org/10.1007/3-540-46002-0_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43419-1
Online ISBN: 978-3-540-46002-2
eBook Packages: Springer Book Archive