DETAILED ACTION
This action is responsive to the Application filed 8/28/2024.
Accordingly, claims 1-20 are submitted for prosecution on merits.
Claim Rejections - 35 USC § 103
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claims 1-3, 5-12, 14-20 is/are rejected under § 35 U.S.C. 103 as being unpatentable over Chong et al, USPubN: 2002/0184610 (herein Chong) in view of Chen et al, CN 108337122B, (translation), 07-30-2021, 9 pgs (herein Chen) and Yeh et al, USPubN: 2015/0379414 (herein Yeh).
As per claim 1, Chong discloses a computer implemented method of extending workflows, the method comprising:
translating, by a computer system having a processor, a workflow (definition files, schema definition .xsd – para 0126; XSD – para 0296; views determine how the workflow engine will decide – para 0641; workflow diagram – para 0530,0539; para 0497-0506; visual primitives, TPL, XML “node is a tag, tag’s attributes – para 0325; CML files 302 – Fig. 8 – Note1: TPL, XML, CML document, schema specifications or DTD files - para 0175-0176 - having tagged hierarchical elements and markup definition of rules and actions reads on workflow being loaded onto a workflow editor environment or interaction IDE in diagram form, markup form or tagged hierarchy format) into a programming data structure (see markup and tagged hierarchy per Note1; para 0274; XML - 0277-0278; XML format, controller markup language – para 0284), wherein a plurality of nodes of the programming data structure corresponds to a plurality of workflow rules (para 0284-0294; rules of TPL - para 0326; expression to evaluate, if condition fails – para 0585; condition for GetFromCurrency Type - para 0586; structure/rules of CML - para 0296-297; name of rule by which the views in the CML file reference - para 0592-0594) of the workflow;
building, by the computer system, a model structure (project tree 402 - para 0338; Fig. 17, 19) based on the programming data structure(see above), wherein the model structure includes a plurality of nodes (hierarchy of nodes - para 0325; drag sources, drop targets … such as tree node – para 0372),
wherein the plurality of nodes of the model structure corresponds to the plurality of nodes of
the programming data structure (project tree 402 - para 0338; Fig. 17, 19; para 0372; Fig. 35);
receiving, by the computer system, a plurality of extension instructions (para 0021; para 0333; drag variables enter text into those fields - para 0335-0336; extend data source functionality - para 0400; data source adapter - para 0402, Fig. 45-46; layer palette developer may add a state added to that layer - para 0531; developers can extend the class - para 0647; users have the option extending the special classes with their own extensions - para 0398; Adding Data Sources, extension module - para 0343-0345; additional properties that can be set, variable values passed by reference - para 0359; add variable declarations, additional classes - para 0354; adding additional module - para 0342; para 0344-0345; plug-in, additional functionality – para 0150; additional - para 0591; additional states are added - para 0525; can edit the properties of a variable - para 0370; para 0406; add a preconfigured "HangUp" component – para 0543; adds the set of actions for toCurrency and fromAmount – para 0570; adds a "Do" action – para 0578; adds an "If" action into the GetFromCurrencyType – para 0583; dragging the visual icon into the editor window - para 0433; para 0440), wherein the plurality of extension instructions corresponds to changes (see para 0543, 0570, 0578, 0583 from above) to the workflow;
collecting, by the computer system, the plurality of extension instructions, wherein collecting (para 0400; see below; modify and customize the component, the component is merged into the current project - para 0440; user drags components, drops into the workflow diagram, object drop location - para 0263; the three items above are collected in five states - para 0575; para 0337) the plurality of extension instructions includes:
ordering, by the computer system, the plurality of extension instructions according to dependencies (extension allows the developer to reorder or reposition content different subsets into different orientations other types of lists - para 0343; tag attributes were added, ordered list - para 0345; Controller scope: stack allows values to be added first-in, last out order, stack will point to the previous controller's variables, preserving the state of the variables - para 0363; transaction is added, ListAction, preAction, postAction, execution order - para 0528; Fig. 28; developer adds in "If" action into the GetFromCurrencyType action list … order of execution is from first t last process continues through each transaction until one is taken - para 0583-0585; Fig. 101-102; like transitions, the order of the views determines how the workflow engine will decide which view to render - para 0641 ) among the plurality of extension instructions,
wherein the dependencies include a plurality of position groups (extension provided by system 100 … generate different views … allows the developer to … reposition content – para 0343) and
applying (see below), by the computer system, the plurality of extension instructions to the workflow, wherein applying the plurality of extension instructions includes:
generating, by the computer system, an extended workflow (e.g. components may be incorporated by dragging, edit the component contents through a merging mechanism - para 0433; modify and customize the component, the component is merged into the current project - para 0440; special classes exists to help users integrate with data - para 0398; visually creating the flow diagrams developers may integrate the necessary data resources for the application - para 0642; integrate data sources within said application - claim 1, pg. 54; para 0029; integrate data sources within the application - para 0221; the voice view is added to the … list of templates – para 0622 ; para 0596; added a view to the “Get Conversion Info” state – para 0589-0590; data conversion is added to the … “Results” state – para 578; Once in the visual layer … developer may add a state … for a state to be added to that layer – para 0531).
Chong does not explicitly disclose extension instructions for ordering dependencies by position groups in terms of
wherein the plurality of position groups includes one or more of a pinned position group, an un-pinned position group, and a to-be-decided position group.
Mode of configuration for users mode option so as to interact with the application at runtime in Chong includes real-time identification of action associate with a workflow editor and drop a relevant object in connection with action list into one or more positions on the editor display (Fig. 31) where views are subjected to repositioning based on content (para 0343)
In graphical configuration, when a node, a group, cluster or view module on a model representation is strongly attached to another node to form a definite interconnectivity, the association or relationship between these graphical elements is viewed as firm, definite, solid or strong; whereas when this connectivity or linkage is not firm, definite, the association or relationships between these graphical entities is viewed as weak, indefinite or loose.
Rearranging graph elements into graph positioned group so that as grouped, the rearranging exhibits strong interconnectivity or definite path joining its constituent elements and this can be shown in Chen distributed flow configuration by a maintenance IT; that is, a graph format is provided to represent static topological and dynamic connection relationships of a distributed maintenance processing (pg. 2-3) and discrete data streaming, such as for heterogeneous time sequence fusion operation whose model is constructed upon topology of graph nodes, their connection relationships assessed per time slice, the construction added with capability for further discovering of the fusion model via expansion to the graph in terms of strong connection and week connection group (bottom pg. 3 to top pg. 4) aligned with throughput consideration, or innovation via node connection fusion. Hence, reorganizing a static topology of graph nodes added with possible extension/arrangement that includes strongly and weakly connected component group entail grouping whose interconnectivity is strong, definite, firm pr pinned down; as opposed to grouping whose interconnectivity is loose, indefinite, weak or un-pinned.
Yeh also discloses large-scale knowledge graph to support inference paths learning to generate confidence score and draw strategies/conclusions related to understanding various sources of document/language and explanation based on the understanding (see Abstract) for consolidating a knowledge scaling framework (para 0024-0027; Fig. 3 and related text), the framework to study the inference paths as those having strong association of edges to form a contingency table, to which paths having spurious nor weak associations are separated (para 0043), the filtering based thereon for consolidating activation score of each group being processed in association with group inference path studying (para 0076-0080; Fig. 6); hence, studying a knowledge graph on basis of confidence to determine most effective inference path in light of strong association group versus weak association group to reinforce reliability of or confidence in this inferencing capability/model toward entails separating graph group with strong association paths and group with weak association paths similar to distinguishing pinned down, strong connectivity groups from unpinned, weak connectivity groups of a graph-based knowledge scaling framework.
Therefore, based on possibility to regroup or reposition graph entities based on some association or functional dependency such as real-time identification of actions via action list provided with a workflow editor so to interactively drop a relevant object into one or more positions on the editor display (Fig. 31) such as enabling displayed views to be subjected to repositioning based on content (para 0343), it would have been obvious for one of ordinary skill in the art before the effective filing date of the invention to implement Chong’s manipulation of workflow elements in the editor UI so that upon collection of extension instructions, extension such to ordering dependencies by position groups would include position grouping so to form one or more of a (a) pinned position group, (b) an un-pinned position group, and (c) a to-be-decided position group, where pinned group represent group whose internal elements are strongly connected – as in Chen - or whose path dependency is strong – as in Yeh; and where unpinned group represent group whose internal elements are weakly connected – as in Chen - or whose path dependency is weak – as in Yeh; because
separating strongly connected paths into a repositioned group in association with functional dependency and relationships of elements of the group from weakly connected grouping would enable prioritization of “pinned” group tasks based on their confidence level – as set forth in Yeh - or contributive weight of their strong connection relationship, the prioritization thereof at the expense of groups whose internal elements reflect a rather weak or indefinite operational connectivity which can be deferred to lower demand or extra-solution contexts, and re-arranging a graph-based topology into distinct nodes group on basis of strong and week connectivity thereof – as set forth above - would help the development of workflow functions to be geared toward allocating or prioritizing large portion of the workflow tasks to groups considered best in yielding higher throughput on basis of their strong interconnectivity, and delegate less critical, significant tasks to groups considered having weaker connectivity or internal dependency, thereby mitigate inter-operation latency between successive task invocations by a group, propagating this improved throughput across the topological construct of the workflow, enhancing thereby the overall productivity of the workflow model at runtime, on basis of distinction of groups in relevance to their internal path dependency and inter-connectivity .
As per claim 2, Chong discloses method of claim 1, wherein
a given workflow rule of the plurality of workflow rules includes one or more criteria (condition - para 0585-0586; conditional - para 0583) and one or more actions (list of actions - para 0159; para 0163; conditional action - para 0585; Custom Action - para 0583; para 0528) and one or more actions (transition tool, user clicks, - para 0526-0527; added a property called "action" - para 0528; para 0529-0533; adds the set of actions for toCurrency and fromAmount - para 0570-0574 ;a "Do" action - para 0578; an "If" action - para 0583; adds an action - para 0281).
As per claim 3, Chong discloses method of claim 1, wherein collecting the plurality of extension instructions includes:
reading, by the computer system, a plurality of flow contributions (model variable, objects tree - para 0547-0553; Fig. 98), wherein the plurality of flow contributions corresponds to the plurality of extension instructions (For each model variable that was created ModelVarDef element added, comment attribute is used to store information about the variable - para 0561; user input to model variables - para 0551; variables of the types provided, type (the class) - para 0552);
grouping, by the computer system, the plurality of flow contributions, wherein a given flow contribution of the plurality of flow contributions includes a flow group (objects tree 404, variables
of the types provided, type (the class) - para 0552; dropdown, collection objects - para 0405; character chosen, drop-down list - para 0412) and a position group (reposition content – para 0343; drop-down list getRowbyIndex, getColumnbyIndex, getRow, getcolumn - para 0405; para 0409; classpath locations of where to find classes - para 0485 – Note2: repositioning by users input to customize, add objects, relocate views made to workflow diagrams in terms of interacting with objects tree and model variables represented a class grouping/tree or GUI up/down list - Fig. 36; up or down a list - para0308; drop-down list – para 0315; drop-down list - para 0409 - or selectable classPath items that correspond to a particular VAR type or class - see classPath - para 0104; class tree - para 0395 - or record's row/column index – see para 0409, 0412 - for user select - Fig. 31 - or right click reads on diagram flow contributions in terms of (a) ordered group, drop-down list and (b) classpath locations, indexed position which can be interacted, selected via right click and fetched via a getIndex call/method; (c) repositioned views); and
ordering, by the computer system, the plurality of flow contributions first according to each of a plurality of flow groups (see objects tree 404 - para 0552; drop-down list, token separators -para 0405), and second according to each of the plurality of position groups (refer to Note2 from above) of a given flow group.
As per claim 5, Chong discloses method of claim 1, wherein the pinned position group corresponds to a group with a path that is found in the model structure, wherein the un-pinned position group corresponds to a group with a path that is undefined
( All of which having been addressed in rationale A of claim 1)
Chong does not explicitly disclose wherein the to-be-decided position group corresponds to group with a path that is not found in the model structure.
Since a pinned group is viewed a group whose constituents are interconnected with strong path connectivity and unpinned group is viewed as one containing loose, weak or indefinite internal path connectivity, a group that is neither a pinned group or a unpinned group can be viewed as a group whose path construction is undefined (not strong, not weak) and whose categorization is yet to be determined; e.g. a to-be-determined type.
Therefore, based on distinction of group per rationale A, it would have been obvious for one of ordinary skill in the art before the effective filing date of the invention to obvious in organizing workflow model in groups such as position group or flow group in Chong framework so that a group that falls neither into the category of a pinned group or category of a unpinned group would be characterized as an undetermined category or a “to-be-decided” group; because
resources preserved via a graph investigating process so to consider proper allocation of memory for payload, workflow tasks requiring a given level of expediency and frequency amount should be given prioritization, according to which, a group which is pinned down as one whose internal constituents are strongly interconnected should be first in receiving this prioritized allocation in order to achieve tasks better throughput; and a group considered as one having weak internal path connectivity (e.g. unpinned group) would have to be delegated at best to workflow tasks that do not require performance boost, low latency and high productivity, whereas group deemed a “to-be-defined” category can be marked down as ineligible for receiving any workflow resources, notably those that are considered clearly more useful if allocated to the other two groups, the prioritizing of resources and distribution of tasks based on the above grouping making good use of available memory and improving the overall throughput of the workflow in a real-world deployment environment.
As per claim 6, Chong does not explicitly disclose method of claim 1, further comprising, when the un-pinned position group is not empty:
translating, by the computer system, the extended workflow into an extended programming data structure; and
building, by the computer system, an extended model structure based on the extended programming data structure.
Chong discloses receiving extension instructions (adding additional module - para 0342; para 0344-0345; plug-in, additional functionality – para 0150; additional - para 0591; additional states are added - para 0525) in association with configuring a workflow model (drop-down list getRowbyIndex, getColumnbyIndex, getRow, getcolumn - para 0405; para 0409), translating the extended workflow portion into an extended programming structure (XHTML template – para 0346, 0372; markup and tagged hierarchy see Note1; para 0274; XML - 0277-0278; XML format, controller markup language – para 0284) with which to construct a corresponding change, addition or extension (refer to generate an extended workflow in claim 1) to a current workflow model; hence forming a grouping or a view when populating, editing information (Fig. 41, 43) associated with configuring nodes and tasks via template of XHTML editor – Fig. 23 - entails that generating extended group from nodes of a workflow representation using extended programming source is initiated from recognizing that an un-pinned but partially filled group (e.g. default template – para 0522) exists in the XHTML template editor context – referred herein as (**)
Therefore, it would have been obvious for one of ordinary skill in the art before the effective filing date of the invention to implement activity leading to generating a extended workflow in terms of: upon determining that the un-pinned default, not-empty position group – as per (**),
translating, by the computer system, the extended workflow into an extended programming data structure; and building, by the computer system, an extended model structure based on the extended programming data structure, as set forth above; because
building workflow with incremental extension provided from unpinned empty group via navigating templates of a XHTML editor as set forth above, would not only benefit from the browser technology with provision of UI elements, data sources and tagged field as part of the editor as well as the user-friendly icons, widgets, pop-up and drop/drag capability of this particular Web-based methodology, but also from the underlying grammar and schema/markup conformance check attached with this HTM-based or DOM-based technology.
As per claim 7, Chong discloses method of claim 1, wherein the programming data structure is a translation of a workflow defined textually into a data structure that has a corresponding visual format (XHTML template – para 0346, 0372; XML - 0277-0278 – Note3: browser template when expressed on a browser reads on textual workflow structure having with it some visual format described in HTM, markup, stylesheet or DOM notation).
As per claim 8, Chong discloses method of claim 1, wherein the model structure defines a logical structure of a data file (XML, CML … logical progression of the application – para 0284; control markup language – para 0522) and a way the data file is accessed and manipulated (see Fig. 77-79; para 0523-0524).
As per claim 9, Chong discloses method of claim 1, wherein a given extension instruction of the plurality of extension instructions includes a position (allows the developer to reorder or reposition content into different orientations - para 0343; drops any desired primitives into the respective layout table - para 0333; drops the view into the view list area - para 0588; drops the component under the object drop location - para 0263), an action (transition tool, user clicks, - para 0526-0527; added a property called "action" - para 0528; para 0529-0533; adds the set of actions for toCurrency and fromAmount - para 0570-0574 ;a "Do" action - para 0578; an "If" action - para 0583; adds an action - para 0281) and an object (preconfigured "Hangup" component - para 0543; a resource to a template 1504 - Fig. 60; adds objects to a controller's workflow – para 0263; dragging components into editor portions - para 0262; adds a common object to the workflow diagram - para 0428; post a variable object tree - para 0552).
As per claim 10, Chong discloses a computer system for extending workflows, the computer system comprising: memory; and a processor, wherein the processor is configured to control the computer system to
translate a workflow into a programming data structure, wherein a plurality of nodes of the programming data structure corresponds to a plurality of workflow rules of the workflow;
wherein the processor is configured to control the computer system to
build a model structure based on the programming data structure, wherein the model structure includes a plurality of nodes, wherein the plurality of nodes of the model structure corresponds to the plurality of nodes of the programming data structure;
wherein the processor is configured to control the computer system to
receive a plurality of extension instructions, wherein the plurality of extension instructions corresponds to changes to the workflow;
wherein the processor is configured to control the computer system to
collect the plurality of extension instructions, wherein collecting the plurality of extension instructions includes:
ordering, by the computer system, the plurality of extension instructions according to dependencies among the plurality of extension instructions, wherein the dependencies include a plurality of position groups, wherein the plurality of position groups includes one or more of a pinned position group, an un-pinned position group, and a to-be-decided position group; and
wherein the processor is configured to control the computer system to
apply the plurality of extension instructions to the workflow, wherein applying the plurality of extension instructions includes generating, by the computer system, an extended workflow.
( All of which having been addressed in claim 1)
As per claims 11-12, refer to rejection of claims 2 and 3, respectively.
As per claims 14-15, refer to rejection of claims 5 and 6, respectively.
As per claims 16-18, refer to rejection of claims 7, 8, 9 respectively.
As per claim 19, Chong discloses a non-transitory computer-readable medium for storing instructions that, when executed by a processor of a computer system, control the computer system to perform a method of extending workflows, the method comprising:
translating, by the computer system, a workflow into a programming data structure, wherein a plurality of nodes of the programming data structure corresponds to a plurality of workflow rules of the workflow;
building, by the computer system, a model structure based on the programming data structure, wherein the model structure includes a plurality of nodes,
wherein the plurality of nodes of the model structure corresponds to the plurality of nodes of the programming data structure;
receiving, by the computer system, a plurality of extension instructions,
wherein the plurality of extension instructions corresponds to changes to the workflow;
collecting, by the computer system, the plurality of extension instructions, wherein collecting the plurality of extension instructions includes:
ordering, by the computer system, the plurality of extension instructions according to dependencies among the plurality of extension instructions,
wherein the dependencies include a plurality of position groups, wherein the plurality of position groups includes one or more of a pinned position group, an un-pinned position group, and a to-be-decided position group; and
applying, by the computer system, the plurality of extension instructions to the workflow, wherein applying the plurality of extension instructions includes: generating, by the computer system, an extended workflow.
( All of which having been addressed in claim 1)
As per claim 20, refer to rejection of claim 3 from above.
Claims 4, 13 is/are rejected under § 35 U.S.C. 103 as being unpatentable over Chong et al,
USPubN: 2002/0184610 (herein Chong) in view of Chen et al, CN 108337122B(translation), 07-30-2021, 9 pgs (herein Chen) and Yeh et al, USPubN: 2015/0379414 (herein Yeh), further in view of
Henry et al, USPubN: 2004/0046787 (herein Henry) and Cong et al, CN 111158663, (translation) 07-02-2021, 43 pgs (herein Cong)
As per claim 4, Chong discloses method of claim 3, wherein ordering a given position group of the plurality of position groups includes:
first, selecting a first subset of the plurality of position groups (refer to claim 6; up/down list
- Fig. 36; up or down a list - para0308; drop-down list - para 0315; drop-down list - para 0409);
second, selecting a second subset of the plurality of position groups (refer to claim 6), wherein each of the second subset has a path that is present in the given flow group (classpath – para 0485; Fig. 73; deterministic automaton, states, transitions user interaction paths allowed by an application - para 0132; path an end user takes is generally determined by inputs at specified points - para 0218)
Chong does not explicitly disclose
(i) first, selecting a first subset of the plurality of position groups; wherein each of the first subset has a path that is undefined
(ii) third, selecting a third subset of the plurality of position groups, wherein each of the third subset is neither in the first subset nor in the second subset.
As for (i) and selecting a position group due to a path being undefined,
a graphical program development is shown in Cong for processing reference of an variable as first variable symbol identified from a external stream, where reference for storing the variable is based on a previously symbol identified with the program path to determine if a reference exists (e.g. a match within an existing variable symbol table - claims 9-11, pg. 38), where in case it is determined that the first variable symbol relates to an undefined reference (undefined reference table - pg. 4), providing visual assistance (middle pg. 3) to the user to process the undefined reference and remedy to issues of undeclared, undefined or uninitialized variables (top pg. 18); such as adding settings to provide name space as a remedy to (top pg 12) the undefined variable caused by a undefined reference or prior memory allocation.
In other words, lack of a defined path reference caused by a missing reference that would otherwise support compile time of declaring/defining/resolving variable (whose position in the code is assignable to a pre-defined memory location) - being addressed with a graphical interface feature enabling a first subset of variable grouping (namespace - pg. 11-12) to be obtained according to relationship of the variable with other components - so to select a name space (variable symbol grouping) provided according to a path of the variable being appointed to the user, due a undefined memory location for initially assigning a variable -- is recognized.
As for (ii),
Consideration of a settings due to undefined variable path or variables constrained with definite path can encounter case where path is neither predefined or unknown. For instance, configuration of a action for predefining attributes of a transition via a value binding according to which, a lack of information such as a undefined source in setting a variable for action in Chong
(para 0564) make it hard to ascertain whether to attribute the Action as pass or fail, and use a “default Value” due to the undefined state of the source (para 0567) can be an option to ignore pass or fail state of the action and this entails that declaration of an action expressed with attributes group and a defined path can neither be definite as pass/fail nor undefined since use of a “default Value” can be an alternative that ignores pass/fail. Hence, consideration of a subset as part of selecting variables position group via interactive settings in the sense that the user settings is based on neither a definite path or an undefined path is recognized (herein referred as (*))
User interface to configuring a workflow is shown a rule recognition and organizing screens in Henry by a workflow manager (para 0294-0296) to initialize screen groups and actions assigned thereto (para 0293), where upon identification that an path object has a destination being initialized as "unknown", the object path is added to a recording screen to help finalize (para 0298) the recording method; and this object path initialization setting entails that the object recording is not finalized on basis of a undefined path, nor is it based on destination path clearly specified.
Therefore, it would have been obvious before the effective filing date of the invention for one of ordinary skill in the art to implement interactive settings, presentation of flow components
as group in Chong for position based interactive election so that selecting a subset from the position
group can be based on a subset (second subset) as having a defined path, but also can include
1) selecting a first subset of the plurality of position groups, wherein each of the first subset
has a path that is undefined - as per Cong from above
2) selecting a third subset of the plurality of position groups, wherein each of the third
subset is neither in the first subset nor in the second subset, as per (*) and from the object path
initializing in Henry's configuration of group actions, from above; because
provision of selective objects and attributes thereof in form of GUI based drop-down, of list
grouping presented for selection by way of a hierarchized index, its relative positioning in a given
order of the drop-down, top-down listing would enable a level of significance to be imparted,
conferred to the object from the position with which the object is being conveyed or listed for
selective use, which entails importance of source serving as a runtime reference for the object
definition grouped with its attribute - like a name space - being a pre-compiled and retrievable
setting in a memory location defined by a path; and
a design runtime as an implementation of the retrieval and rendering of a group or object listing necessarily relies on static or dynamic state with which allocation of an object as part of flow
contributions or its grouping is made available in a backend on basis of a given path, which in turn
can be precompiled as defined or undefined; such that internal I/O processing by a workflow
configuration layer to present a GUI listing can either operate on compilation settings of an object in
allocated memory such as those indicative of a defined path or else, process by way of using (a) a
default or (b) dynamic provisional setting - as in Henry - in case where (a) the path for the allocated
object group is clearly marked as undefined or (b) in case where path information of the object group is neither marked as defined or undefined, the runtime adaptation (using default or provisional settings) as responsive actions carried out within the workflow design payload to dynamically circumvent advents of indefinite path as set forth above, being a preventive manner for averting Null-indirection in memory operations or ill-referencing as undesirable SW behavior conducive to system crash.
As per claim 13, Chong discloses computer system of claim 12, wherein ordering a given position group of the plurality of position groups includes:
first, selecting a first subset of the plurality of position groups, wherein each of
the first subset has a path that is undefined;
second, selecting a second subset of the plurality of position groups, wherein
each of the second subset has a path that is present in the given flow group; and
third, selecting a third subset of the plurality of position groups, wherein each
of the third subset is neither in the first subset nor in the second subset.
( All of which having been addressed in claim 4)
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the "right to exclude" granted by a patent and to prevent possible harassment by multiple assignees. See In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970);and, In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) may be used to overcome an actual or provisional rejection based on a nonstatutory double patenting ground provided the conflicting application or patent is shown to be commonly owned with this application. See 37 CFR 1.130(b).
Effective January 1, 1994, a registered attorney or agent of record may sign a terminal disclaimer. A terminal disclaimer signed by the assignee must fully comply with 37 CFR 3.73(b).
Claims 1, 10, 19 are provisionally rejected under the judicially created doctrine of obviousness-type double patenting as being unpatentable over claims 1, 8, 14 of U.S. Patent No. 12,099,973 (hereinafter ‘973).
Although the conflicting claims are not identical, they are not patentably distinct from each other because of the following observations. Following are but a few examples as to how certain claims from the instant invention and from the above patent are conflicting with each other.
Instant claim 1 ‘973 claim 1
Method of extending workflow comprising:
translating, by the computer system, a workflow into a programming data structure, wherein a plurality of nodes
of the programming data structure corresponds to a
plurality of workflow rules;
building, by the computer system, a model structure based
on the programming data structure, wherein the model structure includes a plurality of nodes,
wherein the plurality of nodes of the model structure corresponds to the plurality of nodes of the programming
data structure;
Method of extending workflow comprising:
translating, the workflow into a programming data structure, wherein the programming data structure, wherein a plurality
of nodes of the programming data structure corresponds to the plurality of workflow rules;
building, by the computer system, a model structure based
on the programming data structure, wherein the model
structure includes a plurality of nodes, wherein the plurality
of nodes of the model structure corresponds to the plurality
of nodes of the programming data structure;
receiving, by the computer system, a plurality of extension instructions, wherein the plurality of extension instructions corresponds to changes to the workflow;
collecting, by the computer system, the plurality of extension instructions, wherein collecting the plurality of extension instructions includes:
receiving, by the computer system, a plurality of extension instructions, wherein the plurality of extension instructions corresponds to changes to the workflow;
collecting, the plurality of extension instructions, wherein collecting the plurality of extension instructions includes:
ordering, by the computer system, the plurality of extension instructions according to dependencies among the plurality of extension instructions,
wherein the dependencies include a plurality of position groups, wherein the plurality of position groups
ordering the plurality of extension instructions according to dependencies among the plurality of extension instructions, wherein collecting the plurality of extension instructions
includes grouping the plurality of flow contributions,
wherein a given flow contribution includes a plurality of
position groups
the position group including one or more of a pinned
position group, an un-pinned position group, and a
to-be-decided position group
wherein the plurality of position groups includes one or
more of a pinned position group, an un-pinned position
group, and a to-be-decided position group
applying, by the computer system, the plurality of extension instructions to the workflow, wherein applying the plurality of extension instructions includes generating, by the computer system, an extended workflow.
applying, by the computer system, the plurality of extension instructions to the workflow, wherein applying the plurality of extension instructions includes generating, by the computer system, an extended workflow
Therefore, instant claim 1 is deemed obvious over ‘973 claim 1.
Instant claim 10 (system) recites the exact limitations of instant claim 1; whereas ‘973 claim 14 (system) recites the exact limitations of ‘973 claim 1; hence instant claim 10 is deemed obvious variant of ‘973 claim 14.
Instant claim 19 (medium) recites the exact limitations of instant claim 1; whereas ‘973 claim 8 (system) recites the exact limitations of ‘973 claim 1; hence instant claim 19 is deemed obvious variant of ‘973 claim 8.
Dependent claims 2-9, 11-18, 20 are deemed non-eligible for being dependent upon a rejected base claim.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Tuan A Vu whose telephone number is (571) 272-3735. The examiner can normally be reached on 8AM-4:30PM/Mon-Fri.
If attempts to reach the examiner by telephone are unsuccessful, the examiner's supervisor, Chat Do can be reached on (571)272-3721.
The fax phone number for the organization where this application or proceeding is assigned is (571) 273-3735 ( for non-official correspondence - please consult Examiner before using) or 571-273-8300 ( for official correspondence) or redirected to customer service at 571-272-3609.
Any inquiry of a general nature or relating to the status of this application should be directed to the TC 2100 Group receptionist: 571-272-2100.
/Tuan A Vu/
Primary Examiner, Art Unit 2193
August 06, 2026
Prosecution Insights