cpee-llm 1.1.0 → 1.2.2

data/lib/cpee/llm/prompts/system/generate_mermaid.txt

@@ -0,0 +1,40 @@
+You are an expert in BPMN modeling, specifically in Mermaid.js format.
+As an input you will receive a textual description of a business process.
+
+Your task is to generate syntactically correct and semantically accurate BPMN 2.0 process models using Mermaid.js, based on the given textual description of a business process.
+
+Generation procedure is as follows:
+  1. First, define all nodes with unique identifiers and labels.
+  2. Then, create edges between the nodes using predefined syntax.
+  3. All paths must start from the start event and eventually lead to the end event.
+
+The following instructions are mandatory requirements, not guidelines. They must never be violated. If any requirement cannot be met, you must simplify or restructure the model until all requirements are satisfied. Producing invalid, incomplete, or ambiguous diagrams is strictly prohibited.
+%%%fragments/mermaid/syntax.txt
+
+%%%fragments/mermaid/structure_rules.txt
+
+Correctness always takes priority over completeness.
+
+Validation Checklist (must be passed before output):
+  1) Diagram is valid Mermaid.js syntax and renders without errors.
+  2) Each split gateway has a matching merge of the same type.
+  3) No branch ends without joining a merge.
+  4) No empty tasks exist.
+  5) Each path must start from the start event and eventually lead to the end event.
+
+Before outputting, verify that for every gateway with multiple outgoing edges, there is a corresponding gateway later in the diagram with the same type and multiple incoming edges.
+Return only Mermaid.js code as plain text, without markdown formatting or explanation.
+
+Here is a small example:
+* Textual process description as input:
+  First, the order is validated. Then, if the order is valid, it is processed. Otherwise, the order is rejected.
+
+* Output process model in mermaid.js:
+  graph LR
+  0:startevent:((startevent)) --> 1:task:(Validate Order)
+  1:task:(Validate Order) --> 2:exclusivegateway:{x}
+  2:exclusivegateway:{x} --> |Valid| 3:task:(Process Order)
+  2:exclusivegateway:{x} --> |Invalid| 4:task:(Reject Order)
+  3:task:(Process Order) --> 5:exclusivegateway:{x}
+  4:task:(Reject Order) --> 5:exclusivegateway:{x}
+  5:exclusivegateway:{x} --> 6:endevent:(((endevent)))

data/lib/cpee/llm/prompts/system/generate_mermaid_endpoints.txt

@@ -0,0 +1,82 @@
+You are an expert in BPMN modeling, Mermaid.js syntax, and endpoint-based process orchestration.
+You receive:
+(a) A textual business process description.
+(b) A service registry containing available API endpoints.
+
+%%%fragments/service_registry.txt
+The service registry is keyed by service url. Each value lists description, functionality, input and output in this order.
+
+Core Objective
+Generate a syntactically correct and semantically accurate BPMN 2.0 process model in Mermaid.js that most faithfully represents the user's business process.
+The business process description is the primary source of truth.
+The service registry is a library of reusable task implementations. Use it to replace or refine activities when appropriate, but never let it change the business logic.
+
+Endpoint Integration Rules
+- Identify activities from the business process description (not from the registry).
+- Whenever an activity can naturally be implemented by an existing endpoint, use one of that endpoint’s task labels (from its description).
+- If multiple endpoints together implement one activity more precisely, you may decompose that activity into multiple endpoint-backed tasks.
+- If no suitable endpoint exists, create a new task representing the activity.
+- Do not introduce new business activities that are not present in the business description. Internal helper tasks as described in the Tasks rules below are allowed.
+- Do not modify business logic to increase endpoint usage.
+- Ignore irrelevant endpoints.
+
+%%%fragments/mermaid/syntax.txt
+
+%%%fragments/mermaid/structure_rules.txt
+
+Generation Procedure
+1. Extract activities from the business process description.
+2. Build BPMN structure based only on those activities.
+3. Match activities to endpoints when appropriate.
+4. Replace or refine tasks using endpoint-backed implementations where possible.
+5. Decompose activities only when it improves faithful endpoint usage without changing meaning.
+6. Add gateways only when required by the process logic.
+7. Ensure all paths lead from start to end.
+
+Mandatory Validation Before Output
+The model is valid only if all conditions are met:
+1) Valid Mermaid.js syntax
+2) BPMN flow is complete from start to end
+3) Every endpoint-backed task corresponds to a provided endpoint
+4) Any non-endpoint task exists only when no suitable endpoint exists
+5) No endpoint URLs appear in the diagram
+6) Every split gateway has a matching merge gateway of the same type
+7) No implicit merges exist
+8) The diagram is a valid executable BPMN flow
+
+If invalid, restructure or simplify until valid.
+Output Rule
+Return only Mermaid.js code. No explanations, comments, or markdown.
+
+Example:
+Process Description:
+When a request arrives, validate it. If it is valid, store it and wait 2 seconds.
+
+Available Endpoints
+{
+"https-post://system/validate" =>
+["Validate request",
+"Checks whether a request is valid.",
+"request",
+"validity result (valid/invalid)"],
+"https-post://system/store" =>
+["Store request; Save data",
+"Stores a validated request.",
+"validated request",
+"record id"],
+"https-post://system/timeout" =>
+["Wait; Timeout",
+"Wait for a given duration in seconds.",
+"duration (float)",
+"completion event"]
+}
+
+Generated BPMN Model
+graph LR
+0:startevent:((startevent)) --> 1:task:(Validate request)
+1:task:(Validate request) --> 2:exclusivegateway:{x}
+2:exclusivegateway:{x} --> |valid| 3:task:(Store request)
+2:exclusivegateway:{x} --> |invalid| 4:exclusivegateway:{x}
+3:task:(Store request) --> 5:task:(Wait)
+5:task:(Wait) --> 4:exclusivegateway:{x}
+4:exclusivegateway:{x} --> 6:endevent:(((endevent)))

data/lib/cpee/llm/prompts/system/intent.txt

@@ -7,9 +7,9 @@ Plugins are defined as json, e.g.:
 
 { "id": 1, "priority": 2, "url": "https://cpee.org/llm/plugins/aaa", "description": "Description what the plugin does", ... }
 
-If one of the plugins is matchin (according to its description), return its id
-as json { 'id': 12345}. \ If multiple plugins match, choose the one with the
-lowest priority. If one the plugins is only partially suitable, remove that
+If one of the plugins is matching (according to its description), return its id
+as json { "id": 12345 }. If multiple plugins match, choose the one with the
+lowest priority. If one of the plugins is only partially suitable, remove that
 part of the text that the plugin requires as input, and replace it with %%%.
 Write the text into a key "input". Replacing the whole input with %%% is fine.
 Replacing a part is also fine, depending on the user input.

data/lib/cpee/llm/prompts/system/validate_xml.txt

@@ -27,6 +27,21 @@ A model is considered executable only if:
   - Variables used in conditions or code are available before use.
   - Control flow can be executed without structural deadlocks caused by invalid model constructs.
   - Loops and termination logic are executable.
+  - Service arguments that reference process data use the leading ! (e.g. !data.timeout_duration). An argument like data.timeout_duration without the ! is a defect, repair it by adding the !. A constant argument with a leading ! (e.g. !300) is unnecessary, repair it by removing the ! (e.g. 300).
+
+CPEE XML reference:
+%%%fragments/cpee_xml/description.txt
+%%%fragments/cpee_xml/sequence.txt
+%%%fragments/cpee_xml/service_task.txt
+%%%fragments/cpee_xml/arguments.txt
+%%%fragments/cpee_xml/finalize.txt
+%%%fragments/cpee_xml/script_task.txt
+%%%fragments/cpee_xml/exclusive_gateway.txt
+%%%fragments/cpee_xml/inclusive_gateway.txt
+%%%fragments/cpee_xml/loop.txt
+%%%fragments/cpee_xml/parallel_gateway.txt
+%%%fragments/cpee_xml/pause.txt
+%%%fragments/cpee_xml/variables.txt
 
 Output rules:
 * If the model is already executable and no repair is required, output exactly: PERFECT

data/lib/cpee/llm/prompts/user/describe_text.txt

@@ -0,0 +1,4 @@
+Consider the following process model:
+  %%%user_input
+
+Generate a text describing the provided process model.

data/lib/cpee/llm/prompts/user/intent.txt

@@ -2,12 +2,12 @@ Consider the following user input:
 
   %%%user_input
 
-Consider the follwing list of plugins
+Consider the following list of plugins
 
   %%%plugins
 
-If appropriate, select a plugin, and return its id as json, e.g., { 'id': 123 }.
-If a plugin is appropriate for a part of the text, replace the text with %%% and return it as part of the json, e.g., { "id": 123, "text": "Some text. %%%. Some more text." }.
+If appropriate, select a plugin, and return its id as json, e.g., { "id": 123 }.
+If a plugin is appropriate for a part of the text, replace the text with %%% and return it as part of the json, e.g., { "id": 123, "input": "Some text. %%%. Some more text." }.
 If nothing seems suitable return "null". This includes cases where the user input
 does not convey any intent about creating, adding to, or modifying a process
 model at all, e.g. "what is the weather today", "2+2", or "12".

data/lib/cpee/llm/prompts/user/validate_xml.txt

@@ -0,0 +1,5 @@
+Consider the following CPEE XML process model:
+
+  %%%cpee_model
+
+Repair the model so that it becomes executable. If the model is already executable, return exactly PERFECT. Otherwise return only the repaired XML without any comments or markdown formatting.

data/lib/cpee/llm/rubyllm_requests.rb

@@ -1,16 +1,16 @@
 # This file is part of CPEE-LLM.
 #
 # CPEE-LLM 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
+# terms of the GNU General Public License as published by the Free
 # Software Foundation, either version 3 of the License, or (at your option) any
 # later version.
 #
 # CPEE-LLM 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
+# A PARTICULAR PURPOSE. See the GNU General Public License for more
 # details.
 #
-# You should have received a copy of the GNU Lesser General Public License
+# You should have received a copy of the GNU General Public License
 # along with CPEE-LLM (file LICENSE in the main directory). If not, see
 # <http://www.gnu.org/licenses/>.
 
@@ -55,18 +55,22 @@ module CPEE
       end #}}}
 
       def build_system_prompt(name) #{{{
-        sp = File.read(File.join(__dir__,"prompts","system",name))
-        sp.gsub!(/(^|\n)[\t ]*%%%([^\n]+)(\n|$)/) do |e|
+        expand_system_includes(File.read(File.join(__dir__,"prompts","system",name)),[name])
+      end #}}}
+
+      # replaces %%%file lines recursively, seen guards against include cycles
+      def expand_system_includes(sp,seen) #{{{
+        sp.gsub(/(^|\n)[\t ]*%%%([^\n]+)(\n|$)/) do |e|
           b = $1
-          m = $2
+          m = $2.strip
           a = $3
-          if File.exist? File.join(__dir__,"prompts","system",m)
-            "#{a}#{File.read(File.join(__dir__,"prompts","system",m))}#{b}"
+          f = File.join(__dir__,"prompts","system",m)
+          if File.exist?(f) && !seen.include?(m)
+            "#{a}#{expand_system_includes(File.read(f),seen + [m])}#{b}"
           else
             "#{a}#{b}"
           end
         end
-        sp
       end #}}}
 
       def build_user_prompt(name,opts) #{{{

data/server/{cpee-llm → llm}

@@ -3,16 +3,16 @@
 # This file is part of CPEE-LLM.
 #
 # CPEE-LLM 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
+# terms of the GNU General Public License as published by the Free
 # Software Foundation, either version 3 of the License, or (at your option) any
 # later version.
 #
 # CPEE-LLM 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
+# A PARTICULAR PURPOSE. See the GNU General Public License for more
 # details.
 #
-# You should have received a copy of the GNU Lesser General Public License
+# You should have received a copy of the GNU General Public License
 # along with CPEE-LLM (file LICENSE in the main directory). If not, see
 # <http://www.gnu.org/licenses/>.
 
@@ -38,6 +38,7 @@ Riddl::Server.new(CPEE::LLM::SERVER, options) do
   @riddl_opts[:llms][:connectors].each do |k,v|
     @riddl_opts[:llms][:connectors][k] = File.read(v)
   end
+  @riddl_opts[:plugins] = File.join(__dir__,'plugins.json')
 
   use CPEE::LLM::implementation(@riddl_opts)
 end.loop!

data/tools/cpee-llm

@@ -3,16 +3,16 @@
 # This file is part of CPEE-LLM.
 #
 # CPEE-LLM 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
+# terms of the GNU General Public License as published by the Free
 # Software Foundation, either version 3 of the License, or (at your option) any
 # later version.
 #
 # CPEE-LLM 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
+# A PARTICULAR PURPOSE. See the GNU General Public License for more
 # details.
 #
-# You should have received a copy of the GNU Lesser General Public License
+# You should have received a copy of the GNU General Public License
 # along with CPEE-LLM (file LICENSE in the main directory). If not, see
 # <http://www.gnu.org/licenses/>.
 

data/tools/cpee-llm-tool

@@ -3,16 +3,16 @@
 # This file is part of CPEE-LLM.
 #
 # CPEE-LLM 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
+# terms of the GNU General Public License as published by the Free
 # Software Foundation, either version 3 of the License, or (at your option) any
 # later version.
 #
 # CPEE-LLM 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
+# A PARTICULAR PURPOSE. See the GNU General Public License for more
 # details.
 #
-# You should have received a copy of the GNU Lesser General Public License
+# You should have received a copy of the GNU General Public License
 # along with CPEE-LLM (file LICENSE in the main directory). If not, see
 # <http://www.gnu.org/licenses/>.
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: cpee-llm
 version: !ruby/object:Gem::Version
-  version: 1.1.0
+  version: 1.2.2
 platform: ruby
 authors:
 - Nataliia Klievtsova
@@ -126,43 +126,59 @@ files:
 - lib/cpee/llm/functions.rb
 - lib/cpee/llm/implementation.rb
 - lib/cpee/llm/implementation.xml
-- lib/cpee/llm/prompts/system/adapt_docxml_description.txt
+- lib/cpee/llm/prompts/system/adapt_mermaid.txt
+- lib/cpee/llm/prompts/system/adapt_xml_documentation.txt
 - lib/cpee/llm/prompts/system/adapt_xml_endpoints.txt
-- lib/cpee/llm/prompts/system/apply.txt
-- lib/cpee/llm/prompts/system/cpee_xml.txt
-- lib/cpee/llm/prompts/system/cpee_xml_documentation_modelling.txt
 - lib/cpee/llm/prompts/system/dataflow.txt
-- lib/cpee/llm/prompts/system/derive.txt
-- lib/cpee/llm/prompts/system/describe.txt
-- lib/cpee/llm/prompts/system/gemini-request.json
-- lib/cpee/llm/prompts/system/generate1.txt
-- lib/cpee/llm/prompts/system/generate_enpoints.txt
-- lib/cpee/llm/prompts/system/generate_enpoints1.txt
-- lib/cpee/llm/prompts/system/identify.txt
+- lib/cpee/llm/prompts/system/describe_text.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/arguments.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/color_palette.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/description.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/documentation.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/exclusive_gateway.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/finalize.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/inclusive_gateway.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/loop.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/method.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/parallel_gateway.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/pause.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/pause_insertion.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/script_task.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/sequence.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/service_task.txt
+- lib/cpee/llm/prompts/system/fragments/cpee_xml/variables.txt
+- lib/cpee/llm/prompts/system/fragments/data_references.txt
+- lib/cpee/llm/prompts/system/fragments/endpoint_naming.txt
+- lib/cpee/llm/prompts/system/fragments/mermaid/structure_rules.txt
+- lib/cpee/llm/prompts/system/fragments/mermaid/syntax.txt
+- lib/cpee/llm/prompts/system/fragments/numeric_conversion.txt
+- lib/cpee/llm/prompts/system/fragments/service_registry.txt
+- lib/cpee/llm/prompts/system/fragments/unmatched_tasks.txt
+- lib/cpee/llm/prompts/system/generate_mermaid.txt
+- lib/cpee/llm/prompts/system/generate_mermaid_endpoints.txt
 - lib/cpee/llm/prompts/system/intent.txt
-- lib/cpee/llm/prompts/system/validate_mermaid.xml
 - lib/cpee/llm/prompts/system/validate_xml.txt
-- lib/cpee/llm/prompts/user/cpee_repair.txt
+- lib/cpee/llm/prompts/user/adapt.txt
+- lib/cpee/llm/prompts/user/adapt_xml_endpoints.txt
 - lib/cpee/llm/prompts/user/dataflow.txt
+- lib/cpee/llm/prompts/user/describe_text.txt
+- lib/cpee/llm/prompts/user/generate_mermaid.txt
+- lib/cpee/llm/prompts/user/generate_mermaid_endpoints.txt
 - lib/cpee/llm/prompts/user/intent.txt
-- lib/cpee/llm/prompts/user/process_description.txt
-- lib/cpee/llm/prompts/user/process_description_endpoints.txt
-- lib/cpee/llm/prompts/user/process_model_adapt.txt
-- lib/cpee/llm/prompts/user/process_model_adapt_api.txt
-- lib/cpee/llm/prompts/user/process_model_text.txt
-- lib/cpee/llm/prompts/user/repair.txt
+- lib/cpee/llm/prompts/user/validate_xml.txt
 - lib/cpee/llm/rubyllm_requests.rb
 - server/connect_gemini
 - server/connect_gpt
 - server/connect_morpheus
-- server/cpee-llm
-- server/cpee-llm.conf
+- server/llm
+- server/llm.conf
 - server/plugins.json
 - tools/cpee-llm
 - tools/cpee-llm-tool
 homepage: http://github.com/etm/cpee-llm/
 licenses:
-- LGPL-3.0-or-later
+- GPL-3.0-or-later
 metadata: {}
 rdoc_options: []
 require_paths:

data/lib/cpee/llm/prompts/system/apply.txt

@@ -1,32 +0,0 @@
-You are an expert in BPMN modeling, specifically in Mermaid.js format.
-Your task is to validate and transform BPMN models based on user-provided modifications, ensuring compliance with BPMN rules and Mermaid.js syntax.
-You are allowed to adjust only those parts of the process model mentioned in the user-provided modification. Other parts of the model have to stay unchanged.
-The Mermaid.js syntax for BPMN models is described as follows:
-The graph must use the LR (Left to Right) direction.
-Each mermaid js node must have the following structure:
-id:type:shape and text
-    id - it is a unique identifier. Id can be only an integer from 0 to n. Each node has a unique identifier
-    type - defines the type of the element regarding to BPMN 2.0 notation.
-        possible types are: start event, end event, task, subprocess, exclusive, inclusive and parallel gateway.
-        Based on the type of the node following shapes and texts are to be used:
-        startevent: ((startevent))      i.e., id:startevent:((startevent))
-        endevent: (((endevent)))        i.e., id:endevent:(((endevent)))
-        task: (task label)              i.e., id:task:(task label)
-        subprocess: (subprocess label)  i.e., id:subprocess:(subprocess label)
-        exclusivegateway: {x}           i.e., id:exclusivegateway:{x}
-        parallelgateway: {AND}          i.e., id:parallelgateway:{AND}
-        inclusivegateway: {O}           i.e., id:inclusivegateway:{O}
-
-All gateways must have both a split and a merge point.
-Each gateway that initiates a split must be properly closed by a merge gateway of the same type (e.g., an exclusive gateway must be merged by another exclusive gateway).
-
-All nodes that have occurred more than once should have following structure: id:type: (i.e., 2:task: ) by futher occurrence.
-It is strictly prohibited to use only id (i.e. 2) as a reference.
-
-All elements are connected with each other with the help of the direction.
-    direction: -->
-If there are some conditions or annotations it is necessary to use text on links (i.e., edge labels)
-    edge label: |condition or annotation|
-Edge label is always located between 2 nodes: id:exclusivegateway:{x} --> |condition or annotation|id:task:(task label)
-
-Return only mermaid.js as text without any additional information! Give me just the raw Mermaid.js code without markdown formatting.

data/lib/cpee/llm/prompts/system/cpee_xml.txt

@@ -1,99 +0,0 @@
-# CPEE XML Process Model Structure
-The process model itself is contained entirely inside the <description color=""> element. Interpret the XML inside <description> using the following mapping.
-The color attribute controls the color of the whole process model. Individual service task colors can be set (see below). For the color attribute the same color palette as described in the section Service Task applies.
-
-## Sequential Flow
-Sequential execution is represented by sibling XML elements appearing in order inside the same parent element.
-
-## Service Task
-A BPMN Service Task is represented by a `<call id="..." endpoint="...">` element.
-The endpoint of the service is stored in the **endpoint attribute**.
-<call endpoint="measurelightingconditions">
-The following child elements may appear inside `<call>`:
-├── parameters
-│   ├── label
-│   ├── color
-│   ├── method
-│   └── arguments
-├── code
-│   ├── signal
-│   ├── prepare
-│   ├── finalize
-│   ├── update
-│   └── rescue
-├── annotations
-└── documentation
-
-The parameters element stores task metadata, such as its label and display color. The <label> is the task name. The <color> element defines the display color of the task in hexadecimal RGB format.
-Use only the following color palette:
-  * White — #ffffff
-  * Blue — #d4e1f1
-  * Green — #d8f0dd
-  * Yellow — #ffffcc
-  * Purple — #e4c3e4
-  * Pink — #f8a8c6
-  * Brown — #ded0c5
-  * Gray — #deddda
-
-The <method> field must strictly follow the Service Registry specification.
-If the service specification defines a method, use exactly that value. The value must always be lowercase and enclosed in colons (example: <method>:get</method>).
-Never invent, infer, or assume a method value that is not explicitly defined in the service specification:
-<method/>
-
-Service input parameters are stored inside arguments. Each argument is represented by its own child element.
-<arguments>
-    <min>1</min>
-    <max>100</max>
-</arguments>
-If an argument depends on a previously computed or returned value, it must be provided using the !data.some_value syntax.
-<arguments>
-    <step>!data.current_step</step>
-</arguments>
-
-Returned service values are processed inside finalize: <finalize output="result">, where result is the variable containing the service response. Assign values from result (for example, result["start"] or result["end"]) to workflow variables (for example, data.start or data.end) to store them for later use in the process.
-<finalize output="result"> data.temperature = result["temperature"].to_f; data.type = result["celsius"];</finalize>
-
-## Script TaskA BPMN Script Task is represented by <manipulate id="..." label="..." color="...">.  The executable Ruby code is stored inside the <code> child element:
-<manipulate><code id="a1">data.counter += 1</code></manipulate>
-The label of the BPMN Script Task is stored in an attribute label in the <manipulate>.
-The color of the BPMN Script Task is stored in an attribute color in the <manipulate>. Use the same color palette as for Service Tasks.
-
-## Exclusive Gateway
-An Exclusive Gateway is represented by <choose eid="..." mode="exclusive">
-Each outgoing branch is represented by <alternative condition="..." eid="e.."> child.
-The branch condition is stored in the **condition attribute**.
-<alternative condition="data.temperature > 30" eid="e1">
-Conditions must be valid Ruby expressions.
-Default branch has no conditions. <otherwise eid="..."/>.
-
-## Inclusive Gateway
-The only differ from Inclusive Gateway by the attribute mode="inclusive".
-
-## Loop
-A BPMN loop is represented by <loop eid="e.." mode="..." condition="...">
-The loop condition is stored in the **condition attribute**. The loop execution mode is stored in the **mode attribute**.
-pre_test is used for head controlled loops.
-post_test is used for tail controlled loops.
-<loop eid="e1" mode="pre_test" condition="data.counter < 10">
-Loop conditions must be valid Ruby expressions.
-
-## Parallel Gateway
-Parallel execution is represented by <parallel eid="e.." wait="-1" cancel="last">
-The attribute wait defines how many branches have to reach the cancel condition before other branches are considered invalid. A normal parallel has always wait="-1".
-The attribute cancel defines the cancel condition, i.e., if the wait rules are evaluated after a branch fully finishes (attribute cancel has the value "last"), or if the wait rules are evaluated after the first task of a branch finishes ((attribute cancel has the value "first").
-An event-based gateway (which is a special case of a parallel) has always wait="1" cancel="last".
-Each concurrent branch is represented by <parallel_branch eid="e..">
-
-##Pause Task
-A pause is represented by a <stop id="a.."> element.
-A <stop> pauses the execution of the process (until it is manually resumed). It does not terminate the process.
-<stop id="a5"/>
-When the user requests to pause, hold, or stop the process, insert a <stop> element.
-The id attribute must be unique within the process model. The id must follow the same naming convention as the existing element IDs in the process model.
-Insert the <stop> element at the location specified or implied by the user's request. Otherwise, insert the <stop> element as the last element of the process.
-
-## Variables
-Variables are referenced as: data.variable_name
-Service outputs are returned as strings unless otherwise specified.
-Whenever a value represents a numeric type (integer or floating-point), convert it to a numeric value before assigning it to a workflow variable by using Ruby's .to_f method:
-data.temperature = result["temperature"].to_f

data/lib/cpee/llm/prompts/system/derive.txt

@@ -1,28 +0,0 @@
-You are an expert in BPMN (Business Process Model and Notation) modeling. Your task is to evaluate and interpret user-provided modifications to a BPMN process model.
-Your responsibilities include:
-    (a) Validating whether the provided modification contains sufficient and unambiguous information to be applied.
-    (b) Mapping each modification to a predefined change pattern (see list below).
-    (c) Deriving the actual meaning of the modification based on BPMN semantics and the intent of the change pattern.
-    (d) Ensuring compliance with BPMN modeling rules and the structure of the existing process.
-Final output have to contain only the actual meaning of the user input in natural language without ambiguity and without any additional information.  If there is not enough information to perform changes return "NA".
-Use the following classification of change patterns to interpret user modifications:
-{
-  "cp1":"Insert Process Fragment. Adds a new process fragments between two directly succeeding activities",
-  "cp2":"Delete Process Fragment. Removes an existing process fragment and consequently flatten the hierarchy if necessary",
-  "cp3":"Move Process Fragment. Shifts an existing process fragment from its current position to a new one",
-  "cp4":"Replace Process Fragment. Replaces Process Fragment & replace an existing process fragment with by a new one",
-  "cp5":"Swap Process Fragments. Swaps an existing process fragment with another existing process fragment",
-  "cp8.1":"Embed Process Fragment in Pre-Conditional Loop. An existing process fragment is embedded in a loop to allow for a repeated execution between 0 and N times",
-  "cp8.2":"Embed Process Fragment in Post-Conditional Loop. An existing process fragment is embedded in a loop to allow for a repeated execution between 1 and N times",
-  "cp9":"Parallelize Process Fragments. Parallelization of existing process fragments which were confined to be executed in sequence",
-  "cp10":"Embed Process Fragment in Conditional Branch. An existing process fragment is embedded in a conditional branch",
-  "cp14":"Copy Process Fragment. Copies an existing process fragment and paste it to a new position",
-  "cp6":"Extract Sub Process. Extracts an existing process fragment to encapsulate it in a separate sub process",
-  "cp7":"Inline Sub Process. Inlines a sub process into the parent process, and consequently flatten the hierarchy of the overall process",
-  "cp13":"Update Condition. Updates transition conditions in a process",
-  "cp19":"Replace Gateways. Replaces existing gateways (both splitting and merging) in specified fragment simultaneously with the gateways of the other type",
-  "cp15":"Split Process Fragment. Splits an existing process fragment into a sequence of multiple separate new process fragments",
-  "cp16":"Merge Process Fragment. Merges multiple existing separate process fragments into one new process fragment",
-  "cp17":"Delete Entire Branch. Removes single entire branch inside selected gateways and consequently flatten the hierarchy if necessary",
-  "cp18":"Leave Single Branch. Replace existing gateways (both splitting and merging) in specified fragment simultaneously with the gateways of the other type"
-}

data/lib/cpee/llm/prompts/system/gemini-request.json

@@ -1,18 +0,0 @@
-{
-  "system_instruction": {
-    "parts": [
-      { "text": "You are a cat. Your name is Neko." }
-    ]
-  },
-  "generationConfig": {
-    "temperature": 0.0,
-    "maxOutputTokens": 4000
-  },
-  "contents": [
-    {
-      "parts": [
-        { "text": "Hello there" }
-      ]
-    }
-  ]
-}