TTCN-3操作系统详解：英文版标准文档

需积分: 3 116 浏览量更新于2024-08-02 收藏 1.06MB PDF 举报

"TTCN-3 part4 OS" TTCN-3（Testing and Test Control Notation version 3，测试与测试控制表示法版本3）是国际电信联盟（ITU）和欧洲电信标准协会（ETSI）制定的一种标准化的测试语言，用于系统、网络和服务的互操作性测试和规范。这个标准的第四部分，即"TTCN-3 Operational Semantics"，详细定义了TTCN-3的操作语义，是理解和应用TTCN-3进行测试的关键部分。这部分标准，ETSIES201873-4V4.1.1(2009-06)，涵盖了操作系统（OS）在TTCN-3中的使用，它是学习TTCN-3时必须掌握的资料。在测试领域，操作系统扮演着至关重要的角色，因为测试环境通常需要模拟实际的系统行为，包括处理并发、资源管理、错误处理等方面。 TTCN-3的操作语义描述了测试系统的动态行为，如何执行测试用例，以及如何与被测系统交互。它提供了一套严谨的语法和语义规则，使得测试代码能够精确地控制和验证被测系统的操作。在操作系统层面上，这可能涉及到线程管理、进程通信、内存管理等核心功能。关键词如“interoperability”（互操作性）、“methodology”（方法论）和“testing”（测试）强调了TTCN-3标准的目的是促进不同系统之间的兼容性和一致性。TTCN-3的设计使得测试过程可以被形式化，提高了测试的准确性和可重复性。此外，文档中提到的RES/MTS-00107-4T3ed411OS可能是该标准的一个具体实施参考，而“Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (06)”则表明了ETSI作为非营利组织的法律地位。为了获取最新的或特定版本的文档，用户可以通过ETSI的官方网站（http://www.etsi.org）下载。值得注意的是，如果出现版本间的差异，PDF版本被视为参考版本，且在ETSI秘书处的特定网络驱动器上保存的PDF版本打印件将作为争议解决时的依据。 TTCN-3的使用者应知道，这个标准可能会随着技术的发展和需求的变化而修订或更改状态，因此持续关注ETSI的更新是非常必要的。理解并熟练应用TTCN-3的操作语义，对于任何在通信、软件工程或相关领域的测试工程师来说都是至关重要的技能。

ETSI

ETSI ES 201 873

4 V4.1.1 (2009

06)

alt {

[x<5] P1.receive(MyMessageOne} {

setverdict(pass);

x := 7 + 5;

}

[] P1.receive(MyMessageTwo) {

x := 7 + 5;

}

[] T1.timeout {

setverdict(fail);

x := 7 + 5;

}

(a) TTCN-3 alt statement that is semantically equivalent to figure 4(a)

ALT

P1.receive(MyMessageOne)

x := 7 + 5;

setverdict(pass);

P1.receive(MyMessageTwo)

T1.timeout

setverdict(fail);

[x<5]

x := 7 + 5; x := 7 + 5;

(b) Graph representation of (a) (semantically equivalent to figure 4(b))

Figure 5: Graph representation of a TTCN-3 alt statement

ETSI

ETSI ES 201 873

4 V4.1.1 (2009

06)

Formally, an interleave statement can be described by a graph GI = (St, F) where:

St is the set of allowed TTCN-3 statements; and

F ⊆ (St



St) describes the flow relation.

The term allowed TTCN-3 statements refers to the static restrictions 1-5 above.

For the construction algorithm the following functions need to be defined:

• The REACHABLE

function returns all statements that are reachable from a statement s in a graph GI = (St, F):

REACHABLE

(s, GI) = { s } ∪

{ stmt | stmt ∈ St ∧ ∃( s = x

, x

, … , x

= stmt) where x

∈ St,

i ∈ {1…n} ∧ (x

, x

i+1

)∈ F}

• The SUCCESSORS

function returns all successors of a statement s in a graph GI = (St, F):

SUCCESSORS

(s, GI) = { stmt | stmt ∈ St ∧ (s, stmt) ∈ F}

• The ENABLED

function returns all statements of a graph GI = (St, F) which have no predecessors:

ENABLED

(GI) = { stmt | stmt ∈ St ∧ (F ∩ (S



{s}) = ∅)}

• The KIND

function returns the kind or type of a TTCN-3 statement in a graph representing an interleave

statement.

• The DISCARD

function deletes a statement s or a set of statements S from a graph GI = (St, F) and returns the

resulting graph GI'= (St', F'):

For single nodes:

DISCARD

(s, GI) = GI' where: GI' = (St', F'), with St' = St\{s} and

F' = F ∩ (St\{s}



St\{s}).

For sets of nodes:

DISCARD

(S, GI) = GI' where: GI' = (St', F'), with St' = St\S and F' = F ∩ (St\S



St\S).

• The RECEIVING

function takes a set of statements of a graph GI and returns all receiving statements:

RECEIVING

(S) = { stmt | stmt ∈ St ∧ KIND(stmt) ∈ {receive, trigger, getcall, getreply, catch, check,

done, timeout}}

• The RANDOM

function selects randomly an element s from a given set S and returns s.

RANDOM

(S) = s where s ∈ S

The construction algorithm (see figure 7) of the tree is a recursive procedure where in each recursive call the successor

nodes for a given node is constructed. The procedure is provided in a C-like pseudo-code notation that uses the

functions defined above and some additional mathematical notation.

ETSI

ETSI ES 201 873

4 V4.1.1 (2009

06)

CONSTRUCT-SUCCESSORS (statementType *predecessor, graphType GI) {

// - statementType refers to the type of a node of the tree that is constructed

// - *predecessor refers to the last node that has been created

// - graphType denotes type of the graph of TTCN-3 statements

// - GI is called by value and refers to the subgraph consisting of all remaining TTCN-3

// statements that have to be taken into consideration

var graphType myGraph;

var statementType i, myStmt;

var statementType *newStmt, *firstInBranch; // pointers for new statement nodes in the

// tree that is constructed recursively

// Retrieving sets of TTCN-3 statements that have no predecessors in 'GI'

var statementSet enabStmts := ENABLED

(GI); // all statements without predecessor

var statementSet enabRecStmts := RECEIVING

(enabStmts); // receiving statements in 'enabStmts'

var statementSet enabNonRecStmts := enabStmts\enabRecStmts;

// non receiving statements in 'enabStmts'

if (GI.St == ∅) { // We assume that GI.St refers to the set of statements in GI

return; // No statements are left, termination criterion of Recursion

}

elseif (enabNonRecStmts != ∅) { // Handling of non receiving statements in 'enabStmts'

myStmt := RANDOM

(enabNonRecStmts);

// There can only be one statement in 'enabNonRec', because the Algorithm

// continues the construction until there is a branch that contributes to

// the interlave statement.

newStmt := create(myStmt, predecessor);

// Creation of a new tree node representing 'myStmt' in the tree

// and update of pointers in 'newStmt' and 'predecessor'.

if (KIND

(myStmt) == IF || KIND(myStmt) == BLOCKING_CALL) {

for each i in SUCCESSORS

(myStmt, GI) {

firstInBranch := create(i, newStmt);

// Creation of a second node for the first statement of in a branch due to

// an if-else statement.

// Note, this create statement will be used to create tree nodes

// representing the receiving statements in blocking call operations.

myGraph := DISCARD

({i, myStmt} ∪ REACHABLE(myStmt, GI)\REACHABLE(i, GI))

// Removal of i, myStmt and all statements that are reachable from

// myStmt but not reachable from i. The latter considers the branching of

// a flow of control in a subgraph of GI.

CONSTRUCT-SUCCESSORS(firstInBranch, myGraph); // NEXT RECURSION STEP

}

elseif (KIND

(myStmt) == ALT) {

for each (i in SUCCESSORS

(myStmt, GI) {

CONSTRUCT-SUCCESSORS(mystmt, DISCARD

(REACHABLE(myStmt, GI)\REACHABLE(i, GI)));

// NEXT RECURSION STEP, the DISCARD

(REACHABLE(myStmt, GI)\REACHABLE(i, GI))

// argument considers the branching of a flow of control due to different

// receiving events.

}

else { // mystmt is a stand-alone statement

CONSTRUCT-SUCCESSORS(newSonNode, DISCARD

(myStmt, GI));

// NEXT RECURSION STEP

}

else { // Handling of receiving events that interleave

if (KIND

(predecessor) != ALT) { // an alt node is missing and has to be created, if the

// interleaving is not influenced by an embedded alt statement

predecessor := create(ALT, predecessor);

}

for each i in enabRecStmts) {

newStmt := create(i, predecessor); // New tree node

CONSTRUCT-SUCCESSORS(newStmt, DISCARD

(i, GI)); // NEXT RECURSION STEP(S)

}

Figure 7: Replacement algorithm for TTCN-3 interleave statements

剩余167页未读，继续阅读

gavinliu123

粉丝: 0
资源: 2

TTCN-3操作系统详解：英文版标准文档

An Introduction to TTCN-3

TTCN-3 编程语言 ETSI ES 201 873-1

ttcn-3 tutorial

TTCN-3 Operational Semantics

TTCN-3 测试语言

TTCN-3 Runtime Interface

TTCN-3 Control Interface

T3DevKit TTCN-3的开发工具

TTCN-3-Introduction 西门子的培训.pdf

TTCN-3 core language v4.1.1

最新资源