Author:
Rabinovich Alexander,Schnoebelen Philippe
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference39 articles.
1. An n! lower bound on formula size;Adler,2001
2. The temporal logic of branching time;Ben-Ari;Acta Inform.,1983
3. Monadic logic of order over naturals has no finite base;Beauquier;J. Logic Comput.,2002
4. Design and synthesis of synchronization skeletons using branching time temporal logic;Clarke,1981
5. Automatic verification of finite-state concurrent systems using temporal logic specifications;Clarke;ACM Trans. Progr. Lang. Syst.,1986
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cheap CTL Compassion in NuSMV;Lecture Notes in Computer Science;2020
2. Arity hierarchy for temporal logics;Theoretical Computer Science;2008-08
3. Efficient timed model checking for discrete-time systems;Theoretical Computer Science;2006-03