Guided tour · 5 steps
A tour of the model in 5 steps
The business rules for airline offers and orders are written in Lean, a language that checks proofs. This tour shows how much the model holds, how its parts depend on each other, and where it needs a decision from the business. Each step links to the page where you can look further.
Step 1 of 5
The cards in the model, by status
The model is a set of cards: definitions and rules written in Lean, guarantees about those rules, and candidate rules found in IATA's public ONE Order material. The dependency graph has 432 cards in 12 areas, and the build gives each one a status.
357 cards are in Lean. 204 guarantees are proven: Lean checked a proof that holds for every input. 60 are open questions, and 67 candidate rules need a business decision before they can be written.
Step 2 of 5
How the areas build on each other
The cards fall into 12 areas, the sections of the blueprint. The foundations sit at the top, and each layer builds on the ones above it. An arrow runs from an area to an area that builds on it, thicker for more dependencies. Click an area to read its summary.
Step 3 of 5
The decisions that reach the most cards
60 open questions and 67 candidate rules wait for the business. Some sit under many other cards, so an answer to them reaches further. These five have the most cards depending on them, directly or through other cards.
- 51 cards in 7 areas: Payment, Change and cancellation, Delivery, Offers and prices, Order creation, Ancillaries, Accounting
- 22 cards in 6 areas: Payment, Change and cancellation, Delivery, Order creation, Ancillaries, Airline change
- 22 cards in 1 area: Accounting
- 16 cards in 5 areas: Change and cancellation, Delivery, Order creation, Ancillaries, Airline change
- 15 cards in 3 areas: Payment, Change and cancellation, Accounting
Step 4 of 5
Refunds never exceed payments
If every refund was accepted against one of the order's payments, the total refunded does not exceed the total paid. This guarantee is open: the rule as written does not meet it. An example shows the rule breaking it.
The example
Given one payment of 100.00 USD against order ORD-1.
When two refunds of 60.00 USD each are requested against that payment.
Then each refund is accepted, and together they return 120.00 USD, more than was paid. This is the counterexample for refunds_le_payments.
What the rule gives
- First accepted
- yes
- Second accepted
- yes
- Total refunded
- 120.00 USD
Lean computes this result from the rule, on every build.
Open point: does the limit apply per refund, cumulatively per payment, or cumulatively per order, and is a refund above the amount paid ever allowed, for example as a goodwill credit?
Read Accepting a refund in the review document, where you can try the rule
Step 5 of 5
The cards that depend on this question
15 cards build on this guarantee, directly or through other cards, in 3 areas: Payment, Change and cancellation, Accounting. Whatever the business decides reaches each of them, which puts it at number 5 in the ranking. The cards it uses directly are to the left; the cards that build on it are to the right, nearest first.
For some open questions, Lean already proves the guarantee under one reading of the sources. The card then shows that reading under If we decide this, on the Explore page and on its area's summary. 24 of the 60 open guarantees have one.
Other pages
- ProgressEvery rule, guarantee and candidate with its status, and the open questions.
- ExploreThe area map, the dependency matrix, every card, the history, and any card's neighbourhood.
- Review documentA chapter per requirement, with its guarantees, examples and questions.