1. R. Alur, D. Dill. A theory of timed automata, Theor. Comput. Sci. 126 (1994), 183–235.
2. A. V. Aho, J. E. Hoperoft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. 1974.
3. A. Arnold, D. Niwiński, Fixed point characterization of weak monadic logic definable sets of trees, in: Tree Automata and Languages (M. Nivat, A. Podelski, Eds.), Elsevier Science Publishers, Amsterdam 1992, pp. 159–188.
4. A. Arnold, Finite Transition Systems, Masson, Paris, and Prentice-Hall, Hemel Hempstead 1994.
5. A. Arnold, An initial semantics of the μ-calculus on trees and Rabin’s complementation theorem, Theor. Comput. Sci. 148 (1994), 121–132.