NICE TO SEE YOU BACK - DTU Informatics
NICE TO SEE YOU BACK - DTU Informatics NICE TO SEE YOU BACK - DTU Informatics
2. Domain Entities 2.3. Parts2.3.2. Properties2.3.2.2. Mereology89Example: 10 Container Bays, Etcetera: Mereology. First weshow how to model indexed set of container bays, rows and stacks forthe previous example.• Narrative:– (i) An indexed set, bs:BS, of bays is a bijective mapfrom unique bay identifiers, bid:BId, to bays, b:B.– (ii) An indexed set, rs:RS, of rows is a bijective mapfrom unique row identifiers, rid:RId, to rows, r:R.– (iii) An indexed set, ss:SS, of stacks is a bijective mapfrom unique stack identifiers, sid:SId, to stacks, s:S.– (iv) A stack is a linear indexed sequence of containers, c:C.A Precursor for Requirements Engineering 89 c○ Dines Bjørner 2012, DTU Informatics, Techn.Univ.of Denmark – July 20, 2012: 12:33
90 2. Domain Entities 2.3. Parts2.3.2. Properties2.3.2.2. Mereology• Formalisation:– (i) type BS, B, BId,Bs=BId → m B,value obs Bs: BS→Bs(or obs Bs: BS→(BId → m B));– (ii) type RS, R, RId,Rs=RId → m R,value obs Rs: RS→Rs(or obs Rs: RS→(RId → m R));– (iii) type SS, S, SId,Ss=SId → m S;– (iv) type C,S=C ∗ .c○ Dines Bjørner 2012, DTU Informatics, Techn.Univ.of Denmark – July 20, 2012: 12:33 90 Domain Science & Engineering
- Page 7 and 8: 382. Domain Entities• Phenomena:
- Page 9 and 10: 402. Domain Entities• Domain Onto
- Page 11 and 12: 422. Domain Entities 2.1. Entities2
- Page 13 and 14: 442. Domain Entities 2.1. Entities2
- Page 15 and 16: 462. Domain Entities 2.1. Entities2
- Page 17 and 18: 482. Domain Entities 2.1. Entities2
- Page 19 and 20: 502. Domain Entities 2.2. Endurants
- Page 21 and 22: 522. Domain Entities 2.2. Endurants
- Page 23 and 24: 542. Domain Entities 2.3. Parts•
- Page 25 and 26: 562. Domain Entities 2.3. Parts2.3.
- Page 27 and 28: 582. Domain Entities 2.3. Parts2.3.
- Page 30 and 31: 2. Domain Entities 2.3. Parts2.3.1.
- Page 32 and 33: 2. Domain Entities 2.3. Parts2.3.1.
- Page 34 and 35: 2. Domain Entities 2.3. Parts2.3.1.
- Page 36 and 37: 2. Domain Entities 2.3. Parts2.3.1.
- Page 38 and 39: 2. Domain Entities 2.3. Parts2.3.1.
- Page 40 and 41: 2. Domain Entities 2.3. Parts2.3.1.
- Page 42 and 43: 2. Domain Entities 2.3. Parts2.3.1.
- Page 44 and 45: 2. Domain Entities 2.3. Parts2.3.1.
- Page 46 and 47: 2. Domain Entities 2.3. Parts2.3.1.
- Page 48 and 49: 2. Domain Entities 2.3. Parts2.3.2.
- Page 50 and 51: 2. Domain Entities 2.3. Parts2.3.2.
- Page 52 and 53: 2. Domain Entities 2.3. Parts2.3.2.
- Page 54 and 55: 2. Domain Entities 2.3. Parts2.3.2.
- Page 56 and 57: 2. Domain Entities 2.3. Parts2.3.2.
- Page 60 and 61: 2. Domain Entities 2.3. Parts2.3.2.
- Page 62 and 63: 2. Domain Entities 2.3. Parts2.3.2.
- Page 64 and 65: 2. Domain Entities 2.3. Parts2.3.2.
- Page 66 and 67: 2. Domain Entities 2.3. Parts2.3.2.
- Page 68 and 69: 2. Domain Entities 2.3. Parts2.3.2.
- Page 70 and 71: 2. Domain Entities 2.3. Parts2.3.2.
- Page 72 and 73: 2. Domain Entities 2.3. Parts2.3.2.
- Page 74 and 75: 2. Domain Entities 2.3. Parts2.3.2.
- Page 76 and 77: 2. Domain Entities 2.3. Parts2.3.2.
- Page 78 and 79: 2. Domain Entities 2.3. Parts2.3.3.
- Page 80 and 81: 2. Domain Entities 2.3. Parts2.3.3.
- Page 82 and 83: 2. Domain Entities 2.3. Parts2.3.3.
- Page 84 and 85: 2. Domain Entities 2.3. Parts2.3.4.
- Page 86 and 87: 2. Domain Entities 2.3. Parts2.3.4.
- Page 88: 118LONG BREAKc○ Dines Bjørner 20
90 2. Domain Entities 2.3. Parts2.3.2. Properties2.3.2.2. Mereology• Formalisation:– (i) type BS, B, BId,Bs=BId → m B,value obs Bs: BS→Bs(or obs Bs: BS→(BId → m B));– (ii) type RS, R, RId,Rs=RId → m R,value obs Rs: RS→Rs(or obs Rs: RS→(RId → m R));– (iii) type SS, S, SId,Ss=SId → m S;– (iv) type C,S=C ∗ .c○ Dines Bjørner 2012, <strong>DTU</strong> <strong>Informatics</strong>, Techn.Univ.of Denmark – July 20, 2012: 12:33 90 Domain Science & Engineering
Change language