# Checking Inherently Fair Linear-Time Properties in a Non-Näıve Way

### Thierry Nicola, Frank Nießner, Ulrich Ultes-Nitsche

#### Abstract

In [9], an alternative verification relation for linear-time properties is introduced which uses an inherent fairness condition. That relation is specifically tailored to the verification of distributed systems under a relaxed version of strong fairness. We will call it the inherently fair linear-time verification relation in this paper, or IFLTV relation for short. We present an analysis of the mathematical structure of the IFLTV relation, which enables us to obtain an improved non-naïve procedure for checking the IFLTV relation.

#### References

- A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., first edition, 1974.
- B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21(4):181- 185, October 1985.
- J. R. 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.
- E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 1999.
- S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, New York, 1974.
- N. Francez. Fairness. Springer Verlag, New York, first edition, 1986.
- 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 7895, pages 3-18. Chapman & Hall, 1996.
- J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley Longman, 2001.
- 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.
- S. St James and U. Ultes-Nitsche. Computing property-preserving behaviour abstractions from trace reductions. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), pages 238-245. ACM Press, August 2001.
- W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 133-191. Elsevier, 1990.
- U. Ultes-Nitsche and S. St James. Improved verification of linear-time properties within fairness - weakly continuation-closed behaviour abstractions computed from trace reductions. Software Testing, Verification and Reliability (STVR), 13(4):241-255, 2003.
- 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.
- M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.

#### Paper Citation

#### in Harvard Style

Nicola T., Nießner F. and Ultes-Nitsche U. (2008). **Checking Inherently Fair Linear-Time Properties in a Non-Näıve Way** . In *Proceedings of the 6th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems - Volume 1: MSVVEIS, (ICEIS 2008)* ISBN 978-989-8111-43-2, pages 49-58. DOI: 10.5220/0001736600490058

#### in Bibtex Style

@conference{msvveis08,

author={Thierry Nicola and Frank Nießner and Ulrich Ultes-Nitsche},

title={Checking Inherently Fair Linear-Time Properties in a Non-Näıve Way},

booktitle={Proceedings of the 6th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems - Volume 1: MSVVEIS, (ICEIS 2008)},

year={2008},

pages={49-58},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0001736600490058},

isbn={978-989-8111-43-2},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 6th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems - Volume 1: MSVVEIS, (ICEIS 2008)

TI - Checking Inherently Fair Linear-Time Properties in a Non-Näıve Way

SN - 978-989-8111-43-2

AU - Nicola T.

AU - Nießner F.

AU - Ultes-Nitsche U.

PY - 2008

SP - 49

EP - 58

DO - 10.5220/0001736600490058