Visual abstractions for temporal verification

22Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Generalized Verification Diagrams combine deductive and algorithmic verification to establish general temporal properties of finite-and infinite-state reactive systems. The diagram serves as an abstraction of the system. This abstraction is deductively justified and algorithmi-cally model checked. We present a new simple class of verification diagrams, using Mu¨ller acceptance conditions, and show how they can be used to verify general temporal properties of reactive systems.

Cite

CITATION STYLE

APA

Manna, Z., Browne, A., Sipma, H. B., & Uribe, T. E. (1998). Visual abstractions for temporal verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1548, pp. 28–41). Springer Verlag. https://doi.org/10.1007/3-540-49253-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free