
Model Checking of TransitionLabeled FiniteState Machines
TransitionLabelled Finite State Machines (FSMs) has been shown [2] to be remarkably expressive with respect to other paradigms for modeling behavior, like. 2 EstivillCastro, Rosenblueth Petri Nets, Behavior Trees and even standard nitestate machines like those of executable UML [11] or StateWorks [17]. If models of behavior are to be auto matically converted into deployed systems, it is ...