Timing verification of distributed network systems at higher levels of abstraction

Nowadays, distributed network systems are broadly using in embedded, real-time and networked control systems. Since they often operate under strict timing constraints, the timing verification is an important and critical phase during the design of them. On the other hand, as contemporary digital systems become more and more complex, taking advantage of the system-level design is gaining more widespread acceptance. Beginning from the transaction-level of abstraction is a common and effective method for deploying the system-level design. This paper presents a methodology for evaluation of timing constraints in a distributed network system specified at transaction-level of abstraction. Timing assertions are described by a simple language and mathematically defined using a computational model. In order to evaluate timing assertions, a simulation-based trace analysis approach is exploited. Finally, through a case study, the verification of a CAN-based fuzzy controller, we examine productivity and effectiveness of our methodology.