2.7 KiB
dds: A Home-made Toolkit for Discrete Dynamical Systems in Racket
This is a toolkit for playing with various discrete dynamical systems in Racket. A discrete dynamical system is a system which evolves from a discrete state to some other discrete states (many or one). The systems are discrete in the sense that we can identify successive states with no other states in between. Equivalently, the phase state of the system is discrete (and is often called the state graph). These constraints imply the possibility of associating discrete, possibly branching timelines to any evolution of the system.
DISCLAIMER: I develop this toolkit as a support for my research on discrete dynamical systems. The primary objective for this framework is to fit my approach to these systems. Essentially, this framework should fit to the "shape of my mind", which is not necessarily the same as yours.
Currently, the toolkit includes the following files:
- generic.rkt: The generic interface for a discrete dynamical system, with functions for constructing state graphs.
- utils.rkt: Misc utility functions.
- networks.rkt: Implements network-based models, which generalise Boolean networks, threshold Boolean automata networks, multivalued networks, etc.
- rs.rkt: Implements reaction systems, a variant of set rewriting.
The toolkit is designed with Emacs Org-mode interoperability in mind. The file example/example.org explains the features available for interaction with Org-mode.
Roadmap
Here is my current roadmap for this toolkit, in order. The first element is what I am currently working on. The degree of certainty that I work on the subsequent items decreases with their position in the list.
TODO
Review build-interaction-graph
Check that the definition of this function really follows the definition of the interaction graph. Pay attention to the existential vs. universal quantifiers.
TODO Write the docs properly with Scribble
TODO
Submit update-graph to stchang
TODO Implement the BN → RS conversion
TODO Implement the minimisation of TBF/SBF
TODO Contribute to Racket
- Make sequence-filter allow multivalued sequences, provided the arity of the predicate is consistent with the arity of the sequence.
- Add a sequence->hash function that accepts a multivalued sequence of keys and values (exactly like what in-hash produces) and copies them into a hash table.