Coder Social home page Coder Social logo

ctlab / fbsat Goto Github PK

View Code? Open in Web Editor NEW
5.0 6.0 3.0 2.69 MB

Tool for automatic inference of minimal finite-state models of function blocks from execution scenarios and temporal properties

License: GNU General Public License v3.0

Kotlin 99.60% Makefile 0.10% Python 0.25% Shell 0.03% Batchfile 0.01%
finite-state-automata inference synthesis sat-solver temporal-logic function-block

fbsat's People

Contributors

d-suvorov avatar lipen avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar

fbsat's Issues

Generalize cardinality

Eliminate duplicated code with cardinality constraints. Possible solution is a Cardinality class, which stores a totalizer and manages the comparator updates.

Modular synthesis

Implement synthesis of modular automata with various models of connectivity:

  • parallel
  • sequential
  • arbitrary

For now, we only focus on scenarios-only synthesis ("Basic" and "Extended" methods), leaving out the negative scenarios support ("Complete" method) for modular synthesis. But nothing stops us from supporting modular CEGIS in the future.

Dockerize

Add dockerfile to allow using fbSAT via Docker.

Convenient data structure for SAT variables

Implement a convenient data structure for SAT variables storage, similar to MultiArray (precisely, IntMultiArray), but specifically for boolean/integer variables, including automatic encoding of ExactlyOne constraints for "integer" variables.

Fix algorithm ST dump

Currently, the code inside BinaryAlgorithm::toST(...) has a bug in it - when the algorithm is T->T, F->F (z := z), it is erroneously displayed as z := NOT z.

fun toST(outputNames: List<String>): String {
require(outputNames.size == algorithm0.size) { "Wrong number of output names" }
return outputNames.indices.joinToString("") { i ->
val name = outputNames[i]
val a0 = algorithm0[i]
val a1 = algorithm1[i]
if (a0 == a1)
"$name:=${a0.toString().toUpperCase()};"
else
"$name:=NOT $name;"
}
}

The correct behavior is to display such algorithms as z := z or, as we convert to ST, not to display them at all, as z := z is a no-op.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.