Skip to main content

A practical and complete algorithm for testing real-time systems

  • Selected Presentations
  • Conference paper
  • First Online:
Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1486))

Abstract

This paper presents a formal method for generating conformance tests for real-time systems. Our algorithm is complete in that, under a test hypothesis, if the system being tested passes every test generated then the tested system is bisimilar to its specification. Because the test algorithm has exponential worst case complexity and finite state automata models of real-time systems are typically very large, a judicious choice of model is critical for the successful testing of real-time systems. Developing such a model and demonstrating its effectiveness are the main contributions of this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cardell-Oliver, R.: An Equivalence Theorem for the Operational and Temporal Semantics of Real-Time, Concurrent Programs, To appear in Journal of Logic and Computation Vol 8, 23 pages (1998)

    Google Scholar 

  2. Cardell-Oliver, R. and Glover, T.: A Practical and Complete Algorithm for Testing Real-Time Systems, Technical Report CSM-306, Department of Computer Science, University of Essex, February 1998. source http://cswww.essex.ac.uk/FSS/projects/test.html

    Google Scholar 

  3. Chow, T.S.: Testing Software Design Modeled by Finite-State Machines, In IEEE Transactions on Software Engineering Vol SE-4, No.3, 178–187 (1978)

    Google Scholar 

  4. Hennessy, M.C.: Algebraic Theory of Processes, MIT Press (1988).

    Google Scholar 

  5. Henzinger, T., Manna, Z. and Pnueli, A.: Temporal Proof Methodologies for Timed Transition Systems. Information and Computation, 112, 273–337 (1994).

    Article  MATH  MathSciNet  Google Scholar 

  6. Holzmann, G.J.: Design and Validation of Computer Protocols, Prentice Hall (1991).

    Google Scholar 

  7. Joseph, M. (ed.): Real-Time Systems: Specification, Verification and Analysis, Prentice-Hall (1996).

    Google Scholar 

  8. Mandioli, Morasca and Morzenti: Generating Test Cases for Real-Time Systems from Logic Specifications, ACM Trans on Computer Systems 13(4), 365–398 (1995).

    Article  Google Scholar 

  9. Peleska, J. and Siegel, M.: Test Automation of Safety-Critical Reactive Systems, South African Computer Journal 19 53–77 (1997).

    Google Scholar 

  10. Springtveld, J., Vaandrager, F., and D’Argenio, F.: Testing Timed Automata, CSI-R9712, Computing Science Institute, University of Nijmegen, August 1997. source http://www.cs.kun.nl/~fvaan/publications

    Google Scholar 

  11. Tretmans, J.: Test Generation with Inputs, Outputs and Quiescence In T Margaria and B Steffan (eds.) Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1055, Springer Verlag (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Anders P. Ravn Hans Rischel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cardell-Oliver, R., Glover, T. (1998). A practical and complete algorithm for testing real-time systems. In: Ravn, A.P., Rischel, H. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1998. Lecture Notes in Computer Science, vol 1486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055352

Download citation

  • DOI: https://doi.org/10.1007/BFb0055352

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65003-4

  • Online ISBN: 978-3-540-49792-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics