It is not necessary for a schedule to have blind write in order to be view serializable , only if u find a schedule which is not conflict serializable u go for checking whether it is view serializable or not ,Now if blind writes are there then there may be a possibility that the schedule is view-serializable and if blind writes are not present then the schedule is not even view serializable , So now if the schedule is view-serializable , if You are able to get a sequence of transactions so that they follow all the constraints which are necessary for a schedule to be view-serializable then u r done .
You need to make sure that the transaction which makes last update should also make last update in the view-equivalent schedule and the transaction which reads the initial data item should also read the initial data item in the view-equivalent schedule , since it is a NPC problem so you can't do it in polynomial time but if u r given 2 to 3 transactions u can easily verify if u can design a view-equivalent schedule or not .
