meta modelling as a means for improved communication and
play

Meta-Modelling as a Means for Improved Communication and - PowerPoint PPT Presentation

Meta-Modelling as a Means for Improved Communication and Interoperability The Case of Frisco Petia Wohed & Birger Andersson EMOI, 13 June 2005, Porto 1 Background of our work There is terminological fuzziness in IS engineering


  1. Meta-Modelling as a Means for Improved Communication and Interoperability – The Case of Frisco Petia Wohed & Birger Andersson EMOI, 13 June 2005, Porto 1

  2. Background of our work � There is terminological fuzziness in IS engineering � To address this frameworks has been developed � Frisco (Framework for information systems concepts) � BWW (Bunge Wand & Weber) model � The goal: To provide a coherent system of concepts � Support communication between stakeholders � Facilitate interoperability among systems � Be beneficial for RE, reusability and reliability within the IS development process 2 EMOI, 13 June 2005, Porto

  3. Assumptions and approaches � Basic assumption: � graphical representation considerably facilitates the comprehension of a framework (for people non skilled in formal notations). � Rosemann and Green have developed a graphical meta-model for BWW models � Rosemann, M., Green, P.,: Developing a meta model for the Bunge-Wand Weber ontological constructs. Information Systems 27 (2202) 75-91 � We propose a graphical meta-model for Frisco 3 EMOI, 13 June 2005, Porto

  4. Frisco Concept Set Definition Description Z Thing primitive Any part of a conception of a domain � Fundamental Relationship R R = {r ∈ Z |r ⊆ U ∧ U = A thing composed of { 〈 q,p 〉 |q,p ∈ Z } ∧ 1=|r| < several predicted ∞ } things, each one layer associated with one predictor Concept Set Definition Description T T = {t ∈ R | ∃ s a ∈ CZ [t = Transition b , s A binary relationship characterizing the { 〈 s b ,before 〉 , 〈 s a ,after 〉 } ∧ s b ≠ s between two different a ]} role of the predicted composite things, called � Actor, action thing within the pre- state and post - state of relationship the transition P P = {p ∈ Z | ∃ u ∈ U , q ∈ S S = {s ∈ CZ \ T | ∃ t ∈ T [s ∈ Predictor State An atomic thing used A composite thing 3 ]} involved as a pre - state or Predthingin( to characterize or t) Z [u = and actands post- state in a transistion. 〈 q,p 〉 ]} qualify other things Concept Set Definition Description No element of a state may Q = {q ∈ Z | ∃ u ∈ U , p ∈ N N = {t ∈ T | ∃ q ∈ Q , ∃ r ∈ R [r = Q Action A transition involving a Predicted The thing being be a transition itself { 〈 q,performing 〉 , 〈 t,performed non- empty set of actors ST 1 → s 3 → s State- A transition which is either - thing If t x :s charact erized or 2 , t y : s 4 are P [u = layer 4 ]} by 〉 } ∧ q ∈ Prestateof(t) transition a Sequence, a Choice or a transitions then 〈 q,p 〉 ]} qualified by a CN 3 ⊆ s CN = ST ∩ N Composite A composite transition structure Sequence: sequ(t x , t y ) if s Concurrency predictor 2 action 1 ∩ s 3 ≠∅ with the same condition as Choice: choice(t x , t y ) if s SM SM = {sm ∈ R |sm = Set A binary relationship applying for the notion of Concurrency: concur(t x ,t y ) if { 〈 q 1 ,has- element 〉 , 〈 q membership 1 ∩ s between a thing (the 3 = ∅ 2 ,is- action s � System O = {q ∈ Q | ∃ n ∈ N [q ∈ O element-of 〉 } ∧ q 1 , q 2 ∈ Q CT = ST ∩ T set) characterized by Actor A thing able to cause CT Composite A state transition structure 5 ]} transition Actorof(n) ∧ q 1 ≠ q 2 } transition a special predictor with unique pre - and post - D D = {z ∈ Z | ∃ n ∈ N [z ∈ Actand A thing involved in the states called ´has- element´ 7 ∨ z ∈ 1 → s pre- state or post - state of an Transition A specific occurrence of a concepts layer A transition t:s 2 is enabled Inputof(n) and another thing 1 ⊆ s. action and not considered occurrence transition 6 ]} to occur in state s if s Outputof(n) charactrerized by a 1 → as an actor of that action If a transition t:s s 2 occurs in special predictor RS = {z ∈ Z | ∃ n ∈ N [z ∈ RS Resource The union of the set of state s, then s is changed to the 4 ]} called ´is- element-of´ actors and the set of input Prestateof(n) new state � Organisational EZ EZ = {ez ∈ Z \ R | ¬∃ u ∈ s ′ = (s\s 1 ) ∪ s actands of that action Elementary A thing not being a 2 X X = {d ∈ D | ∃ n ∈ N , ∃ r ∈ R [r Action An optional part of the U [u = 〈 ez,has- element 〉 ]} The occurrence of a transition thing relationship and not context = { 〈 d,is- context 〉 } ∧ d ∈ pre- state of an action 1 ⇒ s t:s in state s leading to state being characterized 2 7 ]} qualifying the context or s ′ is denoted as occ(t ): s → s ′ Inputof(n) by the predictor ´has- situation in which that and IS ( Q ∪ CZ ) TY TY ⊆ 2 Type A specific characterization element´ action is performed, and ( Q ∪ CZ ) | ∃ ty ∈ TY Population PO PO = {po ∈ 2 applying to all things of E = EZ ∩ Q determining or modifying E Entity A predicte d thing that type [po ⊆ ty]} at least one of its output Instance which is an IN IN = {in ∈ Q ∪ CZ | ∃ ty ∈ TY actands. concepts layer elementary thing [in ∈ ty]} G G = {d ∈ D | ∃ n ∈ N , ∃ o ∈ O, Goal A special input actand of CZ Composite CZ = Z \ EZ R A non- elementary S ∪ 2 T ∃ r ∈ R [r = { 〈 d,pursued Rule R = 2 A set of permissible states that action, pursued by the - thing thing by 〉 , 〈 o,persuing 〉 } ∧ d ∈ and transitions in a actors of that action and specific context stating the desired output Inputof(n) ∧ o ∈ Actorof(n)]} state intentionally 4 EMOI, 13 June 2005, Porto

  5. Frisco - basic concepts Thing Composite Elementary Predicated Predicator Thing Thing Thing 1 1 ^ has ^ has * * Entity Pair * ^ consists of * Set Member- Relationship ship 5 EMOI, 13 June 2005, Porto

  6. Frisco – Fundamental layer Thing Composite Elementary Predicated Predicator Thing Thing Thing 1 1 ^ has ^ has * * Entity Pair * ^ consists of * Set Member- Relationship ship 1 < pre Transition * < of State Transition 1 < post * occurrence 1 * 1 1 * defines permissable > * ^ involves ^ consists of ^ involves Concurrency permissable * * * * Composite StateTransition Choice Rule Transition Structure Sequence 6 EMOI, 13 June 2005, Porto

  7. 7 Frisco – Actor, Action & Actands layer EMOI, 13 June 2005, Porto

  8. Examples of suggested changes Def 8 An action n: s1 → s2 is enabled to be performed by an actor a in state s if s1 ⊆ s Action < of Action and a ∈ Actorof(n). If an action n: s1 → s2 is occurrence 1 * perfomed in state s, then s is changed to the new state s ′ = (s\ s1) ∪ s2. The performance of an action n: s1 ⇒ s2 by Transition < of Transition actor a in state s leading to state s ′ at time occurrence 1 * unit tu is denoted as occ(n,a,tu): s → s ′ . Def 6 Let ET = 2 ε denote the set of entity Entity < of Actor Type types. * * involves involves ^ ^ Def adj 7 Let N denote the set of all actions. Action N = { t ∈ T | ∃ q ∈ ET, ∃ r ∈ R [ r = { 〈 q,perfor- < of Action occurrence ming 〉 , 〈 t,performed_by 〉 } ∧ q ∈ Prestateof(t)] } 1 * 8 EMOI, 13 June 2005, Porto

  9. Benefits of the work � Increase communication, understanding and use � Support analysis and further development � Further facilitate cross analysis between approaches e.g., Frisco, BWW, TOVE, EO, etc. � Used as reference framework through which modeling languages can be analyzed and compared 9 EMOI, 13 June 2005, Porto

  10. Further work � To use the proposed meta-model for analysing Frisco against other alternative attempts in the area: � Top-down and well formalised frameworks such as BWW, EO, TOVE � Pragmatic, bottom-up developed attempts like UEML and Söderström. 10 EMOI, 13 June 2005, Porto

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend