Abstract
The problems of self-timed behavior specification and verification are considered on the basis of an event model--Change Diagram (CD). The descriptive power of a CD model is demonstrated by comparing the CD with Signal Transition Graphs (STG). CD differs from STG by two types of causal relations (AND and OR) between events (in STG only AND-relation is presented). CD verification is shown to be reducible to an analysis of precedence and concurrency properties for events. These properties are hard to analyze directly by a cyclic CD. We suggest that the cyclic description be replaced by an equivalent acyclic one (called an unfolding) in order to solve the analysis problem. The notion of CD correctness is introduced, and the necessity and sufficiency of this notion for the implementation to be in self-timed class are shown. The polynomial algorithms for CD correctness verification are considered.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
