Advertisement

Abstract

An approximation to the usual linear satisfaction of temporal properties is discussed in this paper. It is called satisfaction up to liveness as it only differs from the linear satisfaction relation on liveness but not on safety properties. From the point of view of observation, satisfaction up to liveness and linear satisfaction are indistinguishable. Roughly speaking, by observing all finite behaviours (exhaustive testing), we do not know whether a system satisfies a property up to liveness or linearly. Being indistinguishable from linear satisfaction in terms of complete observations, satisfaction up to liveness offers an alternative approach to model-checking.

Keywords

Model-Checking Exhaustive Testing Fairness Safety & Liveness. 

References

  1. [l]
    M. Abadi and L. Lamport. The existence of refinement mappings. SRC Report 29, DEC System Research Center, July 1988.Google Scholar
  2. [2]
    M. Abadi and L. Lamport. Composing specifications. SRC Report 66, DEC System Research Center, October 1990.Google Scholar
  3. [3]
    B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21 (4): 181–185, October 1985.MathSciNetCrossRefMATHGoogle Scholar
  4. [4]
    R. Alur and T. A. Henninger. Local liveness for compositional modeling of fair reactive systems. In P. Wolper, editor, Computer Aided Verification (CAV) ‘85, volume 939 of Lecture Notes in Computer Science, pages 166–179. Springer, 1995.Google Scholar
  5. [5]
    J. Büchi. On a decision method in restricted second order arithmetic. In E. Nagel et al., editors, Proceedings of the International Congress on Logic, Methodology and Philosophy of Science 1960, pages 1–11. Stanford University Press, 1962.Google Scholar
  6. [6]
    S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, New York, 1974.Google Scholar
  7. [7]
    E. A. Emerson. Temporal and modal logic. In van Leeuwen [[16]], pages 9951072.Google Scholar
  8. [8]
    N. Francez. Fairness. Springer Verlag, New York, first edition, 1986.CrossRefMATHGoogle Scholar
  9. [9]
    T. A. Henzinger. Sooner is safer than later. Information Processing Letters, 43: 135–141, 1992.MathSciNetCrossRefMATHGoogle Scholar
  10. [10]
    J. L. Kelley. General Topology. Van Nostrand, Princeton, 1955.MATHGoogle Scholar
  11. [11]
    O. Kupferman and M. Y. Vardi. Model-checking of safety properties. In N. Halbwachs and D. Peled, editors, CAV’99, volume 1633 of Lecture Notes in Computer Science, pages 172–183, Trento, Italy, 1999. Springer Verlag.Google Scholar
  12. [12]
    U. Nitsche. Application of formal verification and behaviour abstraction to the service interaction problem in intelligent networks. Journal of Systems and Software, 40(3):227–248, March 1998. ISSN:0164–1212.Google Scholar
  13. [13]
    U. Nitsche and P. Ochsenschläger. Approximately satisfied properties of systems and simple language homomorphisms. Information Processing Letters, 60:201206, 1996. ISSN: 0020–0190.Google Scholar
  14. [14]
    U. Nitsche and P. Wolper. Relative liveness and behavior abstraction (extended abstract). In Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC’97), pages 45–52, Santa Barbara, CA, 1997.Google Scholar
  15. [15]
    W. Thomas. Automata on infinite objects. In van Leeuwen [[16]], pages 133–191.Google Scholar
  16. [16]
    J. van Leeuwen, editor. Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science. Elsevier, 1990.Google Scholar
  17. [17]
    M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 327–338, Portland, October 1985.Google Scholar
  18. [18]
    M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the 1st Symposium on Logic in Computer Science, Cambridge, June 1986.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2000

Authors and Affiliations

  • Ulrich Ultes-Nitsche
    • 1
  1. 1.Department of Electronics and Computer ScienceUniversity of SouthamptonSouthamptonUK

Personalised recommendations