Author:
Andersen Henrik Reif,Winskel Glynn
Publisher
Springer Berlin Heidelberg
Reference14 articles.
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. H. Bekić. Definable operations in general algebras, and the theory of automata and flow charts. Lecture Notes in Computer Science, 177, 1984.
3. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.
4. Rance Cleaveland. Tableau-based model checking in the propositional mu-calculus. Acta Informatica, 27:725–747, 1990.
5. E.M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. In Procedings of 4th Annual Symposium on Logic in Computer Science. IEEE, 1989.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献