Formalizing timing diagrams as causal dependencies for verification purposes

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

Abstract

In this paper we investigate timing diagrams as a means to specify causal dependencies. We introduce a stylized graphical representation of timing diagrams for which we define a formal basis. Furthermore, we compare our approach with well-known approaches from the area of program verification and show the semantic relationships. The major aim we follow by this work is a seamless integration of hardware design and software development providing a common semantic basis e.g. for verification. Therefore, the semantic relationships to frameworks for program verification show that the combination of these approaches is a good starting point for further development. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Fischer, J., & Conrad, S. (2000). Formalizing timing diagrams as causal dependencies for verification purposes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1945 LNCS, pp. 45–60). Springer Verlag. https://doi.org/10.1007/3-540-40911-4_4

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