57a5d1d576
CTL-SAT is a CTL (Computation Tree Logic) SAT solver. The user may test satisfiability of a CTL formula may by providing it as a command-line argument to the ctl-sat program, e.g.: ctl-sat "~( (A(pUq) ^ AG(q->r) ^ AG(r->EXr)) -> EFEGr )" The worst-case time complexity is O((2^n)^3) for this SAT solver, while the worst-case space complexity is O((2^n)^2). WWW: https://github.com/nicolaprezza/CTLSAT
4 lines
214 B
Plaintext
4 lines
214 B
Plaintext
TIMESTAMP = 1581352735
|
|
SHA256 (nicolaprezza-CTLSAT-g20200210-6de41e0_GH0.tar.gz) = f285cc5ab39359b45d3a1b22c725393458624dea82f11b29ed9828cf523aa7ed
|
|
SIZE (nicolaprezza-CTLSAT-g20200210-6de41e0_GH0.tar.gz) = 1197332
|