SAT_for_TOKEN

Khoualdia, Asma; Cherif, Sami; Devismes, Stéphane; Robert, Léo

doi:10.4230/artifacts.26907

Artifact

SAT_for_TOKEN Software

Authors Asma Khoualdia , Sami Cherif , Stéphane Devismes , Léo Robert

Part of: Collection: Supplementary Materials
License: Open Software License 3.0
Publication Date: 2026-07-13

Document Identifiers

DOI: 10.4230/artifacts.26907
URN: urn:nbn:de:0030-drops-269072

Author Details

Asma Khoualdia

MIS UR 4290, Université de Picardie Jules Verne, Amiens, France

Sami Cherif

MIS UR 4290, Université de Picardie Jules Verne, Amiens, France

Stéphane Devismes

MIS UR 4290, Université de Picardie Jules Verne, Amiens, France

Léo Robert

MIS UR 4290, Université de Picardie Jules Verne, Amiens, France

Content

Software (Source Code and Benchmarks): https://github.com/asmakhoualdia98/async-token-circulation-sat
archived version

Version/Status

Content created at: 2026-05-07

Cite As Get BibTex

Asma Khoualdia, Sami Cherif, Stéphane Devismes, Léo Robert. SAT_for_TOKEN (Software, Source Code and Benchmarks). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/artifacts.26907

Description

This supplementary material contains a program designed for encoding Satisfiability (SAT) instances enabling to analyze self-stabilization properties of Dijkstra's asynchronous K-state token circulation. The framework generates benchmark instances in CNF format for formal verification of convergence and divergence behaviors under multiple execution assumptions.

Subject Classification

Programming Languages

Python

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

Metadata

0

Downloads

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail