View in EDS PDF Full Text

Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.

Saved in:
Bibliographic Details
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 27621315
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Gastin%2C+Paul%22">Gastin, Paul</searchLink><relatesTo>1</relatesTo><i> Paul.Gastin@lsv.ens-cachan.fr</i><br /><searchLink fieldCode="AR" term="%22Kuske%2C+Dietrich%22">Kuske, Dietrich</searchLink><relatesTo>2</relatesTo><i> kuske@informatik.uni-leipzig.de</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2007, Vol. 80 Issue 1-3, p169-197. 29p. 1 Diagram.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Logic%22">Logic</searchLink><br /><searchLink fieldCode="DE" term="%22Concurrent+Aggregates+%28Computer+program+language%29%22">Concurrent Aggregates (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+computing%22">Distributed computing</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=27621315
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 29
        StartPage: 169
    Subjects:
      – SubjectFull: Logic
        Type: general
      – SubjectFull: Concurrent Aggregates (Computer program language)
        Type: general
      – SubjectFull: Distributed computing
        Type: general
      – SubjectFull: Mathematics
        Type: general
      – SubjectFull: Programming languages
        Type: general
    Titles:
      – TitleFull: Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Gastin, Paul
      – PersonEntity:
          Name:
            NameFull: Kuske, Dietrich
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: 2007
              Type: published
              Y: 2007
          Identifiers:
            – Type: issn-print
              Value: 01692968
          Numbering:
            – Type: volume
              Value: 80
            – Type: issue
              Value: 1-3
          Titles:
            – TitleFull: Fundamenta Informaticae
              Type: main
ResultId 1