Timing Verification by Successive Approximation

Timing Verification by Successive Approximation (1995)

Cached

Download Links

[www.cis.upenn.edu]

Other Repositories/Bibliography

DBLP

by R. Alur , A. Itai , R. P. Kurshan , M. Yannakakis

Venue:	INFORMATION AND COMPUTATION
Citations:	44 - 11 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	Timing Verification by Successive Approximation	user correction - Legacy Corrections
AUTHOR NAME	R. Alur	user correction
AUTHOR AFFIL	AT&T Bell Laboratories	user correction
AUTHOR ADDR	Murray Hill, NJ 07974	user correction
AUTHOR NAME	A. Itai	user correction
AUTHOR AFFIL	AT&T Bell Laboratories	user correction
AUTHOR ADDR	Murray Hill, NJ 07974	user correction
AUTHOR NAME	R. P. Kurshan	user correction
AUTHOR AFFIL	AT&T Bell Laboratories	user correction
AUTHOR ADDR	Murray Hill, NJ 07974	user correction
AUTHOR NAME	M. Yannakakis	user correction
AUTHOR AFFIL	AT&T Bell Laboratories	user correction
AUTHOR ADDR	Murray Hill, NJ 07974	user correction
ABSTRACT	We present an algorithm for verifying that a model M with timing constraints satisfies a given temporal property T . The model M is given as a parallel composition of !-automata P i , where each automaton P i is constrained by bounds on delays. The property T is given as an !-automaton as well, and the verification problem is posed as a language inclusion question L(M ) ` L(T ). In constructing the composition M of the constrained automata P i , one needs to rule out the behaviors that are inconsistent with the delay bounds, and this step is (provably) computationally expensive. We propose an iterative solution which involves generating successive approximations M j to M , with containment L(M ) ` L(M j ) and monotone convergence L(M j ) ! L(M ) within a bounded number of steps. As the succession progresses, the approximations M j become more complex. At any step of the iteration one may get a proof or a counterexample to the original language inclusion question. The described algori...	user correction
YEAR	1995	user correction
VENUE	INFORMATION AND COMPUTATION	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	137--150	INFERENCE
VOLUME	118	INFERENCE
NUMBER	1	user correction
CITATIONS	24 found	ParsCit 1.0