A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
An Experimental Comparison of Theorem Provers for CTL
2011
2011 Eighteenth International Symposium on Temporal Representation and Reasoning
Preserved Fulltext
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 ...
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. ...
COMPUTATION TREE LOGIC Computation Tree Logic (CTL) is a temporal logic of discrete branching time. ...
doi:10.1109/time.2011.16
dblp:conf/time/GoreTW11
fatcat:7k7sy2dlrbesvmkcgyu46helpm
A resolution calculus for the branching-time temporal logic CTL
2014
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. ...
The branching-time temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. ...
Implementation The calculus has been implemented as the prover CTL-RP. ...
doi:10.1145/2529993
fatcat:yfvsxyxcebdnvow2wspi2xsuma
Global Caching for the Alternation-free μ-Calculus
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This suggests a slogan to the effect that global caching = game solving on-the-fly. A prototypical implementation shows promising initial results. ...
We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-free μ-calculus. ...
For MLSolver, CTL-RP and BDDCTL, formulas have first been compacted [18]. ...
arXiv:1609.06379v1
fatcat:7melkntcqfayhc7gylvrbm5nvq