The Safety-Progress Classification

We propose a classification of temporal properties into a hierarchy, called the safety-progress classification. The classes of the hierarchy are characterized through four views: a language-theoretic view, a topological view, a temporal logic view, and an automata view. In the topological view, the considered hierarchy coincides with the two lower levels of the Borel hierarchy, starting with the closed and open sets. For properties that are expressible by temporal logic and automata, we provide syntactic characterizations of the formulas and automata that correspond to properties in the different classes. We relate this classification to the well-known safety-liveness classification, and show that in some sense the two are orthogonal to one another.

[1]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[3]  Amir Pnueli,et al.  Tight bounds on the complexity of cascaded decomposition of automata , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4]  Bowen Alpern,et al.  Verifying temporal properties without temporal logic , 1989, TOPL.

[5]  Pierre Wolper Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[6]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[7]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[8]  A. Prasad Sistla,et al.  On characterization of safety and liveness properties in temporal logic , 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[9]  Michael Kaminski A Classification of omega-Regular Languages , 1985, Theor. Comput. Sci..

[10]  Robert S. Boyer,et al.  The Correctness Problem in Computer Science , 1982 .

[11]  Zohar Manna,et al.  Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs , 1984, Sci. Comput. Program..

[12]  Klaus W. Wagner,et al.  On omega-Regular Sets , 1979, Inf. Control..

[13]  Zohar Manna,et al.  The anchored version of the temporal framework , 1988, REX Workshop.

[14]  Zohar Manna,et al.  Specification and verification of concurrent programs by A∀automata , 1987, POPL '87.

[15]  Dov M. Gabbay,et al.  The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.

[16]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[17]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[18]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

[19]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[20]  Zohar Manna,et al.  Verification of concurrent programs, Part I: The temporal framework , 1981 .

[21]  Robert S. Streett,et al.  Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable , 1982, Inf. Control..

[22]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.