1. Arnborg, Stefan, Jens Lagergren, and Detlef Seese. 1991. Easy problems for tree-decomposable graphs. Journal of Algorithms 122: 308–340.
2. Baader, Franz, and Tobias Nipkow. 1998. Term rewriting and all that. Cambridge: Cambridge University Press.
3. Baeten, Jos, and Twan Basten. 2001. Partial order process algebra (and its relation to Petri nets). In Handbook of process algebra, ed. Jan Bergstra, Alban Ponse, and Scott Smolka, 769–872. Amsterdam: Elsevier.
4. Bedon, Nicolas. 2015. Logic and branching automata. Logical Methods in Computer Science 11 (4:2): 1–38.
5. Bérard, Béatrice, Stefan Haar, and Loïc Hélouët. 2018. Hyper partial order logic. In Proceedings of 38th FSTTCS, ed. Sumit Ganguly and Paritosh Pandya, vol. 122, 20:1–20:15. Ahmedabad: Lipics.