Finding Extremal Models of Discrete Duration Calculus formulae using Symbolic Search

QDDC is a logic for specifying quantitative timing aspects of synchronous programs. Properties such as worst-case response time and latency (when known) can be specified elegantly in this logic and model checked. However, computing these values requires finding by trial and error the least/greatest...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in theoretical computer science Vol. 128; no. 6; pp. 247 - 262
Main Author:	Pandya, Paritosh K.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 23-05-2005
Subjects:	Discrete duration calculus Extremal models Response time computation SMV Symbolic model checking Symbolic model checking Discrete duration calculus Extremal models SMV Response time computation
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	QDDC is a logic for specifying quantitative timing aspects of synchronous programs. Properties such as worst-case response time and latency (when known) can be specified elegantly in this logic and model checked. However, computing these values requires finding by trial and error the least/greatest value of a parameter k making a formula D(k) valid for a program. In this paper, we discuss how an automata theoretic decision procedure for QDDC together with symbolic search for shortest/longest path can be used to compute the lengths of extremal (least/greatest length) models of a formula D. These techniques have been implemented into the DCVALID verifier for QDDC formulae. We illustrate the use of this technique by efficiently computing response and dead times of some synchronous bus arbiter circuits.
ISSN:	1571-0661 1571-0661
DOI:	10.1016/j.entcs.2005.04.015