1. Aho, A. V., Hopcroft, J. E. & Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts 1974, 470 p.
2. Brookes, S. D., Hoare, C. A. R. & Roscoe, A. W.: A Theory of Communicating Sequential Processes. Journal of the ACM 31 (3) 1984, pp. 560–599.
3. Clarke, E. M., Emerson, E. A. & Sistla, A. P.: Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems 8 (2) 1986 pp. 244–263.
4. Lamport, L.: What Good is Temporal Logic? Information Processing '83, North-Holland pp. 657–668.
5. Lichtenstein, O. & Pnueli, A.: Checking that Finite State Concurrent Programs Satisfy their Linear Specification. Proceedings of the Twelfth ACM Symposium on the Principles of Programming Languages, January 1985 pp. 97–107.