LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa.Alessandro Artale,Luca Geatti,Nicola Gigante,Andrea Mazzullo,Angelo MontanariTIME(2023)引用 0|浏览9暂无评分AI 理解论文溯源树样例生成溯源树,研究论文发展脉络Chat Paper正在生成论文摘要