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