Symbolic time separation of events

Amon, Tod Tracy; Hulgaard, Henrik

doi:10.1109/async.1999.761525

Cited by 5 publications

(6 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hulgaard and others Hulgaard 1995) also extended this work to systems with certain types of choices. Recently, symbolic timing verification has been studied by Amon and others (Amon et al 1997;Amon & Hulgaard 1999). Timing verification using difference decision diagrams has also been attempted by Mller et al (1999).…”

Section: Related Workmentioning

confidence: 99%

Efficient algorithms for approximate time separation of events

Chakraborty

Dill

Yun

2002

Sadhana

View full text Add to dashboard Cite

Finding bounds on time separation of events is a fundamental problem in the verification and analysis of asynchronous and concurrent systems. Unfortunately, even for systems without repeated events or choice, computing exact bounds on time separation of events is an intractable problem when both min and max type timing constraints are present. In this paper, we describe a method for approximating min and max type constraints, and develop a polynomial-time algorithm for computing approximate time separation bounds in choice-free systems without repeated events. Next, we develop a pseudo-polynomial time technique for analysing a class of asynchronous systems in which events repeat over time. Unlike earlier works, our algorithms can analyse systems with both min and max type timing constraints efficiently. Although the computed bounds are conservative in the worst-case, experimental results indicate that they are fairly accurate in practice. We present formal proofs of correctness of our algorithms, and demonstrate their efficiency and accuracy by applying them to a suite of benchmarks. A complete asynchronous chip has been modelled and analysed using the proposed technique, revealing potential timing problems (already known to designers) in the datapath design.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient algorithms for approximate time separation of events

Chakraborty

Dill

Yun

2002

Sadhana

View full text Add to dashboard Cite

show abstract

“…SHIFT [DGV96]) and timed automata techniques [LPY97,Yov97]. Close to our current problem, Amon and Hulgaard [HBAB95,AH99] have developed algorithms for computing bounds on the separation of events given bounds on operation times. All of these models specify the range of possible event times for each operation with an interval.…”

Section: Modelsmentioning

confidence: 99%

Temporal Properties of Self-Timed Rings

Winstanley

Greenstreet

2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Various researchers have proposed using self-timed networks to generate and distribute clocks and other timing signals. We consider one of the simplest self-timed networks, a ring, and note that for timing applications, self-timed rings should maintain uniform spacing of events. In practice, all previous designs of which we are aware cluster events into bursts. In this paper, we describe a dynamical systems approach to verify the temporal properties of self-timed rings. With these methods, we can verify that a new design has the desired uniform spacing of events. The key to our methods is developing an appropriate model of the timing behaviour of our circuits. Our model is more accurate than the simplistic interval bounds of timed-automata techniques, while providing a higher level of abstraction than non-linear differential equation models such as SPICE. Evenly spaced and clustered event behaviours are distinguished by simple geometric features of our model.

show abstract

“…The fact that timing analysis is performed by event structures, while verification can be performed in systems with any type of causality relation, opens the door to symbolic analysis. This can be achieved by using techniques similar to those proposed in [3] and based on quantifier-free Presburger arithmetic [25].…”

Section: Discussionmentioning

confidence: 99%

“…Still in many cases it might require just few iterations in unfolding the TS to reach the exact separation analysis. For example, [3] shows the fast convergence of separation times analysis for pipelined specifications, which are inherently not strongly synchronized.…”

Section: Definition 71 (Nodal State)mentioning

confidence: 99%

Formal verification of safety properties in timed circuits

Peña

Cortadella

Kondratyev

et al.

Proceedings Sixth International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2000) (Cat. No. PR00

View full text Add to dashboard Cite

The incorporation of timing makes circuit verification computationally expensive. This paper proposes a new approach for the verification of timed circuits. Rather than calculating the exact timed state space, a conservative overestimation that fulfills the property under verification is derived. Timing analysis with absolute delays is efficiently performed at the level of event structures and transformed into a set of relative timing constraints. With this approach, conventional symbolic techniques for reachability analysis can be efficiently combined with timing analysis. Moreover, the set of timing constraints used to prove the correctness of the circuit can also be reported for backannotation purposes. Some preliminary results obtained by a naive implementation of the approach show that systems with more than ½¼ untimed states can be verified. £ This work has been partially funded by a grant from Intel Corporation, ACiD-WG (ESPRIT 21949), and the Ministry of Education of Spain under contracts CICYTs TIC 98-0410 and TIC 98-0949.

show abstract

Symbolic time separation of events

Cited by 5 publications

References 17 publications

Efficient algorithms for approximate time separation of events

Efficient algorithms for approximate time separation of events

Temporal Properties of Self-Timed Rings

Formal verification of safety properties in timed circuits

Contact Info

Product

Resources

About