Deductive techniques are presented for deriving programs systematically from given specifications. The specifications express the purpose of the desired program without giving any hint of theâ€¦ (More)

Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In JJ89] C. Jard and T. Jeron. On-line model-checking for nite linearâ€¦ (More)

The interleaving model is both adequate and sufficiently abstract to allow for the practical specification and verification of many properties of concurrent systems. We incorporate real time intoâ€¦ (More)

By the induction hypothesis, s l 2 sat(g 2) and therefore s l 2 sat(g 1 U g 2). By the deenition of R T , it follows that s l?1 2 sat(X(g 1 U g 2)). But l?1 j = g 1 , so, by induction s l?1 2 sat(gâ€¦ (More)

Veriication diagrams are a succinct and intuitive way of representing proofs that reactive systems satisfy a given temporal property. We present a generalized veriication diagram that allowsâ€¦ (More)