Specification of Deterministic Regular Liveness Properties

Frank Nießner

Abstract

Even up-to-date automated verification techniques are affected by the fundamental complexity of verification algorithms which is caused by necessity to decide subset conditions on certain languages. These languages are recognizable by nondeterministic Büchi automata and represent a system behavior and the desired properties of the system. The involved complementation process may lead to an exponential blow-up in the size of the automata. In this paper we specify the structure of a rich subclass of languages that can be characterized by deterministic Büchi automata and hence be complemented rather easily. Furthermore, we present examples of practically relevant properties belonging to this language class.

References

  1. B. Alpern and F.B. Schneider, Defining liveness, Information Processing Letters, 21(4), pp 181-185, 1985.
  2. 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, pp 1-11. Stanford University Press, 1962.
  3. S. Eilenberg, Automata, Languages and Machines, volume A, Academic Press, New York, 1974.
  4. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company, 1979.
  5. L. Lamport, Proving the correctness of multiprocess programs, IEEE Transactions on Software Engineering, SE-3(2), pp 125-143, 1977.
  6. Z. Manna and A. Pnueli, A hierarchy of temporal properties, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, pp 377-408, 1990.
  7. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent SystemsSpecification, Springer Verlag, New York, first edition, 1992.
  8. F. Nießner, U. Nitsche, and P. Ochsenschläger, Deterministic ?-Regular Liveness Properties, In Symeon Bozapalidis, editor, Proceedings of the 3rd International Conference on Developments in Language Theory (DLT'97), pp 237-247, 1997.
  9. S. Safra, On the complexity of ?-automata, Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE, pp 319-327, 1988.
  10. W. Thomas, Automata on infinite objects, in J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pp 133-191, Elsevier, 1990.
Download


Paper Citation


in Harvard Style

Nießner F. (2006). Specification of Deterministic Regular Liveness Properties . In Proceedings of the 4th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems - Volume 1: MSVVEIS, (ICEIS 2006) ISBN 978-972-8865-49-8, pages 173-178. DOI: 10.5220/0002482601730178


in Bibtex Style

@conference{msvveis06,
author={Frank Nießner},
title={Specification of Deterministic Regular Liveness Properties},
booktitle={Proceedings of the 4th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems - Volume 1: MSVVEIS, (ICEIS 2006)},
year={2006},
pages={173-178},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002482601730178},
isbn={978-972-8865-49-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems - Volume 1: MSVVEIS, (ICEIS 2006)
TI - Specification of Deterministic Regular Liveness Properties
SN - 978-972-8865-49-8
AU - Nießner F.
PY - 2006
SP - 173
EP - 178
DO - 10.5220/0002482601730178