Scribd
Upload
4 views

Spring20-Exercise6-Verification

The document presents a finite state machine model for a microwave controller, detailing state variables such as Door, Button, Timer, and Cooking. It includes a partial model in a specified format and outlines example properties using Computation Tree Logic (CTL) and Linear Time Logic (LTL). Additionally, it provides resources for verifying the model and properties using the NuSMV tool.

Uploaded by

chistafair.it
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Spring20-Exercise6-Verification

The document presents a finite state machine model for a microwave controller, detailing state variables such as Door, Button, Timer, and Cooking. It includes a partial model in a specified format and outlines example properties using Computation Tree Logic (CTL) and Linear Time Logic (LTL). Additionally, it provides resources for verifying the model and properties using the NuSMV tool.

Uploaded by

chistafair.it
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Exercise 6: Finite State

Verification
Gregory Gay
DIT635 - March 6, 2020
Finish In-Class Activity First!

2
Microwave
Consider a simple microwave controller modeled as a
finite state machine using the following state variables:
• Door: {Open, Closed} -- sensor input indicating
state of the door
• Button: {None, Start, Stop} -- button press
(assumes at most one at a time)
• Timer: 0...999 -- (remaining) seconds to cook
• Cooking: Boolean -- state of the heating element

2018-08-27 Chalmers University of Technology 3


Partial Model
MODULE microwave
VAR
Door: {Open, Closed}; init(Cooking) := FALSE;
Button: {None, Start, Stop}; next(Cooking) :=
Timer: 0..999; case
Cooking: boolean; -- Suggestion: Start by defining the
ASSIGN -- conditions that would cause
init(Door) := Closed; -- cooking to start. Then add conditions
init(Button) := None; -- that would make it stop.
init(Timer) := 0; -- Finally, ensure it will continue
next(Timer) := -- running if it is supposed to.
case (FILL THIS IN)
Timer > 0 & Cooking=TRUE : Timer - 1; TRUE: FALSE;
Timer > 0 & Cooking=FALSE & Button!=Stop : Timer; esac;
Button=Stop : 0;
Timer=0 : 0..999;
TRUE: Timer;
esac;

4
Example Properties
• CTL: The microwave shall stop cooking after the
door is opened.
• AG (Door = Open -> AX (!Cooking))
• LTL: It shall never be the case that the microwave
can continue cooking indefinitely.
• G (Cooking -> F (!Cooking))
• Formulate the other informal requirements in
temporal logic.

5
Linear Time Logic Formulae
Formulae written with propositional variables (boolean
properties), logical operators (and, or, not, implication),
and a set of modal operators:
hunger = “I am hungry” burger = “I eat a burger”
X (next) X hunger In the next state, I will be hungry.

G (globally) G hunger In all future states, I will be hungry.

F (finally) F hunger Eventually, there will be a state where I am hungry.

U (until) hunger U burger I will be hungry until I start to eat a burger. (hunger does not need to be
true once burger becomes true)

R (release) hunger R burger I will cease to be hungry after I eat a burger. (hunger and burger are true
at the same time for at least one state before hunger becomes false)
6
Computation Tree Logic Formulae
Combines all-path quantifiers with path-specific quantifiers:
A (all) A hunger Starting from the current state, I must be hungry on all paths.

E (exists) E hunger There must be some path, starting from the current state, where I
am hungry.

X (next) X hunger In the next state on this path, I will be hungry.

G (globally) G hunger In all future states on this path, I will be hungry.

F (finally) F hunger Eventually on this path, there will be a state where I am hungry.

U (until) hunger U burger On this path, I will be hungry until I start to eat a burger. (I must eventually
eat a burger)

W (weak until) hunger W burger On this path, I will be hungry until I start to eat a burger. (There is no
guarantee that I eat a burger)

7
Try to Verify the Model and Properties
• http://nusmv.fbk.eu/
• NuSMV homepage (tool download, tutorials, etc.)
• Use NuSMV 2.6.
• Try to define next(Cooking) such that the two
example properties hold. See if your properties
hold.
• If they don’t, make sure the properties are correct.
• Then, make sure the model is complete and correct.

You might also like