Do We Need Liveness? - Approximation of Liveness Properties by Safety Properties

Authors:
Ulrich Ultes-Nitsche
Affiliations:
-
Venue:
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Year:
2002

Citing 11
Cited 0

Fairness

Fairness
Handbook of theoretical computer science (vol. B): formal models and semantics

Handbook of theoretical computer science (vol. B): formal models and semantics
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Approximately satisfied properties of systems and simple language homomorphisms

Information Processing Letters
Relative liveness and behavior abstraction (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Simple on-the-fly automatic verification of linear temporal logic

Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Model Checking of Safety Properties

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Recognizing Safety and Liveness

Recognizing Safety and Liveness

Quantified Score

Hi-index	0.00

Visualization

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.