Schedulability analysis by exhaustive state space construction: translating CCSL to transition-based Generalized Buchi Automata