Name
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.
|
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0057940 | Euro-Par |
Keywords | Field | DocType |
parallel temporal tableaux,shared memory,parallel processing,temporal logic,decision problem,parallel systems,theorem prover | Discrete mathematics,Decision problem,Interval temporal logic,Shared memory,Parallel algorithm,Computer science,PSPACE-complete,Algorithm,Propositional calculus,Theoretical computer science,Linear temporal logic,Temporal logic | Conference |
Volume | ISSN | ISBN |
1470 | 0302-9743 | 3-540-64952-2 |
Citations | PageRank | References |
3 | 0.40 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. I. Scott | 1 | 3 | 0.74 |
| M. D. Fisher | 2 | 15 | 6.17 |
| J. A. Keane | 3 | 96 | 7.33 |