| B. Jonsson, Compositional Veri cation of Distributed Systems. Ph.D. thesis, Department of Computer Systems, Uppsala University, 1987. |
....t ) v 1 w 1 ; v t w t ) Histories v; w of the same length are compatible if any value on an output channel appears at the input channel connected to it (if any) at the next time step. Note that the above composition makes the model essentially a probabilistic version of I O systems [Jon87] As usual in models of data ow, noncommunicating parallel composition and feedback are instantiations of the general composition. In the following we always require that systems are only composed in a way such that low (resp. high) output channels are connected to low (resp. high) input ....
B. Jonsson. Compositional Verication of Distributed Systems. PhD thesis, Department of Computer Systems, Uppsala University, 1987. Tech. Rep. DoCS 87/09.
....both I and J are reduced, it is routine to check that s a t and 0 are g f related via index relation J I . Thus g f satis es condition (2) in the de nition of a branching forward simulation. Variants of the partial completeness result below appear in several papers, see for instance [Jon87, LV95] Since higher level speci cations are often deterministic, this result explains why in practice (normed) forward simulations can so often be used to prove behavior inclusion. Theorem 4.9 (Partial completeness of normed branching forward simulations) If B is deterministic and A T B ....
B. Jonsson. Compositional Verication of Distributed Systems. PhD thesis, Department of Computer Systems, Uppsala University, 1987. DoCS 87/09.
No context found.
B. Jonsson, Compositional Veri cation of Distributed Systems. Ph.D. thesis, Department of Computer Systems, Uppsala University, 1987.
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