Login / Signup

An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines.

Riccardo ForthPaul Molitor
Published in: ASP-DAC (2000)
Keyphrases
  • finite state machines
  • model checking
  • hidden markov models
  • finite state automata
  • state transition
  • databases
  • state space
  • simulated annealing
  • reinforcement learning
  • optimal solution