"Number of possible conflict equivalent serial schedules to some non-serial schedule is total number of topological sorts of its precedence graph."
I haven't read this method anywhere yet but I found it by myself while solving some problems, and tried on several problems which all are giving me a correct answer, please can anyone refer me to standard(reference) books about this!(I found that,too but failed)