cpee-transformation 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 82860b1b2f751e6d29319250031aea2eae811e7d4e5d8570417ace70a9c21ff4
+  data.tar.gz: c6c8bff280aa7fdfa979039277d30308f8d5438b0d8a420a4cee92b86a5e457f
+SHA512:
+  metadata.gz: 6c62e768e1c33b837150a64c72f4ed0bcc504a50ff18704701df7e094e980b87625ca246cb15212892a4a53326d7c30be5a65b15d403828145aedede7db2df0d
+  data.tar.gz: e4c327c3ef7b21baac4f29755f8405004baa70a1b7f539536f3421e0a246fb918fad960c1761d670a32b7c89229237c5ad2cb63023bba77dba3bf3043b4ce8d2

data/AUTHORS

@@ -0,0 +1,2 @@
+Juergen 'eTM' Mangler <juergen.mangler@gmail.com>
+Nataliia Klievtsova <n.klievtsova@gmail.com>

data/LICENSE

@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.

data/README.md

@@ -0,0 +1 @@
+# cpee-transformation

data/Rakefile

@@ -0,0 +1,21 @@
+require 'rake'
+require 'rubygems/package_task'
+
+spec = eval(File.read('cpee-transformation.gemspec'))
+Gem::PackageTask.new(spec) do |pkg|
+  pkg.need_zip = true
+  pkg.need_tar = true
+  FileUtils.mkdir 'pkg' rescue nil
+  FileUtils.rm_rf Dir.glob('pkg/*')
+  FileUtils.ln_sf "#{pkg.name}.gem", "pkg/#{spec.name}.gem"
+end
+
+task :default => [:gem]
+
+task :push => :gem do |r|
+  `gem push pkg/cpee-transformation.gem`
+end
+
+task :install => :gem do |r|
+  `gem install pkg/cpee-transformation.gem`
+end

data/cpee-transformation.gemspec

@@ -0,0 +1,29 @@
+Gem::Specification.new do |s|
+  s.name             = "cpee-transformation"
+  s.version          = "1.0.0"
+  s.platform         = Gem::Platform::RUBY
+  s.license          = "LGPL-3.0-or-later"
+  s.summary          = "CPEE Transformation between different formats"
+
+  s.description      = "see http://cpee.org"
+
+  s.files            = Dir['{server/*,tools/**/*,lib/**/*}'] + %w(LICENSE Rakefile cpee-transformation.gemspec README.md AUTHORS)
+  s.require_path     = 'lib'
+  s.extra_rdoc_files = ['README.md']
+  s.bindir           = 'tools'
+  s.executables      = ['bpmn2_to_cpee.rb', 'bpmn2_to_mermaid.rb', 'bpmn2_to_ptml.rb', 'cpee_to_cpee.rb', 'cpee_to_mermaid.rb', 'cpee_to_ptml.rb', 'cpee_to_text_bf.rb', 'cpee_to_text_df-poe.rb', 'cpee_to_text_df-por.rb', 'cpee-trans', 'mermaid_to_cpee.rb', 'ptml_to_cpee.rb']
+
+  s.required_ruby_version = '>=3.4'
+
+  s.authors          = ['Juergen eTM Mangler', 'Nataliia Klievtsova']
+
+  s.email            = 'juergen.mangler@gmail.com'
+  s.homepage         = 'http://github.com/etm/cpee-transformation/'
+
+  s.add_runtime_dependency 'riddl', '~> 1.0'
+  s.add_runtime_dependency 'json', '~> 2.10'
+  s.add_runtime_dependency 'xml-smart', '~> 0.4'
+  s.add_runtime_dependency 'typhoeus', '~> 1.4'
+  s.add_runtime_dependency 'highline', '~> 2.0'
+end
+

data/lib/cpee/transformation/beautiful.rb

@@ -0,0 +1,182 @@
+# 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 'securerandom'
+require 'json'
+
+module CPEE
+
+  module Transformation
+
+    module Source
+
+      class Beautiful
+        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_log(text)
+
+          @traces = Traces.new [[@start]]
+        end #}}}
+
+				def map_nodes(node)
+					case node
+            when 'task'; :task
+            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_log(text) #{{{
+          first = nil
+          decisions = {}
+          decisions_join = {}
+          loops = []
+          loops_end = []
+          parallel_joins = []
+          @start = Node.new(0,SecureRandom.uuid,:startEvent,'start',0,1)
+          @graph.add_node @start
+          last = @start
+          cond = nil
+          text.each_line do |line|
+            if line =~ /^\s*beautiful_pipeline_end_check\s-\s(\d+)\s-\s(\d+)/ #{{{
+              key = $1
+              if decisions[key]
+                decisions_join[key] << last
+              end
+              lid = SecureRandom.uuid
+              n1 = Node.new(0,lid,:exclusiveGateway,'xor end',0,0)
+              graph.add_node n1
+              decisions_join[key].each do |e|
+                graph.add_link Link.new(e.id,lid,nil)
+              end
+              last = n1
+              decisions_join.delete(key)
+              decisions.delete(key) #}}}
+            elsif line =~ /^\s*beautiful_pipeline_check\s-\s(\d+)\s-\s(\d+)/ #{{{
+              key = $1
+              if decisions[key]
+                decisions_join[key] << last
+                last = decisions[key]
+              else
+                lid = SecureRandom.uuid
+                n1 = Node.new(0,lid,:exclusiveGateway,'xor otherwise',0,0)
+                graph.add_node n1
+                graph.add_link Link.new(last.id,lid,nil)
+                last = n1
+                decisions[key] = n1
+                decisions_join[key] = []
+              end #}}}
+            elsif line =~ /^\s*beautiful_pipeline_check\s-\s(\d+)\s-\s(.*)\s-\s(\d+)/ #{{{
+              key = $1
+              if decisions[key]
+                decisions_join[key] << last
+                last = decisions[key]
+              else
+                lid = SecureRandom.uuid
+                cond = $2
+                n1 = Node.new(0,lid,:exclusiveGateway,'xor',0,0)
+                graph.add_link Link.new(last.id,lid,nil)
+                graph.add_node n1
+                last = n1
+                decisions[key] = n1
+                decisions_join[key] = []
+              end #}}}
+            elsif line =~ /^\s*beautiful_pipeline_loop\s-\s(.*)\s-\s(\d+)/ #{{{
+              lid1 = SecureRandom.uuid
+              lid2 = SecureRandom.uuid
+              cond = $1
+              n1 = Node.new(0,lid1,:exclusiveGateway,'loope',0,0)
+              n2 = Node.new(0,lid2,:exclusiveGateway,'loops',0,0)
+              graph.add_link Link.new(last.id,lid1,nil)
+              graph.add_link Link.new(lid1,lid2,nil)
+              graph.add_node n1
+              graph.add_node n2
+              last = n2
+              loops << n1
+              loops_end << n2 #}}}
+            elsif line =~ /^\s*beautiful_pipeline_end_loop\s-\s(\d+)/ #{{{
+              graph.add_link Link.new(last.id,loops.last.id,nil)
+              last = n1
+              loops << n1
+              last = loops_end.pop
+              loops.pop #}}}
+            elsif line =~ /^\s*beautiful_pipeline_continue\s-\s(\d+)/ #{{{
+              graph.add_link Link.new(last.id,loops.last.id,nil) #}}}
+            elsif line =~ /^\s*beautiful_pipeline_break\s-\s(\d+)/ #{{{
+              lid = SecureRandom.uuid
+              n1 = Node.new(0,lid,:break,'break',0,0)
+              graph.add_node n1
+              graph.add_link Link.new(last.id,lid,nil)
+              last = n1 #}}}
+            elsif line =~ /^\s*beautiful_pipeline_parallel\s-\s(\d+)/ #{{{
+              lid = SecureRandom.uuid
+              n1 = Node.new(0,lid,:parallelGateway,'parallel_start',0,0)
+              parallel_joins << [ n1, {} ]
+              last = n1 #}}}
+            elsif line =~ /^\s*beautiful_pipeline_end_parallel\s-\s(\d+)/ #{{{
+              lay = $1
+              lid = SecureRandom.uuid
+              n1 = Node.new(0,lid,:parallelGateway,'parallel_join',0,0)
+              start, list = parallel_joins.pop
+              list.each do |e|
+                graph.add_link Link.new(e.id,lid,nil)
+              end #}}}
+            elsif line =~ /^\s*(\{.*\})\s-\s(\d+)/ #{{{
+              pj = parallel_joins.last
+              pid = $2
+              j = JSON::parse($1.gsub(/'/,'"'))
+              lid = SecureRandom.uuid
+              n1 = Node.new(0,lid,:task,j.dig('name'),0,0)
+              graph.add_node n1
+              if pj.nil? || pj[1].has_key?(pid)
+                graph.add_link Link.new(last.id,lid,cond.nil? ? nil : cond)
+              else
+                graph.add_link Link.new(pj[0].id,lid,cond.nil? ? nil : cond)
+              end
+              cond = nil
+              last = n1
+              pj[1][pid] = n1 if pj
+            end #}}}
+          end
+        end #}}}
+
+      end
+
+    end
+
+  end
+
+end

data/lib/cpee/transformation/bpmn2.rb

@@ -0,0 +1,144 @@
+# 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 'xml/smart'
+
+module CPEE
+
+  module Transformation
+
+    module Source
+
+      class BPMN2
+        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)
+          doc.register_namespace 'bm',  "http://www.omg.org/spec/BPMN/20100524/MODEL"
+
+          @dataelements = {}
+          @endpoints = {}
+          @graph = Graph.new
+
+          extract_dataelements(doc)
+          extract_endpoints(doc)
+          extract_nodelink(doc)
+
+          if @start.nil?
+            @traces = Traces.new [[]]
+          else
+            @traces = Traces.new [[@start]]
+          end
+        end #}}}
+
+        def extract_dataelements(doc) #{{{
+          doc.find("/bm:definitions/bm:process/bm:property[bm:dataState/@name='cpee:dataelement']").each do |ref|
+            if ref.attributes['itemSubjectRef']
+              doc.find("/bm:definitions/bm:itemDefinition[@id=\"" + ref.attributes['itemSubjectRef'] + "\"]").each do |sref|
+                @dataelements[ref.attributes['name']] = sref.attributes['structureRef'].to_s
+              end
+            else
+              @dataelements[ref.attributes['name']] = ''
+            end
+          end
+        end #}}}
+
+        def extract_endpoints(doc) #{{{
+          doc.find("/bm:definitions/bm:process/bm:property[bm:dataState/@name='cpee:endpoint']/@itemSubjectRef").each do |ref|
+            doc.find("/bm:definitions/bm:itemDefinition[@id=\"" + ref.value + "\"]/@structureRef").each do |sref|
+              @endpoints[ref.value] = sref.value
+            end
+          end
+        end #}}}
+
+        def extract_nodelink(doc) #{{{
+          doc.find("/bm:definitions/bm:process/bm:*[@id and @name and not(@itemSubjectRef) and not(name()='sequenceFlow')]").each do |e|
+            n = Node.new(self.object_id,e.attributes['id'],e.qname.name.to_sym,e.attributes['name'].strip,e.find('count(bm:incoming)'),e.find('count(bm:outgoing)'))
+
+            if e.attributes['scriptFormat'] != ''
+              n.script_type = e.attributes['scriptFormat']
+            end
+
+            e.find("bm:property[@name='cpee:endpoint']/@itemSubjectRef").each do |ep|
+              n.endpoints << ep.value
+            end
+            e.find("bm:property[@name='cpee:method']/@itemSubjectRef").each do |m|
+              n.methods << m.value
+            end
+            e.find("bm:script").each do |s|
+              n.script ||= ''
+              n.script << s.text.strip
+            end
+            e.find("bm:ioSpecification/bm:dataInput").each do |a|
+              name = a.attributes['name']
+              value = a.attributes['itemSubjectRef']
+              unless name.nil?
+                if @dataelements.keys.include?(value)
+                  n.arguments[name] = 'data.' + value
+                else
+                  n.arguments[name] = value
+                end
+              end
+            end
+            e.find("bm:ioSpecification/bm:dataOutput").each do |a|
+              ref = a.attributes['id']
+              e.find("bm:dataOutputAssociation[bm:sourceRef=\"#{ref}\"]").each do |d|
+                n.script_var = ref
+                n.script_id = d.find("string(bm:targetRef)")
+              end
+            end
+
+            @graph.add_node n
+            @start = n if n.type == :startEvent && @start == nil
+          end
+
+          # extract all sequences to a links
+          doc.find("/bm:definitions/bm:process/bm:sequenceFlow").each do |e|
+            source = e.attributes['sourceRef']
+            target = e.attributes['targetRef']
+            cond = e.find('bm:conditionExpression')
+            @graph.add_link Link.new(source, target, cond.empty? ? nil : cond.first.text.strip)
+          end
+
+          @graph.clean_up do |node|
+            if node.type == :scriptTask && (x = @graph.find_script_id(node.id)).any?
+              x.each do |k,n|
+                n.script = node.script
+                n.script_type = node.script_type
+              end
+              true
+            else
+              false
+            end
+          end
+        end #}}}
+
+      end
+
+    end
+
+
+  end
+
+end