A parallel linear temporal logic tableau

John McCabe-Dansted, Mark Reynolds

Research output: Chapter in Book/Conference paperConference paper

3 Citations (Scopus)

Abstract

For many applications, we are unable to take full advantage of the potential massive parallelisation offered by supercomputers or cloud computing because it is too hard to work out how to divide up the computation task between processors in such a way to minimise the need for communication. However, a recently developed branch-independent tableaux for the common LTL temporal logic should intuitively be easy to parallelise as each branch can be developed independently. Here we describe a simple technique for partitioning such a tableau such that each partition can be processed independently without need for interprocess communication. We investigate the extent to which this technique improves the performance of the LTL tableau on standard benchmarks and random formulas.

Original languageEnglish
Title of host publicationProceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2017
Subtitle of host publicationProceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification
EditorsPatricia Bouyer, Andrea Orlandini , Pierluigi San Pietro
Place of PublicationWaterloo, NSW
PublisherOpen Publishing Association
Pages166-179
Number of pages14
Volume256
DOIs
Publication statusPublished - 6 Sep 2017
EventEighth International Symposium on Games, Automata, Logics and Formal Verification - Rome, Italy
Duration: 20 Sep 201722 Sep 2017
http://gandalf2017.istc.cnr.it/

Conference

ConferenceEighth International Symposium on Games, Automata, Logics and Formal Verification
Abbreviated titleGandALF 2017
CountryItaly
CityRome
Period20/09/1722/09/17
Internet address

Fingerprint Dive into the research topics of 'A parallel linear temporal logic tableau'. Together they form a unique fingerprint.

Cite this