Author:
Henzinger Thomas A.,Rajamani Sriram K.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lect Notes Comput Sci;A.S.B.+.9.4._.A. Aziz,1994
2. M.C. Browne, E.M. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59:115–131, 1988. 303
3. J.A. Bergstra, J.W. Klop, and E.R. Olderog. Failures without chaos: a new process semantics for fair abstraction. In Formal Description Techniques III, pages 77–103. Elsevier, 1987. 301
4. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, 1990. 301
5. 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. 303
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Simulation Relations and Applications in Formal Methods;Lecture Notes in Computer Science;2022
2. Quasipolynomial Computation of Nested Fixpoints;Tools and Algorithms for the Construction and Analysis of Systems;2021
3. New results on pushdown module checking with imperfect information;Electronic Proceedings in Theoretical Computer Science;2011-06-04
4. Büchi Automata Can Have Smaller Quotients;Automata, Languages and Programming;2011
5. Multipebble Simulations for Alternating Automata;CONCUR 2010 - Concurrency Theory;2010