23rd of June 2011: | Bugfix: initial relation for upward simulation was not set up correctly. |
25th of February 2011: | Feature: output format improved (by Ondrej Lengal). |
3rd of February 2011: | Bugfix: usage info was printed even in the case of correct invocation. |
28th of January 2011: | Bugfix: relation not updated correctly during initialisation phase. |
SA tool is a utility for computing simulations over labelled transition systems (LTS) and tree automata (TA) based on the paper presented at MEMICS'09.
<file> : 'Ops' <label_list> <automaton> <automaton> ... <label_list> : <label_decl> <label_decl> ... // a list of label declarations <label_decl> : string ':' int // a symbol declaration (the name and the arity) <automaton> : 'Automaton' string 'States' <state_list> 'Final States' <state_list> 'Transitions' <transition_list> <state_list> : <state> <state> ... // a list of states <state> : string // the name of a state <transition_list> : <transition> <transition> ... // a list of transitions <transition> : <label> '(' <state> ',' <state> ',' ... ')' '->' <state> // a transition <label> : string // the name of a labelAn example could look like this:
Ops a:0 b:1 c:2 Automaton A States q0 q1 q2 Final States q2 Transitions a() -> q0 b(q0) -> q1 c(q1, q1) -> q1 c(q1, q1) -> q2 c(q2, q2) -> q2
The program is written in OCaml which is required to compile the source code. It is licensed under GPL.
If you have further questions, do not hesitate to contact authors (Lukas Holik, Jiri Simacek).