@inproceedings{b235bb87c4ad4dc095fc884902bfb891,
title = "Parallel temporal tableaux",
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.",
author = "Scott, {R. I.} and Fisher, {M. D.} and Keane, {J. A.}",
year = "1998",
language = "English",
isbn = "3540649522",
volume = "1470",
series = "Lecture Notes in Computer Science",
publisher = "Springer Nature",
pages = "852--861",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",
address = "United States",
note = "4th International Conference on Parallel Processing, Euro-Par 1998 ; Conference date: 01-07-1998",
}