1 / 24

WELCOME TO COSRI- 2015 IBADAN

WELCOME TO COSRI- 2015 IBADAN. A Domain Specific Language for Oil and Gas Pipeline Knowledge Representation by Japheth Bunakiye Richard is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

ijustin
Download Presentation

WELCOME TO COSRI- 2015 IBADAN

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. WELCOME TO COSRI- 2015 IBADAN A Domain Specific Language for Oil and Gas Pipeline Knowledge RepresentationbyJapheth Bunakiye Richardis licensed under aCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

  2. A Domain Specific Language for Oil and Gas Pipeline Knowledge Representation Japheth R. Bunakiye rb.japheth@ndu.edu.ng Department of Mathematics/Computer Science Niger Delta University, Wilberforce Island, Nigeria Co-Author:Asagba Prince asagba.prince@uniport.edu.ng Department of Computer Science University of Port Harcourt, Nigeria. CoSRI 2015 University of IbadanAugust, 2015.

  3. The Emphasis: • This work is using presented Concept maps as a domain specific language to conceptualize knowledge representation in the oil and gas domain. • It specifically used Conceptual Graphs to achieve its goal.

  4. Definition: Domain specific modelling languages are any artificial language that can be used to express information or knowledge systems in a structure that is defined by a consistent set of rules [Bernhard et al. 35th IEEE Annual Computer Software and Applications Conference 2011] .

  5. The Rules for Knowledge Representation The design of a pipeline system requires the knowledge and application of theory from a number of engineering principles and standards such as physical attributes, and materials factors

  6. Physical attributes- Oil and Gas Pipeline Domain Physical attributes are those parameters that govern the size, layout, and dimensional limits or proportions of the pipeline

  7. Material factors-Oil and Gas Pipeline Domain Material factors relate to pipeline design and highlights parameters that must be considered in completing the modelling process. Pipeline components (i.e. the objects) such as elbow and flange joints resulting into a pipeline system in our case are AutoCAD objects from which the vocabulary of the DSL are customarily explicitly described

  8. System Behaviour The structure and behaviour of the system intends to create integrated functionality for a domain specific language with a model transformation capability, allowing the domain expert the flexibility of working with familiar notations, and yet able to effectively express the constraints and limitations of any proposed oil and gas network

  9. The DSL Knowledge Structure Figure 1. Stream of Tokens

  10. The DSL Knowledge Structure These grammar phrases express the identifiers as generic collections that can be iterated through in order to produce a recursive expression tree

  11. Computing The Generic Collections In C#, enumerating a generic collection class such as this one is made possible by the IEnumerable interface. Now adopting the ArrayList class that implements IEnumerable, the components build parameters are defined and the associated pipeline build grammar for each of the components is presented

  12. Figure 2.Pipeline Build Grammar for Pipe

  13. The DSL Context-free Grammar The CFG of the DSL is described adopting the model of Crimi et al [1991] A context-free relational grammar is a tuple, G = (VN, VT, VR, S, P, R) Where: VT is a finite set of terminal symbols. VN is a finite set of non-terminal symbols. VR is a finite set of relations. S is the starting symbol. P is a finite set of productions. R is a set of evaluation rules used to validate constraints.

  14. The Present representations Figure 3. Pipeline Feature Model • The Present representation is a feature model of software product line of abstractions and functionalities of the oil and gas pipeline application domain • The feature model has composite features - pipe line components, pipe line route, pipe line bed • Each of the composite features contain atomic features - pipe size, support types, joint types, fitting types • related ones that do not need to be further refined into sub features when there are no variations among different products.

  15. The Present representations In our example DSL R denotes the feature constraints corresponding to the DSL knowledge definition and representation that defines the set of productions P in the context-free grammar. For example, the grammar’s start production is the pipeline root feature with the production: c: d p t; meaning a pipeline component with sub features involving dimension (d) of the component, point of contact (p) with other features, and type of component (t) relating with other components to bring about a complete translated pipeline model according to a particular stakeholders design intent. There are four variables in the production: three {d, p, t} are terminal tokens, and one {c} is a non-terminal.

  16. The Present representations • The grammar production is indicative of the fact that the arcs signify the finite set of relations, • The nodes are labelled, and the tree resolution hierarchy at the nodes is a directed acyclic graph G. • Therefore all possible labels in the directed graphs are defined by (VC, VT, VR, G, P, R, N), where N represents a node and the symbol "→ↄ" represents a directed arc:

  17. The Present representations VN = {c}VT = {d, p, t, →ↄ} VR = {start, end} P1= c ::={ N} P2 = c ::={ N, G} P3 = c ::={ →ↄ, G} {start (d, p, t, →ↄ, G), end (d, p, t, →ↄ, G)} R1 = start (→ↄ, G) :- (G => {N}), start (→ↄ, N) R2 = start (→ↄ, G, d) :- (G, d => {N, G, p}), (G, d => {N, G, t}) start (→ↄ, N) R3 = start  (→ↄ,G, d) :- (G, d => {N,G, p }), start(→ↄ,G, p) R4 = start (→ↄ, G, d) :- (G, d => {N, G, t}), start (→ↄ, G, t) R5 = end (→ↄ, G) :- (G => {N}), end (→ↄ, N) R6 = end (→ↄ, G, d) :- (G, d => {N, G, p}), end (→ↄ, N) R7 = end (→ↄ, G, d) :- (G, d => {N, G, t}), end (→ↄ, N) R8 = end (→ↄ, G, d) :- (G, d => {→ↄ, G, p}), end (→ↄ, G, p)

  18. Describing the Present representations The description in P1 specifies that a single node is a legal graph. P2show that a single node can always be added to a graph. P3 says a directed arc can only be added to a graph if it starts and ends in the graph. The evaluation rules, R, which are the recursive definitions of the language specify how the start and end relations are to be interpreted. For example, R1 states that a directed arc starts on G if G matches a single node (G => {N}), and the arc starts on that node (start (→ↄ, N)). Rules 2 and 3 state that adirected arc starts on d if d matches {N, p} and the arc starts on the node (start (→ↄ, N)) or on a node in p (start (→ↄ, p)). This continued until all the terminals in the productions are related to produce a relational grammar parse tree corresponding to a design lifecycle. See figure

  19. The Present representations Figure 4 is illustration showing a simple directed graph and its parse tree according to the relational grammar.  Figure 4. A Directed Graph and Its Parse Tree

  20. MAPPING THE GRAPHICAL DOMAIN TO THE APPLICATION DOMAIN Mapping the two domains therefore means that the resultant relational grammar can be translated into what this language does and what is carried out in real life using the vocabulary of components. Concept map is a form of knowledge representation that is very useful in making the structure of a body of knowledge much more relevant than other forms of knowledge representation such as pure text and predicate logic

  21. The Conceptual Mapping

  22. Designing Stakeholder View Points The primary reason amongst others for representing domain knowledge of this sort, especially in the domain of oil and gas pipeline; is to ensure that domain experts design intents and viewpoints are considerably met at the pipeline engineering work place.

  23. Figure 3.23: A Conceptual Graph Describing Viewpoints The rectangular boxes in the conceptual graph represent the oil and gas pipeline engineering concepts and the rounded or elliptical boxes are representing relations between the concepts. The larger boxes in Figure 3.23 are also concepts but are a special kind of concept called contexts; i.e. they are representing first a typical design context where a stakeholder has proposed, and then a typical situation where a modelling action of a proposed artefact is complete. The proposition is "There is an instance of a pipeline which origin is a pipe and which persistent to a pipeline model is a certain situation with an elbow." The situation is "There is an instance of DSL which agent is some domain expert (DE) and whose platform is the DSL with some pipeline artefact of elbow ad pipe." There is also a co-reference link (the dotted line) between the concept [Instance: Pipe] and the domain expert [DE]. This indicates that the domain expert and the pipe are all operating on the same DSL platform i.e. the DE is simply selecting the pipe parameters in the DSL interface to match with the elbow to form the pipeline model suiting that particular intents and viewpoints.

  24. THANK YOU FOR YOUR ATTENTION A Domain Specific Language for Oil and Gas Pipeline Knowledge RepresentationbyJapheth Bunakiye Richardis licensed under aCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

More Related