Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
/**Copyright or (C) or Copr. GET / ENST, Telecom-Paris, Ludovic Apvrille
*
* ludovic.apvrille AT enst.fr
*
* This software is a computer program whose purpose is to allow the
* edition of TURTLE analysis, design and deployment diagrams, to
* allow the generation of RT-LOTOS or Java code from this diagram,
* and at last to allow the analysis of formal validation traces
* obtained from external tools, e.g. RTL from LAAS-CNRS and CADP
* from INRIA Rhone-Alpes.
*
* This software is governed by the CeCILL license under French law and
* abiding by the rules of distribution of free software. You can use,
* modify and/ or redistribute the software under the terms of the CeCILL
* license as circulated by CEA, CNRS and INRIA at the following URL
* "http://www.cecill.info".
*
* As a counterpart to the access to the source code and rights to copy,
* modify and redistribute granted by the license, users are provided only
* with a limited warranty and the software's author, the holder of the
* economic rights, and the successive licensors have only limited
* liability.
*
* In this respect, the user's attention is drawn to the risks associated
* with loading, using, modifying and/or developing or reproducing the
* software by the user in light of its specific status of free software,
* that may mean that it is complicated to manipulate, and that also
* therefore means that it is reserved for developers and experienced
* professionals having in-depth computer knowledge. Users are therefore
* encouraged to load and test the software's suitability as regards their
* requirements in conditions enabling the security of their systems and/or
* data to be ensured and, more generally, to use and operate it in the
* same conditions as regards security.
*
* The fact that you are presently reading this means that you have had
* knowledge of the CeCILL license and that you accept its terms.
*
* /**
* Class AvatarPragma
* Creation: 20/05/2010
* @version 1.1 01/07/2014
* @author Ludovic APVRILLE, Raja GATGOUT
* @see
*/
package cli;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
import java.io.File;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import cli.Interpreter;
import graph.AUTGraph;
import org.junit.Before;
import org.junit.Test;
import test.AbstractTest;
import ui.TAttribute;
import ui.avatarbd.AvatarBDPanel;
import ui.avatarbd.AvatarBDPragma;
public class CLIAvatarModelCheckerTest extends AbstractTest implements InterpreterOutputInterface {
final static String PATH_TO_TEST_FILE = "/cli/input/";
public CLIAvatarModelCheckerTest() {
//
}
public void exit(int reason) {
System.out.println("Exit reason=" + reason);
assertTrue(reason == 1);
}
public void printError(String error) {
System.out.println("Error=" + error);
}
public void print(String s) {
System.out.println("info from interpreter:" + s);
}
@Test
public void testCoffeeMachine() {
String filePath = getBaseResourcesDir() + PATH_TO_TEST_FILE + "scriptmodelchecker";
String script;
File f = new File(filePath);
assertTrue(myutil.FileUtils.checkFileForOpen(f));
script = myutil.FileUtils.loadFileData(f);
assertTrue(script.length() > 0);
boolean show = false;
Interpreter interpret = new Interpreter(script, (InterpreterOutputInterface)this, show);
interpret.interpret();
// Must now load the graph
filePath = "rgmodelchecker.aut";
f = new File(filePath);
assertTrue(myutil.FileUtils.checkFileForOpen(f));
String data = myutil.FileUtils.loadFileData(f);
assertTrue(data.length() > 0);
AUTGraph graph = new AUTGraph();
graph.buildGraph(data);
graph.computeStates();
System.out.println("states=" + graph.getNbOfStates() + " transitions=" + graph.getNbOfTransitions());
assertTrue(graph.getNbOfStates() == 14);
assertTrue(graph.getNbOfTransitions() == 16);
}
}