Abstract
We explore in this paper the approximation of a liveness property by a safety property (with respect to a given system behaviour). The approximation is such that, if a system satisfies only the approximation of a linear-time property but not the property itself, we will only detect this by observing the system for an infinite time. As an infinitely long observation is practically impossible, we must deem the property to hold as soon as its approximation is satisfied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Alpern and F.B. Schneider. Defining liveness. Information Processing Letters, 21(4):181–185, October 1985. 279, 281, 285
B. Alpern and F. B. Schneider. Recognizing safety and liveness. Technical Report TR 86-727, Department of Computer Science, Cornell University, January 1986. 282
E.A. Emerson. Temporal and modal logic. In van Leeuwen [12], pages 995–1072. 286
N. Francez. Fairness. Springer Verlag, New York, first edition, 1986. 279, 281
R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In P. Dembinski and M. Sredniawa, editors, Protocol Specification, Testing, and Verification XV’ 95, pages 3–18. Chapman & Hall, 1996. 286
M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., first edition, 1978. 281
O. Kupferman and M. Y. Vardi. Model-checking of safety properties. In N. Halbwachs and D. Peled, editors, CAV’99, volume 1633of Lecture Notes in Computer Science, pages 172–183, Trento, Italy, 1999. Springer Verlag. 286
U. Nitsche and P. Ochsenschläger. Approximately satisfied properties of systems and simple language homomorphisms. Information Processing Letters, 60:201–206, 1996. 279, 282, 285
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. 279, 280, 282, 285
A. Roscoe. The Theory and Practice of Concurrency. Series in Computer Science. Prentice Hall International, 1997. 283, 286
W. Thomas. Automata on infinite objects. In van Leeuwen [12], pages 133–191. 281 [12]_J. van Leeuwen, editor. Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science. Elsevier, 1990. 287
P. Wolper. The tableau method for temporal logic: An overview. Logique et Analyse, 110/111:119–136, Juin-Septembre 1985. 286
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
Ultes-Nitsche, U. (2002). Do We Need Liveness? – Approximation of Liveness Properties by Safety Properties. In: Grosky, W.I., Plášil, F. (eds) SOFSEM 2002: Theory and Practice of Informatics. SOFSEM 2002. Lecture Notes in Computer Science, vol 2540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36137-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-36137-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00145-4
Online ISBN: 978-3-540-36137-4
eBook Packages: Springer Book Archive