Save this video free

[HD] EECS3342 F26 - 2026-11-12 (Thursday) - Lecture 17

Jackie Wang · 1:11:09 · Watch on YouTube

Part of York University EECS3342/EECS4302. See all 31 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

The lecture develops Event-B refinement from abstract model M0, which counts cars in an island-bridge compound with N, to concrete model M1, which separates traffic into A, B, and C. It derives ML_out guards from the abstract condition N < D and linking invariant A + B + C = N, explains why concrete guards must imply abstract guards, and outlines the guard-strengthening proof obligation using the models’ axioms and invariants.

Key takeaways

Chapters

0:00 Reviewing M0 Proof Obligations and the First Refinement
2:33 M1 Variables and the Linking and Safety Invariants
5:17 ML_out Requires Traffic to Flow Only Toward the Island
9:11 Deriving the ML_out Capacity Guard from M0
13:51 ML_in Guard and Whether A = 0 Is Redundant
20:15 Comparing Abstract and Concrete State Transitions
24:30 ML_out Preserves the Link Between M0 and M1
27:12 Writing Complete Before-After Predicates for M1 Events
34:33 Event-B Notation for Abstract and Concrete Components
42:11 Refinement Invariant Scope and Written Test Coverage
44:17 Stronger and Weaker Predicates as Set Inclusion
54:17 Why Concrete Guards Must Strengthen Abstract Guards
1:04:40 Building the ML_out Guard-Strengthening Obligation
1:09:00 Practice ML_in Guard Strengthening and Review Through Slide 58

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:05 All right, let's now uh do a quick recap, okay? And then we'll move on with refinement number one. So last time we actually revisit this first attempt for initial model M0 and we said that when we try to prove about dela freedom from this particular sequence here we can either do eqlr or eql and then from each of these we will be able to arrive two different um provable sequence. One of them will be n larger than zero the other one will be d larger than zero. So these are both mathematically valid unprovable secret. You might arrive by applying different inference rule. However, we have to judge which one we want to use to go back to the original model and fix it.

0:53 Right? That's something we kind of talked about last time and we kind of did a justification and this one here doesn't seem to be realistic. You cannot say the number of cars in the island compound bridge uh the uh island bridge compound should always be greater than zero. It could be zero, right? It's definitely possible, right? We talk about it. So please review it. And then we also talk about if you go for this particular unprovable sequence, how can we interpret that and go back to the original model and fix it? And when once we fix the model, we will be able to regenerate the proof obligation. So you want to make sure for written test number two, you should be able to know how to apply the inference rule and also if I ask you about a particular proof obligation, you should know how to generate a sequence accordingly. Right? So I think uh written test uh written

1:41 test number two is also very relevant to

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Jackie Wang.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.