In Preparation

• Static analysis of logic programs via Boolean networks
  Van-Giang Trinh and Belaid Benhamou. [arXiv]
• mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks.
  Van-Giang Trinh, Belaid Benhamou, and Loïc Paulevé. [arXiv]

Submitted

• Mapping the attractor landscape of Boolean networks.
  Van-Giang Trinh, Kyu Hyong Park, Samuel Pastva, and Jordan C Rozum.
  Oxford Bioinformatics, under review. [bioRxiv]
• Computing attractors of large-scale asynchronous Boolean networks using minimal trap spaces.
  Van-Giang Trinh, Belaid Benhamou, Tarek Khaled, and Kunihiko Hiraishi.
  IEEE/ACM Transactions on Computational Biology and Bioinformatics, under review.

Articles in Refereed Conferences

2025

• Graphical analysis of abstract argumentation frameworks via Boolean networks
  Van-Giang Trinh, Belaid Benhamou, and Vincent Risch.
  In ICAART 2025 (to appear). [HAL]
• Detecting misleading information with LLMs and explainable ASP
  Quang-Anh Nguyen, Thu-Trang Pham, Thi-Hai-Yen Vuong, Van-Giang Trinh, and Ha-Thanh Nguyen.
  In ICAART 2025 (to appear). [HAL]

2024

• Graphical conditions for the existence, unicity and number of regular models
  Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman, and Francois Fages.
  In ICLP 2024 (to appear). [HAL]
• Scalable enumeration of trap spaces in Boolean networks via answer set programming
  Van-Giang Trinh, Belaid Benhamou, Samuel Pastva, and Sylvain Soliman.
  In AAAI 2024 (AAAI, pages 10714-10722), oral presentation. [doi - supplement]

2023

• Efficient enumeration of fixed points in complex Boolean networks using answer set programming
  Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman.
  In CP 2023 (LIPIcs, volume 280, pages 35:1–35:19). [doi]
• Trap spaces of multi-valued networks: Definition, computation, and applications
  Van-Giang Trinh, Belaid Benhamou, Thomas Henzinger, and Samuel Pastva.
  In ISMB/ECCB 2023 (OUP, 39(Supplement_1), i513–i522). [doi - supplement] 

2022

• Computing attractors of large-scale asynchronous Boolean networks using minimal trap spaces
  Van-Giang Trinh, Kunihiko Hiraishi, and Belaid Benhamou.
  In ACM-BCB 2022 (ACM, pages 1–10). [doi - HAL]
• Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
  Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman.
  In CMSB 2022 (Springer, pages 158–176). [doi - HAL]

2021

• An improved method for finding attractors of large-scale asynchronous Boolean networks
  Van-Giang Trinh and Kunihiko Hiraishi.
  In CIBCB 2021 (IEEE, pages 1–9). [doi]

2020

• An efficient method for approximating attractors in large-scale asynchronous Boolean models
  Van-Giang Trinh and Kunihiko Hiraishi.
  In BIBM 2020 (IEEE, pages 1–9, workshop paper). [doi]

2019

• Algorithms for finding attractors of generalized asynchronous random Boolean networks
  Van-Giang Trinh and Kunihiko Hiraishi.
  In ASCC 2019 (IEEE, pages 67–72). [url]

2017

• Probabilistic modelling for congestion detection on wireless sensor networks
  Le Ngoc Kim Khanh, Van-Giang Trinh, Bui Hoai Thang, and Quan Thanh Tho.
  In CoDIT 2017 (IEEE, pages 0190–0195). [doi]

2016

• Fast-and-Fit: An intelligent auto-pricing system for airlines travel agencies
  Van-Giang Trinh, Nguyen Duc Khoan, Nguyen Duy Khuong, Vu Phu Thuc, and Quan Thanh Tho.
  In SAI 2016 (Springer, pages 853–865). [doi]
• Modeling and analysing Boolean networks by coloured Petri nets
  Van-Giang Trinh, Kunihiko Hiraishi, and Quan Thanh Tho.
  In IEICE Proceedings Series 2016 (IEICE, 61(4447)). [doi]

2015

• Reusing symbolic observation graph for efficient model checking
  Bao Trung Pham Duy, Van-Giang Trinh, Le Dinh Thuan, and Quan Thanh Tho.
  In KSE 2015 (IEEE, pages 250–255). [doi]

Articles in Refereed Journals

2023

• Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding.
  Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman.
  Theoretical Computer Science (TCS), 2023. [doi - HAL]
• Using answer set programming to deal with Boolean networks and attractor computation: Application to gene regulatory networks of cells.
  Tarek Khaled, Belaid Benhamou, and Van-Giang Trinh.
  Annals of Mathematics and Artificial Intelligence (AMAI), 2023. [doi - HAL]
• Trap spaces of multi-valued networks: Definition, computation, and applications.
  Van-Giang Trinh, Belaid Benhamou, Thomas Henzinger, and Samuel Pastva.
  Bioinformatics, 2023. [doi - supplement]

2020

• On attractor detection and optimal control of deterministic generalized asynchronous random Boolean networks.
  Van-Giang Trinh, and Kunihiko Hiraishi.
  IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 2020. [doi - paper - supplement]
• An FVS-based approach to attractor detection in asynchronous random Boolean networks.
  Van-Giang Trinh, Tatsuya Akutsu, and Kunihiko Hiraishi.
  IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 2020. [doi - paper]
• A study on attractors of generalized asynchronous random Boolean networks.
  Van-Giang Trinh, and Kunihiko Hiraishi.
  IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, 2020. [doi]

2016

• Modelling and congestion detection of wireless sensor networks: A concurrent-based approach using coloured Petri nets.
  Van-Giang Trinh, Le Ngoc Kim Khanh, Bang Ngoc Bao Tam, Tram Loi Quan, Bui Hoai Thang, and Quan Thanh Tho.
  International Journal of Applied Information Systems (IJAIS), 2016. [doi]

2014

• Assisting students in finding bugs and their locations in programming solutions.
  Pham Hong Long, Van-Giang Trinh, Dinh Hoang Mai, Mai Phuong Nam, Quan Thanh Tho, and Ngo Quang Hung.
  International Journal of Quality Assurance in Engineering and Technology Education (IJQAETE), 2014. [doi]

Theses

• Van-Giang Trinh:
  On Attractor Detection and Optimal Control of Boolean Networks
  PhD thesis, Japan Advanced Institute of Science and Technology, 155 pages, 2021. [HDL - paper]