Quantitative Evaluation of
Embedded Systems
• Mutual introductions
• The context of the course:
Model Based / Driven Design
• Organisation of the course
Introducing the lecturers
Marco Zuniga (TUD)
Pieter Cuijpers (TU/e)
Anne Remke (UT)
Marielle Stoelinga (UT)
Why a tele-lecture ?
• Link between education and research
• 3TU cooperation :
Specialization in research vs
Broad engineering education
• Efficiency
Why a flipped class-room ?
• More time for questions
& (tele)-communication
• Rewind button
• Better insight in your progress
• More convenient homework
Last years evaluation (warning)
• Bad tele-connections
• Three (too) different topics
• Too many notational conventions
• Too abstract for hands-on
embedded systems enthousiasts
• Too much mandatory homework
Who are you?
BSc Electrical Eng
TU/e
TUD
UT
BSc Computer Science
Other
Who are you?
Logic & Settheory
TU/e
TUD
UT
Petrinets
Finite
Autom.
Linear
algebra
Prob.th.
Model
checking
The Engineering Design Cycle
Specification
Design
Implementation
THE COST OF FIXING SOFTWARE BUGS (BOEHM)
Deployment &
Maintenance
Model Based Design
Specification
Design
Implementation
Model Checking
Deployment &
Maintenance
Model Driven Design
Specification
Design
Implementation
State space exploration
Programming paradigms
Code Generation
Deployment &
Maintenance
Next Generation Computing
Quality = Quantity
 Deadlines
 Power usage
 Fault tolerance
 Performance
Trends:
 Complex
 Highly networked
 Failures = fact of life
Needed:
 Systematic Quant.
Analysis at Design-time
 Multi-disc. approach
 QEES!
Contents of the course
• 3 Typical quantitative formalisms:
Dataflow, Timed Automata, Markov Chains
• 1 Quantitative analysis method for Dataflow
• 3 Model-checking methods for TA and MC
• 3 Tools: SDF3, UPPAAL, PRISM
• 1 Case study
Case: Cyber Physical Systems
Computation
Communication network
Physical World
Case: Cyber Physical Systems
Determine
an appropriate
Comp.
Inner control schedule that
communication
guarantees given latency
and
Comp.
throughput constraints
for this
Emergency
detectionthe
control network and predict
Comp.
associated
network load.
Image processing
Physical World
General planning of QEES
• Dataflow - Timed Automata - Probabilistic Automata
• Tele-lectures & flipped classroom
• Watch videos at home…
…make exercises in class
• Some additional material in class
• One mandatory assignment (pass/fail)
(One case-study document – to be updated 3 times)
• One exam
Program for Dataflow
Date
Weblecture - at home
Additional – in class
Exercises – in class
11-11-’13
1 – intro dataflow
Intro to QEES
Counters and daters
Simulate a given graph
and set up matrix
equations for it.
Eigenvalues and
linear programs
Determine the MCM
and periodic schedule
for a graph.
Determine the latency
of a graph.
(This one we’ll watch in class)
15-11-’13
2 – throughput
3 – periodic schedule
(watch these at home, in the
train, wherever, but not in class!)
18-11-’13
4 – latency 1
5 – latency 2
Monotonicity
22-11-’13
6 – buffering
7 – latency 3
TDMA + intro assignment, Determine minimum
buffersizes of a graph.
multi-rate, intro to SDF3
Deadline: 9-DEC-2013 : As a first step in the case study, you will model a small cyber-physical control network in
SDF3, in which TDMA communication using wirelessHART is used. You will analyse worst-case latency and
throughput that is achieved, and add buffers to determine the network load.
Program for Timed Automata
Date
Weblecture - at home
Additional – in class
Exercises – in class
25-11-’13
Intro Timed Automata
Intro Timed Automata
Modeling and analysis
of a small resource
scheduling problem.
29-11-’13
ES-Day in Delft : GUEST LECTURE Arjen Mooij : Model Based Design
2-12-’13
UPPAAL under the hood UPPAAL under the hood
Practice semantics
and composition
6-12-’13
UPPAAL under the hood
Practice R.A.
9-12-’13
Paper – “Scheduling of
data paths in printers”
Discussion paper
Intro part 2 of the
assignment
Wrap up of exercises
Q&A
Deadline: 6-JAN-2013 : As a second step in the case study, you will use UPPAAL to make an optimal TDMA
schedule for the cyber-physical system and see how latency and throughput are improved. These results are
then fed back into the dataflow model.
Program for Markov Chains
Date
Weblecture - at home
Additional – in class
Exercises – in class
13-12-’13
CTL (This one we’ll watch in class)
Markov Chains
CTL
16-12-’13
CTL model checking
Discr. Timed Markov Chains CTL model checking
20-12-’13
PCTL model checking
6-1-’14
10-1-’14
Paper: “Wireless HART”
DTMC &
PCTL model checking
Perf. eval. of Wireless HART
Cont. Timed Markov Chains
CSL model checking
CSL model checking
13-1-’14
Q&A
17-1-’14
Q&A
Deadline: 17-JAN-2013 : As a final step in the case study, you will analyze the effect of message loss on the optimal
TDMA schedule you found previously. Furthermore, you will discuss in a concluding chapter the different roles of
the three formalisms studied in this course in the engineering design-cycle.