Parallel temporal tableaux

R. I. Scott, M. D. Fisher, J. A. Keane

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Temporal logic is useful for reasoning about time-varying properties. To achieve this it is important to validate temporal logic specifications. The decision problem for propostional temporal logic is PSPACE complete and thus automated tableau-based theorem provers are both computationally and resource intensive. Here we analyse a standard temporal tableau method using parallelism in an attempt to both reduce the amount of storage needed and improve efficiency. Two shared memory parallel systems are presented which are based on this decomposition of the algorithm but differ in the configuration of parallel processes.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.
    PublisherSpringer Nature
    Pages852-861
    Number of pages9
    Volume1470
    ISBN (Print)3540649522, 9783540649526
    Publication statusPublished - 1998
    Event4th International Conference on Parallel Processing, Euro-Par 1998 - Southampton
    Duration: 1 Jul 1998 → …

    Publication series

    NameLecture Notes in Computer Science

    Conference

    Conference4th International Conference on Parallel Processing, Euro-Par 1998
    CitySouthampton
    Period1/07/98 → …

    Fingerprint

    Dive into the research topics of 'Parallel temporal tableaux'. Together they form a unique fingerprint.

    Cite this