Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

An Experimental Comparison of Theorem Provers for CTL

Date

Authors

Gore, Rajeev

Thomson, James

Widmann, Florian

Publisher

IEEE Computer Society

Abstract

We compare implementations of five theorem provers for Computation Tree Logic (CTL) based on treetableaux, graph-tableaux, binary decision diagrams, resolution and games using formula-classes from the literature. In the process, we gather and analyse a set of test formulae which could form the basis of a suite of benchmark formulae for CTL.

Keywords

Keywords: Automated reasoning; Computation tree logic; Experimental comparison; Theorem provers; Automata theory; Forestry; Temporal logic; Binary decision diagrams; Algorithms; Computation; Experimentation; Forestry Automated reasoning; Computation tree logic; Experimental comparison

URI

http://hdl.handle.net/1885/37632

Collections

ANU Research Publications

Source

Proceedings of TIME 2011

Type

Conference paper

DOI

10.1109/TIME.2011.16

Restricted until

2037-12-31

Downloads

File

Description

01_Gore_An_Experimental_Comparison_of_2011.pdf (280.24 KB)

02_Gore_An_Experimental_Comparison_of_2011.pdf (277.51 KB)