This seems to be a Python wrapper around AT&T's FSM library. It's fairly similar to Skip's implementation (below). You init an FSM, register transitions, and then throw inputs at it. Noah's implementation is pure Python code. Tulip itself is a package for synthesizing correct-by-construction systems from a logic specification and a model expressed as a transition system, including - among other - functions for abstracting the continuous dynamics of systems governed by differential equations to finite state transition systems.įSA seems to be all about creating finite state machines, but I don't see a whole lot on how to use them. The implemented algorithms include the synchronous product between transition systems and Buchi automata. GraphViz dot (inluding: TikZ (LaTeX), ipython qtconsole inline plot support of graphviz output) The toolbox includes an extension of networkx.MultiDiGraph to define typed labeling and also a subpackage for exporting the above classes to: The above support edge labeling, as well as state labeling (in that respect they are not pure Kripke structures and can be used to construct Labeled-transition systems, depending on the semantics assigned to the graph).
0 Comments
Leave a Reply. |