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.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32637 |
| Date | 07 January 2019 |
| Creators | Gastin, Paul, Kuske, Dietrich |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 0169-2968, 1875-8681 |
Page generated in 0.0095 seconds