Extended Finite-State Machine Induction Using SAT-Solver

@article{Ulyantsev2011ExtendedFM,
  title={Extended Finite-State Machine Induction Using SAT-Solver},
  author={Vladimir I. Ulyantsev and Fedor Tsarev},
  journal={2011 10th International Conference on Machine Learning and Applications and Workshops},
  year={2011},
  volume={2},
  pages={346-349}
}
In the paper we describe the extended finite-state machine (EFSM) induction method that uses SAT-solver. Input data for the induction algorithm is a set of test scenarios. The algorithm consists of several steps: scenarios tree construction, compatibility graph construction, Boolean formula construction, SAT-solver invocation and finite-state machine construction from satisfying assignment. These extended finite-state machines can be used in automata-based programming, where programs are… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS
20 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 20 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Cryptominisat 2.5.0

  • M. Soos
  • SAT Race competitive event booklet, July 2010…
  • 2010
Highly Influential
5 Excerpts

Method of finite state machine induction from tests with genetic programming

  • F. Tsarev
  • Information and Control Systems…
  • 2010
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…