| Server IP : 82.208.35.60 / Your IP : 216.73.216.238 Web Server : Apache/2.4.55 (FreeBSD) OpenSSL/1.1.1q-freebsd PHP/7.3.31 System : FreeBSD server7.d2m.cz 12.4-RELEASE-p9 FreeBSD 12.4-RELEASE-p9 GENERIC amd64 User : studiokobylisy_cz ( 1008) PHP Version : 7.3.31 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : OFF | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /usr/ports/math/ctl-sat/ |
Upload File : |
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).