The repository has the benchmark and tools of our CP2025 paper.
git clone --recurse-submodules git@github.com:meelgroup/bn-counting.git
You need to install cmake, g++, re2c, and bison.
sudo apt-get install bison
sudo apt-get install re2c
sudo apt install build-essential cmake
We used ApproxASP as the underlying ASP counter. It is added as a submodule.
First you need to compile ApproxASP. cd to ApproxASP and see the readme present in ApproxASP directory to compile ApproxASP. After sucessful compilation, mv approxasp binary to script directory.
cd to script. It has necessary input BN files.
Run Approxasp for t1_244.fix.lp with independent support IS_t1_244.fix.lp
./approxasp --conf 0.35 --sparse --useind IS_t1_244.fix.lp --asp t1_244.fix.lp
The command runs approxasp for
We used tsconj and fASP to process BNs to ASP program, for minimal trap space and fixed points, respectively.
Note: for only fixed points counting, some recently published work is here
The benchmark of our CP2025 experiments is available at https://zenodo.org/records/15141045.
If you use it, please cite our work:
@article{KTPM2025,
title={Scalable counting of minimal trap spaces and fixed points in boolean networks},
author={Kabir, Mohimenul and Trinh, Van-Giang and Pastva, Samuel and Meel, Kuldeep S},
booktitle={CP},
year={2025}
}