Editing State-transition table (section)

== Other forms ==
Simultaneous transitions in multiple finite-state machines can be shown in what is effectively an ''n''-dimensional state-transition table in which pairs of rows map (sets of) current states to next states.<ref name="Breen2005">{{Citation|last=Breen|first=Michael|title=Experience of using a lightweight formal specification method for a commercial embedded system product line|url=http://mbreen.com/experience.pdf|journal=Requirements Engineering Journal|volume=10|issue=2|pages=161–172|doi=10.1007/s00766-004-0209-1|year=2005|citeseerx=10.1.1.60.5228|s2cid=16928695}}</ref> This is an alternative to representing communication between separate, interdependent finite-state machines.

At the other extreme, separate tables have been used for each of the transitions within a single finite-state machine: "AND/OR tables"<ref name="LevesonEtAl1994">{{Citation|last1=Leveson|first1=Nancy|last2=Heimdahl|first2=Mats Per Erik|last3=Hildreth|first3=Holly|last4=Reese|first4=Jon Damon|title=Requirements Specification for Process-Control Systems|url=http://sunnyday.mit.edu/papers/tcas-tse.pdf|journal=IEEE Transactions on Software Engineering|volume=20|issue=9|pages=684–707|doi=10.1109/32.317428|year=1994|citeseerx=10.1.1.72.8657}}</ref> are similar to incomplete [[decision table]]s in which the decision for the rules which are present is implicitly the activation of the associated transition.