In this talk we describe a simple measure, related to Tree/Clique width, on the structure of the runs of concurrent recursive programs and illustrate its use in the verification of properties expressed in Monadic Second-order Logic. (Joint work with Aiswarya Cyriac and Paul Gastin).
