Temporal Verification by Diagram Transformations

This paper presents a methodology for the verification of temporal properties of systems based on the gradual construction and algorithmic checking of fairness diagrams. Fairness diagrams correspond to abstractions of the system and its progress properties, and have a simple graphical representation.

[1]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[2]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

[3]  S. Safra.  On The Complexity of w-Automata , 1988 .

[4]  Henny B. Sipma,et al.  Generalized Temporal Verification Diagrams , 1995, FSTTCS.

[5]  Zohar Manna,et al.  Temporal Verification of Simulation and Refinement , 1993, REX School/Symposium.

[6]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[7]  Zohar Manna,et al.  Temporal Verification Diagrams , 1994, TACS.

[8]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[9]  Moshe Y. Vardi,et al.  On ω-automata and temporal logic , 1989, STOC '89.

[10]  Zohar Manna,et al.  Completing the Temporal Picture , 1991, Theor. Comput. Sci..

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