Ferrari, G.-L., Montanari, U., Mowbray, M., Tracing Causality in Distributed Systems (Extended Abstract), in Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991, Hildesheimer Informatik - Bericht 6/91, Universitat Hildesheim, pp.99-108 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Processes of Contextual Nets and their Characteristics - Winkowski (1998) (Correct)
....is compositional. j = Theta Theta Theta Theta Thetaffi Gamma R B B B B = R j = m A 0 = m G Omega With each concatenable process of any type we can associate a matrix like table similar to causal streams of [FMM 91] whose items describe how the resulting tokens of this process have been obtained from the initial ones by executing sequences of transitions of the respective contextual net. The table corresponding to the first type process 1 ; ae 1 in figure 8 is shown in figure 12. This table is partitioned ....
Ferrari, G.-L., Montanari, U., Mowbray, M., Tracing Causality in Distributed Systems (Extended Abstract), in Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991, Hildesheimer Informatik - Bericht 6/91, Universitat Hildesheim, pp.99-108
A Representation Of Processes Of Contextual Nets By Matrices - Winkowski (1997) (Correct)
.... m B 0 m A m A 0 j = m G Gamma Gamma Gamma m G Gamma R m G dc m G m G dc m G m B 0 m A 0 11 Figure 9 = m A 0 = m G fl m H Omega = m G fl m H m A 0 To each concatenable process of each type a partitioned matrix similar to causal streams of [FMM 91] corresponds whose items describe how resulting tokens of this process have been obtained from initial ones by executing sequences of actual (non imaginary) transitions. The matrix corresponding to the process 1 ; ae 1 of the first type in figure 6 is shown in figure 10. This matrix is ....
Ferrari, G.-L., Montanari, U., Mowbray, M., Tracing Causality in Distributed Systems (Extended Abstract), in Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991, Hildesheimer Informatik - Bericht 6/91, Universitat Hildesheim, pp.99-108
Processes of Contextual Nets and Their Characteristics - Winkowski (1998) (Correct)
.... m A 0 j = m G Gamma Gamma Gamma m G Gamma R m G dc m G m G dc m G m B 0 m A 0 Figure 11 = m A 0 = m G fl m H Omega = m G fl m H m A 0 With each concatenable process of any type we can associate a matrix like table similar to causal streams of [FMM 91] whose items describe how the resulting tokens of this process have been obtained from the initial ones by executing sequences of transitions of the respec 8 tive contextual net. The table corresponding to the first type process 1 ; ae 1 in figure 8 is shown in figure 12. This table is ....
Ferrari, G.-L., Montanari, U., Mowbray, M., Tracing Causality in Distributed Systems (Extended Abstract), in Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991, Hildesheimer Informatik - Bericht 6/91, Universitat Hildesheim, pp.99-108 / 26
A Representation Of Processes Of Petri Nets By Matrices - Winkowski (1996) (Correct)
....place indicated by the respective label. Boxes represent concrete executions of transitions indicated by the respective labels, each execution consuming and producing concrete tokens as indicated by directed edges. To each finite process of a net a partitioned matrix similar to causal streams of [FMM 91] corresponds whose items describe how resulting tokens of this process have been obtained from initial ones by executing transitions (cf. FMM 91] and [Wnk 95] The matrix corresponding to the process in figure 2 is shown in figure 3. This matrix is partitioned by names of places into two ....
Ferrari, G.-L., Montanari, U., Mowbray, M., Tracing Causality in Distributed Systems (Extended Abstract), in Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991, Hildesheimer Informatik - Bericht 6/91, Universitat Hildesheim, pp.99-108 16
A Partial Order Representation of Processes of Contextual Nets - Winkowski (1997) (Correct)
.... m B 0 m A m A 0 j = m G Gamma Gamma Gamma m G Gamma R m G dc m G m G dc m G m B 0 m A 0 11 Figure 9 = m A 0 = m G fl m H Omega = m G fl m H m A 0 To each concatenable process of each type a partitioned matrix similar to causal streams of [FMM 91] corresponds whose items describe how resulting tokens of this process have been obtained from initial ones by executing sequences of actual (non imaginary) transitions. The matrix corresponding to the process 1 ; ae 1 of the first type in figure 6 is shown in figure 10. This matrix is ....
Ferrari, G.-L., Montanari, U., Mowbray, M., Tracing Causality in Distributed Systems (Extended Abstract), in Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991, Hildesheimer Informatik - Bericht 6/91, Universitat Hildesheim, pp.99-108
Concatenable weighted pomsets and their applications to.. - Winkowski (1996) (Correct)
No context found.
Ferrari, G.-L., Montanari, U., Mowbray, M., Tracing Causality in Distributed Systems (Extended Abstract), in Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991, Hildesheimer Informatik - Bericht 6/91, Universitat Hildesheim, pp.99-108 / 20
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