Verhoeff, T.: A Theory of Delay-Insensitive Systems, Ph.D. Thesis, Dept. of Math. and C.S., Eindhoven Univ. of Technology, May 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....are particularly convenient for designing asynchronous circuits when a high degree of concurrency is involved. Several tools have been generated for the automatic verification of asynchronous circuits with event based formalisms [15, 16] Examples of event based formalisms are Trace Theory [17 19], DI Algebra [20] Petri nets, and Signal Transition Graphs [21, 22] 3 Design Techniques This section introduces the most popular types of asynchronous circuits and briefly describes some of their design techniques. 3.1 Types of Asynchronous Circuits There are special types of asynchronous ....

T. Verhoeff, A Theory of Delay-Insensitive Systems. PhD thesis, Dept. of Math. and C.S., Eindhoven Univ. of Technology, May 1994.

....liveness condition in [LT87] also provides important insights. However, that condition does not cover some common fairness flaws (see Section 8) Two elegant models which capture progress properties based on finite traces, and have careful algebraic treatments, have been proposed in [Jos92] and [Ve94]. However, of the liveness faults, Ve94] treats only global deadlocks, where every process is blocked (no process has to perform an output action) but some process demands an input action. For simplicity, the treatment in [Jos92] does not model processes, such as clocks and ring oscillators, that ....

....important insights. However, that condition does not cover some common fairness flaws (see Section 8) Two elegant models which capture progress properties based on finite traces, and have careful algebraic treatments, have been proposed in [Jos92] and [Ve94] However, of the liveness faults, [Ve94] treats only global deadlocks, where every process is blocked (no process has to perform an output action) but some process demands an input action. For simplicity, the treatment in [Jos92] does not model processes, such as clocks and ring oscillators, that may never stop in a correct operation, ....

[Article contains additional citation context not shown here]

T. Verhoeff. A Theory of Delay-Insensitive Systems, Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.

.... process space formalism that uses finite sequences of events as executions, as well as the conditions and operations in this formalism and their algebraic properties, are closely related to several previous theories of concurrency, notably to [BR85] Di89] Eb89] Eb91] Ho85] Jo92] and [Ve94]. Methods for hierarchical and modular verification are common in concurrency theory. Properties similar to (10) linking relative and absolute notions of correctness, were given previously for instance in [Di89] Eb91] and [Ve94] Notice, however, that we have eliminated all alphabet ....

....notably to [BR85] Di89] Eb89] Eb91] Ho85] Jo92] and [Ve94] Methods for hierarchical and modular verification are common in concurrency theory. Properties similar to (10) linking relative and absolute notions of correctness, were given previously for instance in [Di89] Eb91] and [Ve94]. Notice, however, that we have eliminated all alphabet restrictions from hierarchical and modular verification and from property (10) arbitrary processes can be connected by product and compared by refinement, regardless of the relationships between their inputs, outputs, and other kinds of ....

[Article contains additional citation context not shown here]

T. Verhoeff. A Theory of Delay-Insensitive Systems. Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.

....process q represents a known part of the implementation and process r represents the unknown remaining part of the implementation. Statement 8 solves the design equation by showing that the minimal solution is p q. Related results can be found, for instance, in [Pr91] Ve94a] and [Ve94b]. One possible application of the design equation may be the design of software for embedded systems. In that case, p can be the (known) specification of the embedded system, q the (known) description of the underlying machine, and r the (unknown) specification for the software. Another possible ....

....diagram of a process space. The process space product, refinement, and reflection, and some of their properties, are strongly related to operators and relationships from other formalisms of concurrent systems, most notably to [BHR84] BR85] DNH83] Di89] Ho85] Eb89] Eb91] Jo92] and [Ve94b]. However, we are not aware of a previous treatment of concurrency with any of the characteristics of process spaces we mentioned in Section 1. In particular, it appears that the key idea of abstracting the notion of execution has not been proposed before our technical report [Ne95] The lack of ....

T. Verhoeff. A Theory of Delay-Insensitive Systems. Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.

....expressed in one formalism to one expressed in another one. So far there seems to be only one feasible way to compare two specifications with one another, viz. by comparing their (finite and minimal) state graphs. Furthermore, some properties of processes, for example dynamic nondeterminism [Ver94] are easier to contemplate using finite automatons. DI algebra [JU93] is a formalism that allows one to express delay insensitive specifications concisely and precisely, taking into account progress as a correctness criterion, and to manipulate expressions to prove properties about them. The ....

Tom Verhoeff. A Theory of Delay-Insensitive Systems. PhD thesis, Dept. of Math. and C.S., Eindhoven Univ. of Technology, May 1994.

....purpose. Admittedly, it is often much easier to deal with structural correctness than behavioral correctness. However, more complex structural correctness concerns require more powerful methods. Furthermore, it turns out that the methods needed to deal with network behavior are very similar (see [10]) We have made the formalism in this note more general than is strictly necessary, so that behavioral aspects can be incorporated with little effort. This note is an opportunity for the reader to become familiar with the general methods in a context where the results are fairly easy to predict by ....

....In Section 2, we present a pre abstract model. We start the presentation by defining the set SYS of all systems (process networks) On SYS we then define structural composition par and correctness criterion Correct. This induces relations sat and equ on SYS in a straighforward way (also see [10]) Relation sat captures refinement and equ expresses system equivalence. Thus we obtain a pre abstract model consisting of the algebra par, sat# with congruence equ. The model is called pre abstract because many networks are distinguished in SYS that we wish to identify since they are ....

[Article contains additional citation context not shown here]

T. Verhoeff. A Theory of Delay-Insensitive Systems. PhD thesis, Dept. of Math. and C.S., Eindhoven Univ. of Technology, May 1994.

....choice operator to the X 2 DI model, we are able to specify processes in the same easy manner as they are specified in the DI algebra, but have the added benefit of the factorization rewrite rule. There are a lot of open questions still in the X 2 DI model. Many question have been raised in [Ver94] In this paper we have given some answers, but some questions remain. For example: ffl Can all specifications that do not contain dynamic nondeterminism be implemented by a composition that does not contain arbiters ffl Is it decidable whether nondeterminism is dynamic And if so, is a ....

Tom Verhoeff. A Theory of Delay-Insensitive Systems. PhD thesis, Dept. of Math. and C.S., Eindhoven Univ. of Technology, May 1994.

No context found.

Verhoeff, T.: A Theory of Delay-Insensitive Systems, Ph.D. Thesis, Dept. of Math. and C.S., Eindhoven Univ. of Technology, May 1994.

No context found.

Tom Verhoe. A Theory of Delay-Insensitive Systems. PhD thesis, Eindhoven University of Technology, May 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC