Alternatives and similar repositories for black

Users that are interested in black are comparing it to the libraries listed below

• whitemech / FOND4LTLf
  FOND4LTLf translates an LTLf/PLTLf-FOND to standard FOND planning problems
  ☆16Updated 7 months ago
• whitemech / lydia
  A tool for LDLf translation to DFA and for LDLf synthesis.
  ☆23Updated last year
• formalmethods / intrepid
  Intrepyd Model Checker
  ☆18Updated 3 years ago
• reactive-systems / syfco
  Synthesis Format Conversion Tool
  ☆24Updated last month
• utwente-fmt / sylvan
  Multi-core Decision Diagram (BDD/LDD) implementation
  ☆44Updated last year
• fraleo / OMTPlan
  A python framework for Optimal Planning Modulo Theories
  ☆11Updated last year
• arminbiere / runlim
  ☆16Updated last year
• sat-heritage / docker-images
  SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers
  ☆38Updated 2 years ago
• trolando / sylvan
  Implementation of multi-core (binary) decision diagrams
  ☆73Updated last year
• adl / hoaf
  Hanoi Omega-Automata Format
  ☆15Updated 2 years ago
• tulip-control / omega
  Specify and synthesize systems using symbolic algorithms
  ☆49Updated 7 months ago
• owl-toolkit / owl
  ☆18Updated last year
• vlab-cs-ucsb / LibStranger
  ☆12Updated 9 years ago
• Formal-Systems-Laboratory / ROSRV
  ☆15Updated 4 years ago
• cs-au-dk / MONA
  MONA - a decision procedure for monadic second-order logic on finite strings and trees
  ☆51Updated 5 years ago
• whitemech / LTLf2DFA
  From LTLf / PPLTL to Deterministic Finite-state Automata (DFA)
  ☆71Updated last year
• tcsprojects / pgsolver
  A collection of tools for generating, manipulating and - most of all - solving parity games.
  ☆35Updated 9 months ago
• seahorn / verify-c-common
  ☆17Updated last year
• lip6 / ITSTools
  A multi-formalism, multi-solution model-checker centered on the language GAL
  ☆25Updated 2 weeks ago
• Shufang-Zhu / Syft
  Synthesizer of LTLf formula
  ☆9Updated 3 months ago
• lonsing / depqbf
  DepQBF, a solver for quantified boolean formulae (QBF).
  ☆34Updated 2 years ago
• conp-solutions / mergesat
  configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…
  ☆41Updated last year
• utwente-fmt / ltsmin
  The LTSmin model checking toolset
  ☆60Updated 7 months ago
• vardigroup / FourierSAT
  A continuous local search SAT solver based on Fourier expansion for hybrid Boolean constraints.
  ☆12Updated 8 months ago
• bohlender / vim-smt2
  A Vim plugin that adds support for the SMT-LIB2 format (including Z3's extensions)
  ☆38Updated last month
• MarkusRabe / cadet
  A fast and certifying solver for quantified Boolean formulas.
  ☆27Updated last month
• meyerphi / strix
  Strix is a tool for reactive synthesis of controllers from LTL specifications.
  ☆22Updated 2 years ago
• vardigroup / lisa
  Lisa is a tool for (a). An LTLf to DFA conversion, and (b) An LTLf synthesis tool. Lisa supports both explicit and symbolic state-space r…
  ☆12Updated 3 years ago
• tyler-utah / PBL
  A simple Python Boolean library that can parse and manipulate dimacs as well as a custom language. Try some of the features out online he…
  ☆10Updated 9 years ago
• fslivovsky / qute
  Qute: a dependency learning QBF solver.
  ☆13Updated 5 months ago