Decision graph

Jensen, E.V., Bayesian Networks and Decision Graphs, 1st ed.. Springer, New York, 2001. 

Multiway Decision Graphs, Reachability Analysis, Recurrent domains, p-terms... 

A Multiway Decision Graph (Mdg) is a finite, directed acyclic graph (DAG) where the leaves are labeled by Thie (T), the internal nodes are labeled by terms, and the edges issuing from an internal node v are labeled by terms of the same sort as the label of v. Such graph is a canonical representation of a certain quantifier-free formula, called a Directed Formula (DF). Each term in a DF belongs to either a concrete sort or an abstract sort. Concrete sorts have enumerations, while abstract sorts do not. 

Corella, F., Zhou, Z., Song, X., Langevin, M. k Cemy, E. (1997), Multiway decision graphs for automated hardware verification . Formal Methods in System Design 10(1), 7-46. Available as IBM research report RC19676(87224), July 1994. 

Jensen F.V. 2001. Bayesian Network and Decision Graphs. Statistics for Engineering and Information Science, Springer. 

Jensen, P., Nielsen, T.D. Bayesian networks and decision graphs. Springer, Berlin... 

Jensen, Finn V., 2001. Bayesian Networks and decision graphs, Springer-Verlag, New York. 

---