Formalizing Timing Diagrams as Causal Dependencies for Verification Purposes

Authors:
Jörg Fischer;Stefan Conrad
Affiliations:
-;-
Venue:
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Year:
2000

Citing 15
Cited 0

Petri nets: an introduction

Petri nets: an introduction
Communicating sequential processes

Communicating sequential processes
Initial computability, algebraic specifications, and partial algebras

Initial computability, algebraic specifications, and partial algebras
Fundamentals of algebraic specification 2: module specifications and constraints

Fundamentals of algebraic specification 2: module specifications and constraints
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
The chemical abstract machine

Selected papers of the Second Workshop on Concurrency and compositionality
CHU spaces: a model of concurrency

CHU spaces: a model of concurrency
Modal and temporal logics for processes

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Models for concurrency: towards a classification

Theoretical Computer Science
Quantales, finite observations and strong bisimulation

Theoretical Computer Science
A Calculus of Communicating Systems

A Calculus of Communicating Systems
A Discipline of Programming

A Discipline of Programming
Fundamentals of Algebraic Specification I

Fundamentals of Algebraic Specification I
Petri Nets, Event Structures and Domains

Proceedings of the International Sympoisum on Semantics of Concurrent Computation
An introduction to event structures

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Quantified Score

Hi-index	0.00

Visualization

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.