1. Abrahamson, Karl, Modal Logic of Concurrent Nondeterministic Pograms, Proc. Conf. on Parallel Programs, Evian, France, 1979, 21–33.
2. Aho A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
3. Banachowski, L., A. Kreczmar, G. Mirkowska, H. Rasiowa, A. Salwicki., An Introduction to Algorithmic Logic; Metamathematical Investigations in the Theory of Programs, In Math. Found. of Comp. Sci. (eds. Mazurkiewicz and Pawlak), Banach Center Publications, Warsaw. 1977.
4. Berman, F., A completeness technique for D-axiomatizable semantics, Proc. 11th ACM Symp. on Theory of Comp. (May 1979), 160–166.
5. Ben-Ari, M., Halpern, J., and Pnueli, A., Finite Models for Deterministic Propositional Dynamic Logic, Proceedings of the 8th ICALP conference, Jerusalem 1981, Springer LNCS 115, pp. 249–263.