cpee-transformation 1.0.0

data/lib/cpee/transformation/transformation_xml_cpee.xml

@@ -0,0 +1,49 @@
+<!--
+  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 LICENSE in the main directory). If not,
+  see <http://www.gnu.org/licenses/>.
+-->
+
+<description datatypeLibrary="http://www.w3.org/2001/XMLSchema-datatypes" xmlns="http://riddl.org/ns/description/1.0" xmlns:xi="http://www.w3.org/2001/XInclude">
+
+  <message name="xmldescription">
+    <parameter name="description" mimetype="text/xml"/>
+  </message>
+  <message name="list">
+    <zeroOrMore>
+      <parameter name="name" type="string"/>
+      <parameter name="value" type="string"/>
+    </zeroOrMore>
+  </message>
+
+  <message name="xmldedesc">
+    <parameter name="description" mimetype="text/xml"/>
+    <parameter name="type" fixed="description"/>
+  </message>
+  <message name="xmldadesc">
+    <parameter name="description" mimetype="text/xml"/>
+    <parameter name="type" fixed="dataelements"/>
+  </message>
+  <message name="xmlendesc">
+    <parameter name="description" mimetype="text/xml"/>
+    <parameter name="type" fixed="endpoints"/>
+  </message>
+
+  <resource>
+    <post in="xmldedesc" out="xmldescription"/>
+    <post in="xmldadesc" out="list"/>
+    <post in="xmlendesc" out="list"/>
+  </resource>
+</description>

data/lib/cpee/transformation/transformation_xml_text.xml

@@ -0,0 +1,49 @@
+<!--
+  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 LICENSE in the main directory). If not,
+  see <http://www.gnu.org/licenses/>.
+-->
+
+<description datatypeLibrary="http://www.w3.org/2001/XMLSchema-datatypes" xmlns="http://riddl.org/ns/description/1.0" xmlns:xi="http://www.w3.org/2001/XInclude">
+
+  <message name="plaindescription">
+    <parameter name="description" mimetype="text/plain"/>
+  </message>
+  <message name="list">
+    <zeroOrMore>
+      <parameter name="name" type="string"/>
+      <parameter name="value" type="string"/>
+    </zeroOrMore>
+  </message>
+
+  <message name="xmldedesc">
+    <parameter name="description" mimetype="text/xml"/>
+    <parameter name="type" fixed="description"/>
+  </message>
+  <message name="xmldadesc">
+    <parameter name="description" mimetype="text/xml"/>
+    <parameter name="type" fixed="dataelements"/>
+  </message>
+  <message name="xmlendesc">
+    <parameter name="description" mimetype="text/xml"/>
+    <parameter name="type" fixed="endpoints"/>
+  </message>
+
+  <resource>
+    <post in="xmldedesc" out="plaindescription"/>
+    <post in="xmldadesc" out="list"/>
+    <post in="xmlendesc" out="list"/>
+  </resource>
+</description>

data/lib/cpee/transformation/transformer.rb

@@ -0,0 +1,300 @@
+# 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 'structures'
+require 'rubygems'
+require 'highline'
+
+module CPEE
+
+  module Transformation
+
+    class Transformer
+      def initialize(source)
+        @hl = HighLine.new
+        @source = source
+
+        ### fix ids, dont do it, we save the id's in alt_id which is much safer
+        # ids = [0]
+        # nodes = []
+        # source.graph.nodes.each do |k,v|
+        #   if v.id =~ /^a(\d+)$/
+        #     v.niceid = $1.to_i
+        #     ids << v.niceid
+        #     nodes << v.id
+        #   end
+        # end
+        # source.graph.nodes.each do |k,v|
+        #   unless nodes.include?(v.id)
+        #     v.niceid = ids.max + 1
+        #     ids << v.niceid
+        #   end
+        # end
+      end
+
+      def build_traces #{{{
+        build_extraces @source.traces, @source.start
+        @source.traces
+      end #}}}
+      def build_tree(debug=false) #{{{
+        build_ttree @source.tree, @source.traces.dup, nil, debug
+        debug_print debug, 'Tree finished'
+        @source.tree
+      end #}}}
+
+      def  build_extraces(traces, node) #{{{
+        dupt = traces.last.dup
+        @source.graph.next_nodes(node).each_with_index do |n,i|
+          traces << dupt.dup if i > 0
+          if traces.last.include?(n)
+            traces.last << n
+          else
+            traces.last << n
+            build_extraces(traces,n)
+          end
+        end
+      end #}}}
+      private :build_extraces
+
+      def map_node(node,flat) #{{{
+        case node.type
+          when :parallelGateway
+            flat ? nil : Parallel.new(node.id,node.type,node.attributes[:wait].nil? ? '-1' : node.attributes[:wait],node.attributes[:cancel].nil? ? 'last' : node.attributes[:cancel])
+          when :exclusiveGateway
+            flat ? nil : Conditional.new(node.id,:exclusive,node.type,node.label)
+          when :eventBasedGateway
+            flat ? nil : Parallel.new(node.id,node.type,1)
+          when :inclusiveGateway
+            flat ? nil : Conditional.new(node.id,:inclusive,node.type,node.label)
+          when :break
+            flat ? Break.new(node.id) : Break.new(node.id)
+          when :endEvent, :startEvent, nil
+            nil
+          else
+            node
+        end
+      end #}}}
+      private :map_node
+
+      def print_node(niceid)
+        @source.graph.find_node(niceid)
+      end
+
+      def build_ttree(branch,traces,enode=nil,debug=false,down=0)
+        while not traces.finished?
+          ### if traces exist more than once, make it so they exist only once
+          ### if somebody creates a modell with an inclusive/exclusive that
+          ### has identical branches with different conditions, we are fucked
+          ### but how are the odds? right? right?
+          traces.uniq!
+          puts '--> now on ' + down.to_s if debug
+          debug_print debug, traces
+          if node = traces.same_first
+            if branch.empty? && branch.respond_to?(:id)
+              li = if (branch.id == traces.first_node.id)
+                ### for tail controlled loops, use the link from this to next
+                ### if a tasks loops to itself, then second_nodes returns the first
+                @source.graph.link(branch.id,traces.second_nodes.first.id)
+              else
+                ### if traces.all_tail? && traces.length > 1 && !traces.all_loops?
+                ### we had traces.all_tail? here. why?
+                if !traces.all_tail? && traces.length > 1 && !traces.all_loops?
+                  @source.graph.link(traces.first[-2].id,traces.first[-1].id)
+                else
+                  @source.graph.link(branch.id,traces.first_node.id)
+                end
+              end
+              unless li.nil?
+                if branch.condition?
+                  branch.condition << li.condition if !li.condition.nil? && !li.condition&.strip&.empty?
+                  branch.otherwise = li.otherwise if li.condition.nil?
+                  branch.condition.uniq!
+                  branch.condition_type = "text/x-ruby"
+                end
+                if branch.respond_to?(:attributes)
+                  branch.attributes.merge!(li.attributes)
+                  li.attributes.delete_if{true}
+                end
+              end
+            end
+
+            if node == enode
+              traces.shift_all
+            elsif traces.incoming(node) == 1
+              traces.shift_all
+              n = map_node(node,traces.same_first)
+              if !n.nil? && !(n.container? && traces.finished?)
+                (branch << n).compact!
+              end
+            else
+              if debug
+                p "Type: #{node.type}"
+                p "  All Loops: #{traces.all_loops?}"
+                p "  All Loops Head Controlled: #{traces.all_front?}"
+                p "  All Loops Tail Controlled: #{traces.all_tail?}"
+              end
+              if traces.all_loops? && traces.all_front?
+                loops = traces.loops_only
+                traces.remove(loops)
+
+                ### an infinite loop that can only be left by break is created
+                ### at the output time it is decided wether this can be optimized
+                branch << Loop.new(node.id)
+                branch.last.mode = :post_test if loops.all_tail?
+                ### remove the exclusive gateway because we no longer need it
+                ### if there is non (tail controlled, remove the loop target (last)
+                if node.type == :exclusiveGateway
+                  loops.shift_all
+                  traces.shift_all
+                else
+                  loops.pop_all
+                end
+                ### add the blank conditional to get a break
+                puts '--> down head_loop to ' + (down + 1).to_s if debug
+                if loops.same_first
+                  build_ttree branch.last.new_branch, loops, nil, debug, down + 1
+                else
+                  build_ttree branch, loops, nil, debug, down + 1
+                end
+                puts '--> up head_loop from ' + (down + 1).to_s if debug
+              elsif node.type == :exclusiveGateway && !traces.all_loops? && traces.all_front?
+                loops = traces.loops_only
+                traces.remove(loops)
+                traces.eliminate_front(loops)
+                build_ttree branch, loops, nil, debug, down + 1
+              elsif node.type == :exclusiveGateway && !traces.all_loops? && !traces.all_front?
+                loops = traces.loops_and_partial_loops
+                traces.remove(loops)
+
+                ### an infinite loop that can only be left by break is created
+                ### at the output time it is decided wether this can be optimized
+                branch << Loop.new(node.id)
+                ### duplicate because we need it later to remove all the shit from traces
+                loops.add_breaks(self.object_id,node.type == :exclusiveGateway)
+                ### remove the exclusive gateway because we no longer need it
+                ### if there is non (tail controlled, remove the loop target (last)
+                if node.type == :exclusiveGateway
+                  loops.shift_all
+                  traces.shift_all
+                else
+                  loops.pop_all
+                end
+                ### add the blank conditional to get a break
+                puts '--> down head_loop to ' + (down + 1).to_s if debug
+                if loops.same_first
+                  build_ttree branch.last.new_branch, loops, nil, debug, down + 1
+                else
+                  build_ttree branch, loops, nil, debug, down + 1
+                end
+                puts '--> up head_loop from ' + (down + 1).to_s if debug
+              elsif node.type != :exclusiveGateway && traces.all_loops? && !traces.all_front?
+                # same as below
+                endnode = traces.find_endnode || enode
+                puts "--> endnode #{endnode.nil? ? 'nil' : endnode.niceid}" if debug
+                tracesgroup, endnode = traces.segment_by endnode
+                tracesgroup.each do |trcs|
+                  next unless branch.last.respond_to?(:new_branch)
+                  nb = branch.last.new_branch
+                  unless trcs.finished?
+                    puts '--> branch down to ' + (down + 1).to_s if debug
+                    build_ttree nb, trcs, endnode, debug, down + 1
+                    puts '--> branch up from ' + (down + 1).to_s if debug
+                  end
+                end
+                # remove all traces that don't start with endnode to account for loops
+                if endnode.nil?
+                  traces.empty!
+                else
+                  traces.remove_by_endnode(endnode)
+                end
+              elsif node.type != :exclusiveGateway && !traces.all_loops? && !traces.all_front?
+                traces.extend
+                traces.shift_all
+                n = map_node(node,traces.same_first)
+                if !n.nil? && !(n.container? && traces.finished?)
+                  (branch << n).compact!
+                end
+              elsif node.type != :exclusiveGateway && !traces.all_loops? && traces.all_front?
+                traces.extend
+                traces.shift_all
+                n = map_node(node,traces.same_first)
+                if !n.nil? && !(n.container? && traces.finished?)
+                  (branch << n).compact!
+                end
+              else
+                loops = traces.loops_and_partial_loops
+
+                ### throw away the loop traces, remove loop traces from front of all other traces
+                traces.remove(loops)
+                traces.eliminate(loops)
+                loops.extend
+
+                branch << Loop.new(node.id)
+
+                puts '--> down tail_loop to ' + (down + 1).to_s if debug
+                if loops.same_first
+                  build_ttree branch.last.new_branch, loops.dup, nil, debug, down + 1
+                else
+                 build_ttree branch, loops.dup, nil, debug, down + 1
+                end
+                puts '--> up tail_loop from ' + (down + 1).to_s if debug
+              end
+              traces.remove_empty
+            end
+          else
+            endnode = traces.find_endnode || enode
+            puts "--> endnode #{endnode.nil? ? 'nil' : endnode.niceid}" if debug
+            tracesgroup, endnode = traces.segment_by endnode
+            tracesgroup.each do |trcs|
+              branch << Conditional.new(0,:exclusive,:exclusiveGateway) unless branch.last.respond_to?(:new_branch)
+              nb = branch.last.new_branch
+              unless trcs.finished?
+                puts '--> ebranch down to ' + (down + 1).to_s if debug
+                build_ttree nb, trcs, endnode, debug, down + 1
+                puts '--> ebranch up from ' + (down + 1).to_s if debug
+              end
+            end
+            # remove all traces that don't start with endnode to account for loops
+            if endnode.nil?
+              traces.empty!
+            else
+              traces.remove_by_endnode(endnode)
+            end
+          end
+        end
+      end
+      private :build_ttree
+
+      def debug_print(debug,traces) #{{{
+        if debug
+          puts '-' * @hl.output_cols, @source.tree.to_s
+          puts traces.to_s
+          @hl.ask('Continue ... ')#{ |q| q.echo = false }
+        end
+      end #}}}
+      private :debug_print
+
+      def generate_model(formater) #{{{
+        formater.new(@source.tree).generate
+      end #}}}
+
+    end
+
+  end
+
+end

data/server/trans

@@ -0,0 +1,38 @@
+#!/usr/bin/ruby
+#
+# 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 LICENSE in the main directory). If not,
+# see <http://www.gnu.org/licenses/>.
+
+if File.exist?(File.join(__dir__,'..','lib','cpee','transformation','implementation.rb'))
+  require_relative File.join(__dir__,'..','lib','cpee','transformation','implementation')
+elsif File.exist?(File.join(Dir.home,'Projects','cpee-transformation','lib','cpee','transformation','implementation.rb'))
+  require_relative File.join(Dir.home, 'Projects','cpee-transformation','lib','cpee','transformation','implementation')
+else
+  require 'cpee/transformation/implementation'
+end
+
+options = {
+  :host => 'localhost',
+  :port => 9295,
+  :secure => false,
+}
+
+Riddl::Server.new(CPEE::Transformation::Service::SERVER, options) do
+  accessible_description true
+  cross_site_xhr true
+
+  use CPEE::Transformation::Service::implementation(@riddl_opts)
+end.loop!

data/tools/bpmn2_to_cpee.rb

@@ -0,0 +1,84 @@
+#!/usr/bin/ruby
+# 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/>.
+
+def wrap(s1, s2, width=78, indent=ARGV.options.summary_width + 3)
+  lines = []
+  s = ARGV.options.summary_indent + s1 + ' ' * (indent - s1.length - ARGV.options.summary_indent.length) + s2
+  line, s = s[0..indent-2], s[indent..-1]
+  s.split(/\n/).each do |ss|
+    ss.split(/[ \t]+/).each do |word|
+      if line.size + word.size >= width
+        lines << line
+        line = (" " * (indent)) + word
+      else
+        line << " " << word
+      end
+    end
+    lines << line if line
+    line = (" " * (indent-1))
+  end
+  return lines.join("\n")
+end
+
+require 'optparse'
+
+require_relative '../lib/cpee/transformation/transformer' rescue nil
+require_relative '../lib/cpee/transformation/cpee' rescue nil
+require_relative '../lib/cpee/transformation/bpmn2' rescue nil
+
+interactive = false
+printtree = false
+
+ARGV.options { |opt|
+  opt.summary_indent = ' ' * 2
+  opt.summary_width = 18
+  opt.banner = "Usage:\n#{opt.summary_indent}#{File.basename($0)} FNAME\n"
+  opt.on("Options:")
+  opt.on("--help", "-h", "This text") { puts opt; exit }
+  opt.on("--interactive", "-i", "Interactive mode") { interactive = true }
+  opt.on("--tree", "-t", "Print tree") { printtree = true }
+  opt.on("")
+  opt.on(wrap("[FNAME]","convert BPMN2 in file FNAME to cpee tree and output to console."))
+  opt.parse!
+}
+
+if ARGV.length != 1
+  puts ARGV.options
+  exit
+else
+  f = ARGV[0]
+end
+
+model = CPEE::Transformation::Source::BPMN2.new(File.read(f))
+
+trans = CPEE::Transformation::Transformer.new(model)
+traces = trans.build_traces
+
+if interactive
+  puts traces.legend
+  tree = trans.build_tree(true)
+else
+  tree = trans.build_tree(false)
+end
+
+if printtree
+  puts tree.to_s
+else
+  puts trans.generate_model(CPEE::Transformation::Target::CPEE)
+end

data/tools/bpmn2_to_mermaid.rb

@@ -0,0 +1,85 @@
+#!/usr/bin/ruby
+# 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/>.
+
+def wrap(s1, s2, width=78, indent=ARGV.options.summary_width + 3)
+  lines = []
+  s = ARGV.options.summary_indent + s1 + ' ' * (indent - s1.length - ARGV.options.summary_indent.length) + s2
+  line, s = s[0..indent-2], s[indent..-1]
+  s.split(/\n/).each do |ss|
+    ss.split(/[ \t]+/).each do |word|
+      if line.size + word.size >= width
+        lines << line
+        line = (" " * (indent)) + word
+      else
+        line << " " << word
+      end
+    end
+    lines << line if line
+    line = (" " * (indent-1))
+  end
+  return lines.join("\n")
+end
+
+require 'optparse'
+
+require_relative '../lib/cpee/transformation/transformer' rescue nil
+require_relative '../lib/cpee/transformation/bpmn2' rescue nil
+require_relative '../lib/cpee/transformation/mermaid' rescue nil
+
+interactive = false
+printtree = false
+
+ARGV.options { |opt|
+  opt.summary_indent = ' ' * 2
+  opt.summary_width = 18
+  opt.banner = "Usage:\n#{opt.summary_indent}#{File.basename($0)} FNAME\n"
+  opt.on("Options:")
+  opt.on("--help", "-h", "This text") { puts opt; exit }
+  opt.on("--interactive", "-i", "Interactive mode") { interactive = true }
+  opt.on("--tree", "-t", "Print tree") { printtree = true }
+  opt.on("")
+  opt.on(wrap("[FNAME]","convert cpee bpmn2 in file FNAME to mermaid and output to console."))
+  opt.parse!
+}
+
+if ARGV.length != 1
+  puts ARGV.options
+  exit
+else
+  f = ARGV[0]
+end
+
+model = CPEE::Transformation::Source::BPMN2.new(File.read(f))
+
+trans = CPEE::Transformation::Transformer.new(model)
+traces = trans.build_traces
+
+if interactive
+  puts traces.legend
+  puts
+  tree = trans.build_tree(true)
+else
+  tree = trans.build_tree(false)
+end
+
+if printtree
+  puts tree.to_s
+else
+  puts trans.generate_model(CPEE::Transformation::Target::Mermaid)
+end