LTL Path Checking Is Efficiently Parallelizable (Q3638098)

From MaRDI portal
Revision as of 15:39, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
LTL Path Checking Is Efficiently Parallelizable
scientific article

    Statements

    title
    LTL Path Checking Is Efficiently Parallelizable (English)
    0 references
    author
    Lars Kuhtz
    0 references
    Bernd Finkbeiner
    0 references
    publication date
    14 July 2009
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    03B44
    0 references
    68Q60
    0 references
    zbMATH DE Number
    5578409
    0 references
    OpenAlex ID
    W1524646280
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3638098&oldid=31208748"
    Powered by MediaWiki