Generalized temporal verification diagrams
Verification diagrams are a succinct and intuitive way of representing proofs that reactive systems satisfy a given temporal property. We present a generalized verification diagram that allows representation of a proof of any property expressible by a temporal formula. We show that representation of a proof by generalized verification diagram is sound and complete.
KeywordsRanking Function Infinite Sequence Acceptance Condition Verification Condition Path Segment
Unable to display preview. Download preview PDF.
- [LPS81]D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. In Proc. 8th Int. Colloq. Aut. Lang. Prog., volume 115 of LNCS, pages 264–277. Springer-Verlag, 1981.Google Scholar
- [MP91]Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.Google Scholar
- [MP94]Z. Manna and A. Pnueli. Temporal verification diagrams. In Proc. Int. Symp. on Theoretical Aspects of Computer Software, volume 789 of LNCS, pages 726–765. Springer-Verlag, 1994.Google Scholar
- [MP95]Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.Google Scholar
- [MW84]Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Sys., 6(1):68–93, Jan. 1984.Google Scholar
- [Tho90]Wolfgang Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133–191. Elsevier Science Publishers (North-Holland), 1990.Google Scholar