cpee-transformation 1.0.0

data/lib/cpee/transformation/implementation.xml

@@ -0,0 +1,47 @@
+<!--
+  This file is part of CPEE-TRANSFORMATION.
+
+  CPEE-TRANSFORMATION is free software: you can redistribute it and/or modify
+  it under the terms of the GNU Lesser General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or (at your
+  option) any later version.
+
+  CPEE-TRANSFORMATION is distributed in the hope that it will be useful, but
+  WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+  FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
+  for more details.
+
+  You should have received a copy of the GNU Lesser General Public License
+  along with CPEE-TRANSFORMATION (file COPYING in the main directory). If not,
+  see <http://www.gnu.org/licenses/>.
+-->
+
+<declaration xmlns="http://riddl.org/ns/declaration/1.0" xmlns:xi="http://www.w3.org/2001/XInclude">
+  <interface name="xml_cpee">
+    <xi:include href="transformation_xml_cpee.xml"/>
+  </interface>
+  <interface name="text_cpee">
+    <xi:include href="transformation_text_cpee.xml"/>
+  </interface>
+  <interface name="xml_text">
+    <xi:include href="transformation_xml_text.xml"/>
+  </interface>
+
+  <facade>
+    <tile>
+      <layer name="xml_cpee">
+        <apply-to>/cpee/bpmn2</apply-to>
+      </layer>
+      <layer name="text_cpee">
+        <apply-to>/cpee/mermaid</apply-to>
+        <apply-to>/cpee/graphviz</apply-to>
+      </layer>
+      <layer name="xml_text">
+        <apply-to>/mermaid/cpee</apply-to>
+        <apply-to>/text-bf/cpee</apply-to>
+        <apply-to>/text-df-PO-extended/cpee</apply-to>
+        <apply-to>/text-df-PO-reduced/cpee</apply-to>
+      </layer>
+    </tile>
+  </facade>
+</declaration>

data/lib/cpee/transformation/mermaid.rb

@@ -0,0 +1,242 @@
+# encoding: UTF-8
+#
+# This file is part of CPEE-TRANSFORMATION.
+#
+# CPEE-TRANSFORMATION is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or (at your
+# option) any later version.
+#
+# CPEE-TRANSFORMATION is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+# FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
+# for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with CPEE-TRANSFORMATION (file COPYING in the main directory).  If not,
+# see <http://www.gnu.org/licenses/>.
+
+require_relative 'target'
+
+module CPEE
+
+  module Transformation
+
+    module Source #{{{
+
+      class Mermaid
+        attr_reader :tree, :start, :dataelements, :endpoints, :graph, :traces
+
+         def initialize(text) #{{{
+          Node.class_variable_set(:@@niceid,  {})
+
+          @tree = Tree.new
+          @start = nil
+
+          @dataelements = {}
+          @endpoints = {}
+          @graph = Graph.new
+
+          extract_nodelink(text)
+
+          if @start.nil?
+            @traces = Traces.new [[]]
+          else
+            @traces = Traces.new [[@start]]
+          end
+        end #}}}
+
+				def map_nodes(node)
+					case node
+            when 'task'; :task
+            when 'script'; :scriptTask
+            when 'parallelgateway';   :parallelGateway
+            when 'exclusivegateway';  :exclusiveGateway
+            when 'eventbasedgateway'; :eventBasedGateway
+            when 'inclusivegateway';  :inclusiveGateway
+            when 'endevent';          :endEvent
+            when 'startevent';        :startEvent
+						else
+							nil
+					end
+				end
+				private :map_nodes
+
+        def extract_nodelink(text) #{{{
+          first = nil
+          text.each_line do |line|
+            if line =~ /-->/
+              a = line.strip.split(/-->\s*(\|([^|]+)\|)?/)
+              if a.length == 2
+                l, r = a
+              else
+                l, _, c, r = a
+              end
+
+              lid, ltype, llabel = l.strip.split(':',3)
+              rid, rtype, rlabel = r.strip.split(':',3)
+
+              ltype = 'task' if ltype.nil?
+              rtype = 'task' if rtype.nil?
+
+              if lid =~ /^([a-zA-Z\d]+)(\[([^\]]+)\])/
+                lid = $1
+                llabel = $3
+              end
+
+              if rid =~ /^([a-zA-Z\d]+)(\[([^\]]+)\])/
+                rid = $1
+                rlabel = $3
+              end
+
+              llabel = '' if llabel.nil?
+              rlabel = '' if rlabel.nil?
+              llabel.sub(/^'/,'')
+              llabel.sub(/'$/,'')
+              llabel.sub(/^"/,'')
+              llabel.sub(/"$/,'')
+              rlabel.sub(/^'/,'')
+              rlabel.sub(/'$/,'')
+              rlabel.sub(/^"/,'')
+              rlabel.sub(/"$/,'')
+
+							# every line contains a link
+							@graph.add_link Link.new(lid, rid, c.nil? ? nil : c.to_s.gsub(/(^"|"$)/, ''))
+
+              n1 = Node.new(0,lid,map_nodes(ltype),llabel.sub(/^\(/,'').sub(/\)$/,''),0,1)
+              n2 = Node.new(0,rid,map_nodes(rtype),rlabel.sub(/^\(/,'').sub(/\)$/,''),1,0)
+
+              @graph.add_node n1, :outgoing
+              @graph.add_node n2, :incoming
+
+						  first = n1 if first.nil?
+              @start = n1 if n1.type == :startEvent && @start.nil?
+            end
+            @start = first if @start.nil?
+          end
+        end #}}}
+
+      end
+
+    end #}}}
+
+    module Target #{{{
+
+      class Mermaid < Default
+
+        def generate
+          @nids = []
+          @labels = {}
+          @fromto = []
+          @labels['se'] = "se:startevent:((startevent))"
+          @labels['ee'] = "ee:endevent:((endevent))"
+          pn = generate_in_list(@tree,'se')
+          set_fromto pn, 'ee'
+          "flowchart LR\n" + @fromto.map{ |e| "#{@labels[e[0]]}-->#{e.length == 3 ? e[2] : ''}#{@labels[e[1]]}"}.join("\n")
+        end
+
+        def id_find(nid)
+          nid = 'g0' unless nid
+          while @nids.include?(nid)
+            nid.next!
+          end
+          @nids << nid
+          nid
+        end
+
+        private
+
+          def set_fromto(pn,nid)
+            if pn.is_a?(Array) && pn.length > 1
+              @fromto << [pn[0],nid,pn[1]]
+            else
+              @fromto << [pn,nid]
+            end
+          end
+
+          def print_Node(node,pn)
+            nid = node.id
+            if node.endpoints.empty? && ((!node.script.nil? && node.script.strip != '') || node.type == :scriptTask)
+              @labels[nid] = "#{nid}:script:(#{node.label.gsub(/\(/,"\\(").gsub(/\)/,"\\)")})"
+            else
+              @labels[nid] = "#{nid}:task:(#{node.label.gsub(/\(/,"\\(").gsub(/\)/,"\\)")})"
+            end
+            set_fromto pn, nid
+            nid
+          end
+
+          def print_Break(node,pn)
+            nid = node.id
+            @labels[nid] = "#{nid}:escalate:((^))"
+            set_fromto pn, nid
+            nid
+          end
+
+          def print_Parallel(node,pn)
+            nid = id_find(node.id)
+            set_fromto pn, "#{nid}s"
+            @labels["#{nid}s"] = "#{nid}s:parallelgateway:{AND}"
+            @labels["#{nid}e"] = "#{nid}e:parallelgateway:{AND}"
+            node.sub.each do |branch|
+              pn = generate_in_list(branch,"#{nid}s")
+              set_fromto pn, "#{nid}e"
+            end
+            "#{nid}e"
+          end
+
+          def print_Conditional(node,pn)
+            nid = id_find(node.id)
+            set_fromto pn, "#{nid}s"
+            @labels["#{nid}s"] = "#{nid}s:exclusivegateway:{x}"
+            @labels["#{nid}e"] = "#{nid}e:exclusivegateway:{x}"
+            node.sub.each do |branch|
+              pn = if branch.condition.any?
+                generate_in_list(branch,["#{nid}s","|\"#{branch.condition.join(' or ')}\"|"])
+              else
+                if branch.otherwise
+                  generate_in_list(branch,["#{nid}s","|\"|\"|"])
+                else
+                  generate_in_list(branch,"#{nid}s")
+                end
+              end
+              set_fromto pn, "#{nid}e"
+            end
+            "#{nid}e"
+          end
+
+          def print_Loop(node,pn)
+            nid = id_find(node.id)
+            set_fromto pn, "#{nid}s"
+
+            @labels["#{nid}s"] = "#{nid}s:exclusivegateway:{x}"
+            @labels["#{nid}e"] = "#{nid}e:exclusivegateway:{x}"
+
+            cn = if node.mode == :pre_test
+              set_fromto "#{nid}s", "#{nid}e"
+              [ ["#{nid}e", "|\"#{node.sub[0].condition.empty? ? 'true' : node.sub[0].condition.join(' && ')}\"|"], "#{nid}s"]
+            else
+              set_fromto ["#{nid}e","|\"#{node.sub[0].condition.empty? ? 'true' : node.sub[0].condition.join(' && ')}\"|"], "#{nid}s"
+              ["#{nid}s", "#{nid}e"]
+            end
+
+            pn = if node.sub.length == 2 && node.sub[1].condition.empty? && ((node.sub[1].length == 1 && node.sub[1][0].class.name.gsub(/\w+:+/,'') == 'Break') ||  node.sub[1].length == 0)
+              generate_in_list(node.sub[0],cn[0])
+            else
+              if node.sub.length == 1
+                generate_in_list(node.sub[0],cn[0])
+              else
+                print_Conditional(node,cn[0])
+              end
+            end
+            set_fromto pn, cn[1]
+
+            "#{nid}e"
+          end
+
+      end
+
+    end #}}}
+
+  end
+
+end

data/lib/cpee/transformation/ptml.rb

@@ -0,0 +1,316 @@
+# encoding: UTF-8
+#
+# This file is part of CPEE-TRANSFORMATION.
+#
+# CPEE-TRANSFORMATION is free software: you can redistribute it and/or modify
+# it under the terms of the GNU Lesser General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or (at your
+# option) any later version.
+#
+# CPEE-TRANSFORMATION is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+# FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
+# for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License
+# along with CPEE-TRANSFORMATION (file COPYING in the main directory).  If not,
+# see <http://www.gnu.org/licenses/>.
+
+require_relative 'target'
+require 'xml/smart'
+
+module CPEE
+
+  module Transformation
+
+    module Source #{{{
+
+      class PTML
+        attr_reader :tree, :start, :dataelements, :endpoints, :graph, :traces
+
+        def initialize(xml) #{{{
+          Node.class_variable_set(:@@niceid,  {})
+
+          @tree = Tree.new
+          @start = nil
+
+          doc = XML::Smart.string(xml)
+
+          @graph = Graph.new
+          extract_nodelink(doc)
+
+          if @start.nil?
+            @traces = Traces.new [[]]
+          else
+            @traces = Traces.new [[@start]]
+          end
+        end #}}}
+
+        def map_nodes(node) #{{{
+          case node
+            when :sequence; :sequence
+            when :manualTask; :task
+            when :automaticTask; :task
+            when :and;   :parallelGateway
+            when :xor;  :exclusiveGateway
+            when :xorLoop;  :exclusiveGateway
+            #when :eventbasedgateway; :eventBasedGateway
+            when :or;  :inclusiveGateway
+            #when 'endevent';          :endEvent
+            #when 'startevent';        :startEvent
+            else
+              nil
+          end
+        end
+        private :map_nodes  #}}}
+
+        def iterate_ptml(sid,doc) #{{{
+          # get node and get type
+          se = doc.find("//processTree/*[@id='#{sid}']").first
+          stype = map_nodes(se.qname.name.to_sym)
+          print '============current', ' ', sid, ' ', @last,' ', stype, ';'
+          pp ' '
+          if stype == :sequence
+            #get al outgoing elements
+            outgoings = doc.find("//parentsNode[@sourceId='#{sid}']")
+            outgoings.each_with_index do |e, i|
+              iterate_ptml(e.attributes['targetId'],doc)
+            end
+          elsif stype == :exclusiveGateway || stype == :parallelGateway || stype == :inclusiveGateway
+            outgoings = doc.find("//parentsNode[@sourceId='#{sid}']")
+            if @graph.nodes.length == 0   #if first element
+              n = Node.new(self.object_id,sid,stype,"",1,outgoings.length)
+              @start = n
+            else
+              n = Node.new(self.object_id,sid,stype,"",0,outgoings.length)
+              @graph.add_link Link.new(@last, sid, nil)
+            end
+            @graph.add_node n
+            print '***********test    ', @last, " ", sid
+            pp ' '
+            @last = sid
+            final = []
+            outgoings.each_with_index do |e, i|
+              iterate_ptml(e.attributes['targetId'],doc)
+              final << @last
+              @last = sid
+            end
+            pp final
+            rid = rand.to_s[2..11]
+            n = Node.new(self.object_id,rid,stype,"",outgoings.length,1)
+            @graph.add_node n
+            final.each do |f|
+              @graph.add_link Link.new(f, rid, nil)
+            end
+            @last = rid
+          elsif stype == :task
+            pp se.attributes['name']
+            # write node
+            if @graph.nodes.length == 0   #if first element
+              n = Node.new(self.object_id,sid,stype,se.attributes['name'],0,1)
+              @start = n
+            else                          #other elements
+              n = Node.new(self.object_id,sid,stype,se.attributes['name'],1,1)
+              @graph.add_link Link.new(@last, sid, nil)
+            end
+            @graph.add_node n
+            @last = sid
+          end
+          #@last = sid
+        end
+        private :iterate_ptml
+        #}}}
+
+        def extract_nodelink(doc) #{{{
+          #extract nodes
+          sid = doc.find("//processTree/@root").first.value
+          @last = 0
+          iterate_ptml(sid,doc)
+          pp @last
+          pp @graph
+        end #}}}
+
+      end
+
+    end #}}}
+
+    module Target #{{{
+
+      class PTML < Default
+
+        def generate
+          start_id = "rootid"
+          @last = start_id
+          res = XML::Smart.string("<ptml><processTree id='tree01' name='ptml-tree' root='#{start_id}'/></ptml>")
+          pp "start"
+          generate_in_list(@tree,res.root.children[0])
+          res.to_s
+        end
+
+        private
+
+          def set_edges(source,target,res)
+            rid = rand.to_s[2..11]
+            res.add('parentsNode','id'=> rid, 'sourceId' => source, 'targetId' => target)
+            res
+          end
+
+          def set_edges_condition(source,target,res,cond,default)
+            rid = rand.to_s[2..11]
+            if default
+              res.add('parentsNode','id'=> rid, 'sourceId' => source, 'targetId' => target, 'default' => default)
+            else
+              res.add('parentsNode','id'=> rid, 'sourceId' => source, 'targetId' => target, 'condition' => cond)
+            end
+            res
+          end
+
+
+          def print_Break(node,res)
+            rid = rand.to_s[2..11]
+            n = res.add('manualTask','id' => rid, 'name' => node.label)
+            set_edges(@last,rid,res)
+            res
+          end
+
+          def print_Loop(node,res)
+            if node.mode == :pre_test
+              original_last = @last
+              nid = "a#{node.id}"
+              res.add('xorLoop','id' => nid, 'name' => nil)
+              set_edges(@last,nid,res)
+              @last = nid
+              if node.sub.length == 2
+                node.sub.reverse.each do |branch|
+                  cond = branch.condition.any? ? branch.condition[0] : nil
+                  if branch[0].type == :break
+                    rid = rand.to_s[2..11]
+                    res.add('automaticTask', 'id' => rid, 'name' => 'tau')
+                    set_edges(@last,rid,res)
+                  elsif branch.length == 1
+                    generate_in_list(branch,res)
+                    res.find("//parentsNode[@sourceId='#{@last}']").last.attributes['condition'] = cond
+                  elsif branch.length >1
+                    branch_last = @last
+                    rid = rand.to_s[2..11]
+                    res.add('sequence', 'id' => rid, 'name' => 'just-sequence')
+                    set_edges_condition(@last,nid,res,cond,false)
+                    @last = rid
+                    generate_in_list(branch,res)
+                    @last = branch_last
+                  end
+                end
+              elsif node.sub.length > 2
+                node.sub.reverse.each do |branch|
+                  if branch[0].type == :break
+                    rid = rand.to_s[2..11]
+                    res.add('automaticTask', 'id' => rid, 'name' => 'tau')
+                    set_edges(@last,rid,res)
+                    #Add new xor
+                    xor_id = rand.to_s[2..11]
+                    res.add('xor', 'id' => xor_id, 'name' => 'help-xor')
+                    set_edges(@last,xor_id,res)
+                    escape_id = rand.to_s[2..11]
+                    res.add('manualTask', 'id' => escape_id, 'name' => 'escape')
+                    set_edges(xor_id,escape_id,res)
+                    @last = xor_id
+                  else
+                    if branch.length == 1
+                      generate_in_list(branch,res)
+                    elsif branch.length >1
+                      branch_last = @last
+                      rid = rand.to_s[2..11]
+                      res.add('sequence', 'id' => rid, 'name' => 'just-sequence')
+                      set_edges(@last,rid,res)
+                      @last = rid
+                      generate_in_list(branch,res)
+                      @last = branch_last
+                    end
+                  end
+                end
+              end
+            end
+            @last = original_last
+            res
+          end
+
+          def print_Node(node,res) #{{{
+            #if the first element in the process models is task
+            if res.children.length == 0
+              res.add('sequence', 'id' => @last, 'name' => 'main-sequence')
+            end
+            nid = "a#{node.niceid}"
+            if node.endpoints.empty? && ((!node.script.nil? && node.script.strip != '') || node.type == :scriptTask)
+              n = res.add('automaticTask','id' => nid, 'name' => node.label)
+            else
+              n = res.add('manualTask', 'id' => nid, 'name' => node.label)
+            end
+            set_edges(@last,nid,res)
+            res
+          end #}}}
+
+          def print_Parallel(node,res) #{{{
+            print_Conditional(node,res)
+            res
+          end #}}}
+
+          def print_Inclusive(node,res) #{{{
+            print_Conditional(node,res)
+            res
+          end #}}}
+
+           def print_Conditional(node,res) #{{{
+            original_last = @last
+            nid = "a#{node.id}"
+
+            if node.type == :exclusiveGateway
+              res.add('xor','id' => nid, 'name' => nil)
+            elsif node.type == :parallelGateway
+              res.add('and','id' => nid, 'name' => nil)
+            elsif node.type == :inclusiveGateway
+              res.add('or','id' => nid, 'name' => nil)
+            end
+
+            #if first element in model
+            if res.children.length == 1
+              res.attributes['root'] = nid
+            else
+              set_edges(@last,nid,res)
+            end
+            @last = nid
+            node.sub.each do |branch|
+              #get conditions and default
+              cond = branch.condition.any? ? branch.condition[0] : nil
+              default = branch.otherwise ? true : nil
+              if branch.length == 0
+                rid = rand.to_s[2..11]
+                res.add('automaticTask', 'id' => rid, 'name' => 'tau')
+                set_edges_condition(@last,rid,res,cond,default)
+              elsif branch.length == 1
+                generate_in_list(branch,res)
+                if default
+                  res.find("//parentsNode[@sourceId='#{@last}']").last.attributes['default'] = default
+                else
+                  res.find("//parentsNode[@sourceId='#{@last}']").last.attributes['condition'] = cond
+                end
+              elsif branch.length >1
+                branch_last = @last
+                rid = rand.to_s[2..11]
+                res.add('sequence', 'id' => rid, 'name' => 'just-sequence')
+                set_edges_condition(@last,rid,res,cond,default)
+                @last = rid
+                generate_in_list(branch,res)
+                @last = branch_last
+              end
+            end
+            @last = original_last
+            res
+          end #}}}
+
+      end
+
+    end #}}}
+
+  end
+
+end