Advertisement

Proofs from temporal hypotheses by symbolic simulation

  • Sanjai Narain
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1066)

Abstract

DMOD is a system for modeling and simulating real-time, discrete-event systems. It formalizes the popular discrete-event simulation technique but retains its powerful intuitions such as events, state, causality, event preemption, and variable advance of simulation time. DMOD has been successfully applied to analysis of real systems in telecommunications. This paper describes a method of using DMOD to prove an important class of temporal properties of the form property p holds infinitely often. The method is illustrated by verifying a robotic arm controller, a hybrid system with both discrete and continuous state. An important aspect of this method is that considerable control can be exercised over how efficiently theorems are proved. System models, temporal properties, and theorem provers are all programs in the logic programming language CLP(R). Algorithmic knowledge about how to efficiently compute abstractions needed for proof, and how to control the shape and size of search spaces can be encoded in these programs. Proofs are constructed by executing these programs. As an example of the resulting efficiency, the robotic arm controller is verified in just a few seconds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Courcoubetis, C., Henzinger, T., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S. The algorithmic analysis of hybrid systems. Proceedings of 11th International Conference on Analysis and Optimization of Systems, Guy Cohen & Jean-Pierre Quadrat (eds.), Lecture Notes in Control and Information Sciences 199, Springer Verlag (1994)Google Scholar
  2. 2.
    Jaffar, J., Maher, M. Constraint Logic Programming: A Survey. Journal of Logic Programming, vols.19/20, May–July, 1994.Google Scholar
  3. 3.
    Kowalski, R. Logic for problem solving. Elsevier North-Holland, New York, 1979.Google Scholar
  4. 4.
    Narain, S., Chadha, R. Symbolic Discrete-Event Simulation. Invited paper, Discrete-Event Systems, Manufacturing Systems and Communication Networks, Editors: P.R. Kumar and P. Varaiya, IMA volume 73 in Mathematics and its Applications, Springer Verlag, 1995.Google Scholar
  5. 5.
    Narain, S., Chadha, R., Cockings, O. A Formal Model of SONET's Alarm-Surveillance Procedures and Their Simulation. Proceedings of Formal Description Techniques Conference, 1993.Google Scholar
  6. 6.
    Puri, A., Varaiya, P. Verification of Hybrid Systems using Abstractions. Proceedings of Hybrid Systems Workshop, Mathematical Sciences Institute, Cornell University, October, 1994.Google Scholar
  7. 7.
    Seda-Poulin, M., Narain, S. Linear Automatic Protection Switching Test Methodology. Proceeding's of National Fiber Optics Engineers Conference, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Sanjai Narain
    • 1
  1. 1.BellcoreMorristown

Personalised recommendations