Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.
Saved in:
| Title: | Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. |
|---|---|
| Authors: | Gastin, Paul1 Paul.Gastin@lsv.ens-cachan.fr, Kuske, Dietrich2 kuske@informatik.uni-leipzig.de |
| Source: | Fundamenta Informaticae. 2007, Vol. 80 Issue 1-3, p169-197. 29p. 1 Diagram. |
| Subjects: | Logic, Concurrent Aggregates (Computer program language), Distributed computing, Mathematics, Programming languages |
| Abstract: | 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
