Data Structures and Algorithms

    

dstr: A Small Language for Systems That Become Graphs

Authors: Sambuddha Majumder, Jayanta Majumder

dstr is a compact language for describing finite dynamic systems in a form that is both easyto write and semantically explicit. Its primary interface is a small s—expression DSL in which one states variables, initial conditions, actions, invariants, and reachability goals without the verbosity that often discourages exploratory modeling. The resulting description is not intended merely to support a checker run. It is intended to generate an explicit state graph that can subsequently be queried, transformed, filtered, and published. The central claim of this paper is that a state—action language becomes substantially more valuable when its semantics are treated as a first—class graph artifact, suitable not only for validation but also for downstream graph analysis and presentation.

Comments: 11 Pages.

Download: PDF

Submission history

[v1] 2026-04-24 01:00:35

Unique-IP document downloads: 9 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus