摘要：

We propose a classification of temporal properties int!o a, hierarchy which re- fines the known safety-Ziveness classifica,tion of properties. The new classification secognizes the cla.sses of safety, guarantee, persistence, fairness, and hyper-fairn,ess. The cla,ssifica,tion suggested here is based on the diRerent< wa,ys a, property of fin&e computa,tions can be extended into a property of infinite computations. For prop- erties that are expressible by temporal logic a.nd predica,te automa,ta, we provide a, synta.ctic cha,ra,cterization of the formulae and automata that specify properties in t,he different, classes. VVe consider the verifica,tion of properties over a, given program, and provide a. unique proof principle for each class.

展开