T. A. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for time transition systems. In Lecture Notes in Computer Science, Vol. 600: Real Time: Theory in Practice, pages 226--251, 1992.  Home/Search   Document Not in Database   Summary   Related Articles

....stabilizing solutions for maintaining spanning trees (due to Perlman) data links and virtual circuits (due to Spinelli) We have found even fewer timing based protocols in the literature that are formally verified. As regards verification methods, our approach builds on previous work [3 10]. We restrict our proofs of timing properties to the use of two bounded temporal concepts, namely bounded response and bounded invariance. These two concepts appear to be sufficient for reasoning about the timing properties of fault tolerant protocols [11] We use timing properties essentially to ....

....for at least 10 seconds) We choose these two operators because they are well understood and suffice for our purposes. Note also that the operator is equivalent to a bounded version of the F operator and the Delta= operator corresponds to a bounded version of the S operator in temporal logic [9, 10]. 2.3 Network Assumptions A computer network consists of N nodes and some number of communication channels that each connect a unique pair of nodes. Channels are bidirectional: the channel directed from an arbitrary node j to an arbitrary node k is denoted hj; ki and the channel directed from ....

[Article contains additional citation context not shown here]

T. A. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for time transition systems. In Lecture Notes in Computer Science, Vol. 600: Real Time: Theory in Practice, pages 226--251, 1992.

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