Coke Machine State Diagram
s1
s2
*
s3
s4
Assumption: At most one input among Coke, 5, 10,
and Return is asserted
* represents all unspecified transitions from state
Drop
*
Coke
5
10
5
*
*
Does this work?
10
Previous slide
Next slide
Back to first slide
View graphic version