mirror of
https://git.FreeBSD.org/ports.git
synced 2025-01-13 07:34:50 +00:00
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
11 lines
406 B
Plaintext
11 lines
406 B
Plaintext
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
|