search

akiellor / bananas

An experimental alternative to example based testing.
0 stars 0 forks source link

Allow for non-finite state machine transition sets. #9

Open akiellor opened 8 years ago

akiellor commented 8 years ago

16 may help here

Otherwise the brute algorithm should not presume it is an FSM. Adds complexity to visualisation, as it will not be visualising a full set of states, but a set of states that were 'searched' with some limit.

akiellor commented 8 years ago

Alternatively, we should just fail, and give the user some direction on how to make their model finite.

prad-a-RuntimeException commented 8 years ago

While traversing the states, we need to map the states to an hyper-state. A hyper state is a set of states, that are in-distinguishable based on the transition rules we have.