Figure 1 - uploaded by Baha El Kassaby
Content may be subject to copyright.
Download
View publication
1: Finite State Machine example

1: Finite State Machine example

Source publication
Figure 1.1: Finite State Machine example
Figure 1.2: Directed Transition System
Figure 1.4: Resource monitor from [HR04] and its equivalent NuSMV file
Figure 1.5: JGraph graph visualization example
+15 Figure 1.6: yFiles graph example with 10,000 nodes
A Java Graphical User Interface For The NuSMV Model Checker
Thesis
Full-text available
  • Sep 2007
Formal verification is the only process that can be used to prove that a system is faulty or not. One approach is model checking. Given a model representing all possible executions of a system, or an abstraction of these executions, and given a property which the system should satisfy, we check whether the model satisfies the property by a systemat...
Cite
Download full-text

Contexts in source publication

Context 1
... the contrary, automata have a finite number of states, a finite number of transitions and actions assigned to these transitions as shown on Figure 1.1 - see footnote 5 . ...
Context 2
... labeled ones are indeed diagrams with "labeled" transitions such that it is defined by a tuple (S, ∧, →) with S the set of states, ∧ the set of labels, and →⊆ S × ∧ × S a triadic relation. State transition systems with a finite number of states and transitions are represented as directed graph -see Figure 1.2 and footnote 6 . In [HR04], chapter 3, definition 3.4, unlabeled state transition system are defined as the following: "A transition system M = (S, →, L) is a set of states S endowed with a transition relation → (a binary relation on S), such that every s ∈ S has some s ′ ∈ S with s → s ′ , and a labeling function L : S → P (Atoms)". ...
Context 3
... type has to be written following a specific NuSMV programming language that enables to de- clare variables, to assign values to them, to implement loops and therefore to model a given directed state transition diagram. Apart from the STD example on Figure 1.2, NuSMV can also model the one on the following Figure 1.3 which also depicts the corresponding unwinding of the STD(example found in [ACR99], a paper giving an introduction on model-checking and giving an in-depth look at NuSMV and its features). ...
Context 4
... type has to be written following a specific NuSMV programming language that enables to de- clare variables, to assign values to them, to implement loops and therefore to model a given directed state transition diagram. Apart from the STD example on Figure 1.2, NuSMV can also model the one on the following Figure 1.3 which also depicts the corresponding unwinding of the STD(example found in [ACR99], a paper giving an introduction on model-checking and giving an in-depth look at NuSMV and its features). ...
Context 5
... the resource monitor example diagram and its corresponding NuSMV input file on Figure 1.4 shown in 1.4, we tried to build a NuSMV input file following the features of the previous paragraph. ...
Context 6
... the array return vertexIDList; } /** * Extract the transitions from the graph and store them in a * 2 dimensional array used in the NusmvFileWriter. * Example of the pre-processing done on data: * Set of Edges: [E1(V0,V1), E3(V3,V0), E2(V3,V1)...] * --> iVTransit {0,1, 3,0, 3,1, 2,3, 0,3, 1,1, 1,3, 2,0, 2,2, 3,3, 3,2, 2,1} ...