Uniform satistiability in PSPACE for local temporal logics over Mazurkiewicz traces

被引:0
|
作者
Gastin, Paul [1 ]
Kuske, Dietrich
机构
[1] CNRS, ENS, LSV, Cachan, France
[2] Univ Leipzig, Inst Informat, D-7010 Leipzig, Germany
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We study the complexity of temporal logics over concurrent systems that can be described by Mazurkiewicz traces. We develop a general method to prove that the uniform satisfiability problem of local temporal logics is in PSPACE. We also demonstrate that this method applies to all known local temporal logics.
引用
收藏
页码:169 / 197
页数:29
相关论文
共 50 条