1. André Arnold and Paul Crubille. A linear algorithm to solve fixed-point equations on transitions systems. Information Processing Letters, 29:57–66, 1988.
2. Henrik Reif Andersen and Glynn Winskel. Compositional checking of satisfaction. In Larsen and Skou [LS91]. To appear.
3. H. Bekić. Definable operations in general algebras, and the theory of automata and flow charts. Lecture Notes in Computer Science, 177, 1984.
4. Rance Cleaveland. Tableau-based model checking in the propositional mucalculus. Acta Informatica, 27:725–747, 1990.
5. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.