Return to search

Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces

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.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32637
Date07 January 2019
CreatorsGastin, Paul, Kuske, Dietrich
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relation0169-2968, 1875-8681

Page generated in 0.0018 seconds