### Table 3. Operational semantics (part I)

2004

"... In PAGE 27: ... The reader not interested in such details can skip the rest of the section and proceed with the description of the security model. The operational semantics of the probabilistic process algebra is given by the labeled transition system (G; Act; T), whose states are process terms and the transition relation T is the least multiset satisfying the operational rules reported in Table3 and in Table 4. For a formal presentation of the semantics rules, the reader should refer to [BA03,ABG03], while here we just discuss some general aspects.... ..."

Cited by 8

### Table 4. Operational semantics (part II)

2004

"... In PAGE 27: ... The reader not interested in such details can skip the rest of the section and proceed with the description of the security model. The operational semantics of the probabilistic process algebra is given by the labeled transition system (G; Act; T), whose states are process terms and the transition relation T is the least multiset satisfying the operational rules reported in Table 3 and in Table4 . For a formal presentation of the semantics rules, the reader should refer to [BA03,ABG03], while here we just discuss some general aspects.... ..."

Cited by 8

### Table 3. Operational semantics (part I)

2004

"... In PAGE 27: ... The reader not interested in such details can skip the rest of the section and proceed with the description of the security model. The operational semantics of the probabilistic process algebra is given by the labeled transition system (G; Act; T), whose states are process terms and the transition relation T is the least multiset satisfying the operational rules reported in Table3 and in Table 4. For a formal presentation of the semantics rules, the reader should refer to [BA03,ABG03], while here we just discuss some general aspects.... ..."

Cited by 8

### Table 4. Operational semantics (part II)

2004

"... In PAGE 27: ... The reader not interested in such details can skip the rest of the section and proceed with the description of the security model. The operational semantics of the probabilistic process algebra is given by the labeled transition system (G; Act; T), whose states are process terms and the transition relation T is the least multiset satisfying the operational rules reported in Table 3 and in Table4 . For a formal presentation of the semantics rules, the reader should refer to [BA03,ABG03], while here we just discuss some general aspects.... ..."

Cited by 8

### Table 7. Operational semantics: Part I (symmetric rules omitted)

2002

Cited by 11

### Table 3 Operational semantics for CCSprio (Part II)

1996

Cited by 16

### Table 3 Operational semantics for CCSprio (Part II)

1997

### Table 5: Typical Semantic Fields of the Document Parts.

### Table 1. Element level semantic matchers (Part 1)

2006

"... In PAGE 4: ... As it turns out, this formula is unsatisfiable, hence, the less generality holds. 5 Notice, by applying element level matchers of Table1 we can only deter- mine the idk relation between games and entertainment. For example, in WordNet there is no direct lexical relation between games and entertain- ment.... In PAGE 6: ... For example, suppose we want to match C13 and C23. Parts of cLabsMatrix (notice, the relations in this matrix were computed by applying element level matchers of Table1 ) and cNodesMatrix with respect to the given matching task are shown in Table 6 and Table 7. Table 6.... In PAGE 6: ... These matchers have the third approximation level, which means that the relations they produce depend heavily on the context of the matching task. Also, execution times of them are much longer than of those of Table1 . Thus, they can not be applied in all the cases.... ..."

Cited by 12

### Table 4. Semantic Difierentials Results for the System Part

Cited by 1