IP Library Granted Patent US 12,282,385
Granted Patent B2
US 12,282,385 · App. 18/607,790 · Granted Apr 22, 2025

Root cause analysis based on process optimization data

Inventors: Fabio Casati (Santa Clara, CA); Hans Jochen Gerhard Pohle (Amsterdam, NL); Sai Harini Chettla (Hyderabad, IN); Manjeet Singh (Santa Clara, CA); Siddhant Sinha (Hyderabad, IN)
Assignee: Service Now, Inc.
G06F11/079G06F11/3476G06F18/214G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,282,385
App. No.
18/607,790
Granted
Apr 22, 2025
Kind
B2
Abstract

A system for root cause analysis based on process optimization data is provided. The system receives log data associated with a first trace between a first activity and a second activity of a process. The system further determines a state of inefficiency between the first activity and the second activity based on the received log data. The system further applies a first machine learning (ML) model on the received log data. The system further determines a first label and a first value to be associated with the first trace of the process based on the application of the first ML model. The system further generates presentation data associated with the determined state of inefficiency of the first trace based on the determination of the first label and the first value and further transmits the generated presentation data on a user device.

Claims (36)

1. A method comprising:

capturing log data indicating a sequence of operations executed between a first activity of a process and a second activity of the process;

detecting an inefficiency between a first user input associated with the first activity and a second user input associated with the second activity, based on a plurality of criteria and the log data, wherein the inefficiency corresponds to an additional time period between first user input associated with the first activity and the second user input associated with the second activity;

in response to detecting the inefficiency, generating, using a machine learning (ML) model and the log data, an output to be associated with the sequence of operations;

determining, using the output, a root cause of the inefficiency between the first activity and the second activity; and

generating presentation data indicating the root cause.

2. The method of claim 1 , wherein the plurality of criteria reflect a process loop state for the process, wherein the process loop state corresponds to the inefficiency between the first activity and the second activity.

3. The method of claim 2 , wherein the process loop state reflects a time period indicative of the inefficiency between the first activity and the second activity.

4. The method of claim 2 , wherein the process loop state is determined based on a loop count.

5. The method of claim 1 , wherein the sequence of operations is between the first activity and the second activity.

6. The method of claim 1 , wherein the plurality of criteria reflect a process loop state for the process, wherein the process loop state indicates that the process returns to the first activity.

7. The method of claim 6 , wherein the process loop state indicates the inefficiency between the first activity and the second activity of the process.

8. The method of claim 1 , wherein the plurality of criteria reflect a process loop state for the process, wherein the process loop state indicates that the process returns to the first activity after the second activity.

9. The method of claim 8 , wherein the process loop state indicates the inefficiency between the first activity and the second activity of the process.

10. A non-transitory computer-readable storage medium configured to store instructions that, in response to being executed by one or more processors, causes a system to:

capture log data indicating a sequence of operations executed between a first activity of a process and a second activity of the process;

detect an inefficiency between a first user input associated with the first activity and a second user input associated with the second activity, based on a plurality of criteria and the log data, wherein the inefficiency corresponds to an additional time period between first user input associated with the first activity and the second user input associated with the second activity;

in response to detecting the inefficiency, generate, using a machine learning (ML) model and the log data, an output to be associated with the sequence of operations;

determine, using the output, a root cause of the inefficiency between the first activity and the second activity; and

generate presentation data indicating the root cause.

11. The non-transitory computer-readable storage medium of claim 10 , wherein the plurality of criteria reflect a process loop state for the process, wherein the process loop state corresponds to the inefficiency between the first activity and the second activity.

12. The non-transitory computer-readable storage medium of claim 11 , wherein the process loop state reflects a time period indicative of the inefficiency between the first activity and the second activity.

13. The non-transitory computer-readable storage medium of claim 11 , wherein the process loop state is determined based on a loop count.

14. The non-transitory computer-readable storage medium of claim 10 , wherein the sequence of operations is between the first activity and the second activity.

15. The non-transitory computer-readable storage medium of claim 10 , wherein the plurality of criteria reflect a process loop state for the process, wherein the process loop state indicates that the process returns to the first activity.

16. The non-transitory computer-readable storage medium of claim 15 , wherein the process loop state indicates the inefficiency between the first activity and the second activity of the process.

17. The non-transitory computer-readable storage medium of claim 10 , wherein the plurality of criteria reflect a process loop state for the process, wherein the process loop state indicates that the process returns to the first activity after the second activity.

18. The non-transitory computer-readable storage medium of claim 17 , wherein the process loop state indicates the inefficiency between the first activity and the second activity of the process.

19. A system, comprising:

a processor configured to:

capture log data indicating a sequence of operations executed between a first activity of a process and a second activity of the process;

detect an inefficiency between a first user input associated with the first activity and a second user input associated with the second activity, based on a plurality of criteria and the log data, wherein the inefficiency corresponds to an additional time period between first user input associated with the first activity and the second user input associated with the second activity;

in response to detecting the inefficiency, generate, using a machine learning (ML) model and the log data, an output to be associated with the sequence of operations;

determine, using the output, a root cause of the inefficiency between the first activity and the second activity; and

generate presentation data indicating the root cause.

20. The system of claim 19 , wherein the plurality of criteria reflect a process loop state for the process, wherein the process loop state corresponds to the inefficiency between the first activity and the second activity.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 18, 2024
From: CASATI, FABIO; POHLE, HANS JOCHEN GERHARD; CHETTLA, SAI HARINI; SINGH, MANJEET; SINHA, SIDDHANT
To: SERVICENOW, INC.
Reel/Frame 066813/0498 →
Continuity (2)
Continuation 17521474 · Nov 8, 2021
Related Publication 20240220352A1 · Jul 4, 2024
References Cited (188)
US 4941084A · Terada et al. · 1990 [cited by applicant]
US 5185860A · Wu · 1993 [cited by applicant]
US 5237518A · Sztipanovits et al. · 1993 [cited by applicant]
US 5261097A · Saxon · 1993 [cited by applicant]
US 5265252A · Rawson, III et al. · 1993 [cited by applicant]
US 5367685A · Gosling · 1994 [cited by applicant]
US 5390297A · Barber et al. · 1995 [cited by applicant]
US 5442791A · Wrabetz et al. · 1995 [cited by applicant]
US 5452415A · Hotka · 1995 [cited by applicant]
US 5522042A · Fee et al. · 1996 [cited by applicant]
US 5533116A · Vesterinen · 1996 [cited by applicant]
US 5655081A · Bonnell et al. · 1997 [cited by applicant]
US 5659736A · Hasegawa et al. · 1997 [cited by applicant]
US 5671412A · Christiano · 1997 [cited by applicant]
US 5696701A · Burgess et al. · 1997 [cited by applicant]
US 5715463A · Merkin · 1998 [cited by applicant]
US 5745879A · Wyman · 1998 [cited by applicant]
US 5761502A · Jacobs · 1998 [cited by applicant]
US 5764913A · Jancke et al. · 1998 [cited by applicant]
US 5887139A · Madison, Jr. et al. · 1999 [cited by applicant]
US 5909217A · Bereiter · 1999 [cited by applicant]
US 5937165A · Schwaller, II et al. · 1999 [cited by applicant]
US 5949976A · Chappelle · 1999 [cited by applicant]
US 5978594A · Bonnell et al. · 1999 [cited by applicant]
US 6021437A · Chen et al. · 2000 [cited by applicant]
US 6041347A · Harsham et al. · 2000 [cited by applicant]
US 6088717A · Reed et al. · 2000 [cited by applicant]
US 6101500A · Lau · 2000 [cited by applicant]
US 6128016A · Coelho et al. · 2000 [cited by applicant]
US 6131118A · Stupek, Jr. et al. · 2000 [cited by applicant]
US 6134581A · Ismael et al. · 2000 [cited by applicant]
US 6138122A · Smith et al. · 2000 [cited by applicant]
US 6148335A · Haggard et al. · 2000 [cited by applicant]
US 6166732A · Mitchell et al. · 2000 [cited by applicant]
US 6167448A · Hemphill et al. · 2000 [cited by applicant]
US 6175866B1 · Holloway et al. · 2001 [cited by applicant]
US 6175878B1 · Seaman et al. · 2001 [cited by applicant]
US 6260050B1 · Yost et al. · 2001 [cited by applicant]
US 6263457B1 · Anderson et al. · 2001 [cited by applicant]
US 6272150B1 · Hrastar et al. · 2001 [cited by applicant]
US 6336138B1 · Caswell et al. · 2002 [cited by applicant]
US 6363421B2 · Barker et al. · 2002 [cited by applicant]
US 6393386B1 · Zager et al. · 2002 [cited by applicant]
US 6397245B1 · Johnson, II et al. · 2002 [cited by applicant]
US 6434626B1 · Prakash et al. · 2002 [cited by applicant]
US 6438592B1 · Killian · 2002 [cited by applicant]
US 6456306B1 · Chin et al. · 2002 [cited by applicant]
US 6466932B1 · Dennis et al. · 2002 [cited by applicant]
US 6487590B1 · Foley et al. · 2002 [cited by applicant]
US 6505248B1 · Casper et al. · 2003 [cited by applicant]
US 6526442B1 · Stupek, Jr. et al. · 2003 [cited by applicant]
US 6621823B1 · Mellquist et al. · 2003 [cited by applicant]
US 6707795B1 · Noorhosseini et al. · 2004 [cited by applicant]
US 6742015B1 · Bowman-Amuah · 2004 [cited by applicant]
US 6763380B1 · Mayton et al. · 2004 [cited by applicant]
US 6816898B1 · Scarpelli et al. · 2004 [cited by applicant]
US 6895586B1 · Brasher et al. · 2005 [cited by applicant]
US 6948175B1 · Fong et al. · 2005 [cited by applicant]
US 6985901B1 · Sachse et al. · 2006 [cited by applicant]
US 7003564B2 · Greuel et al. · 2006 [cited by applicant]
US 7028228B1 · Lovy et al. · 2006 [cited by applicant]
US 7043537B1 · Pratt · 2006 [cited by applicant]
US 7043661B2 · Valadarsky et al. · 2006 [cited by applicant]
US 7062683B2 · Warpenburg et al. · 2006 [cited by applicant]
US 7096459B2 · Keller et al. · 2006 [cited by applicant]
US 7146574B2 · Goldthwaite et al. · 2006 [cited by applicant]
US 7197466B1 · Peterson et al. · 2007 [cited by applicant]
US 7215360B2 · Gupta · 2007 [cited by applicant]
US 7216304B1 · Gourdol et al. · 2007 [cited by applicant]
US 7222147B1 · Black et al. · 2007 [cited by applicant]
US 7281170B2 · Taylor et al. · 2007 [cited by applicant]
US 7328260B1 · Muthiyan et al. · 2008 [cited by applicant]
US 7412502B2 · Fearn et al. · 2008 [cited by applicant]
US 7505872B2 · Keller et al. · 2009 [cited by applicant]
US 7593013B2 · Agutter et al. · 2009 [cited by applicant]
US 7596716B2 · Frost et al. · 2009 [cited by applicant]
US 7617073B2 · Trinon et al. · 2009 [cited by applicant]
US 7660731B2 · Chaddha et al. · 2010 [cited by applicant]
US 7676294B2 · Baier et al. · 2010 [cited by applicant]
US 7676437B2 · Satkunanathan et al. · 2010 [cited by applicant]
US 7840490B1 · Sellers et al. · 2010 [cited by applicant]
US 7877783B1 · Cline et al. · 2011 [cited by applicant]
US 7890869B1 · Mayer et al. · 2011 [cited by applicant]
US 7966398B2 · Wiles, Jr. · 2011 [cited by applicant]
US 8060396B1 · Bessler et al. · 2011 [cited by applicant]
US 8196210B2 · Sterin · 2012 [cited by applicant]
US 8321948B2 · Robinson et al. · 2012 [cited by applicant]
US 8407669B2 · Yee et al. · 2013 [cited by applicant]
US 8554750B2 · Rangarajan et al. · 2013 [cited by applicant]
US 8595647B2 · Sabin et al. · 2013 [cited by applicant]
US 8620818B2 · Hughes et al. · 2013 [cited by applicant]
US 8646093B2 · Myers et al. · 2014 [cited by applicant]
US 8674992B2 · Poston et al. · 2014 [cited by applicant]
US 8725647B2 · Disciascio et al. · 2014 [cited by applicant]
US 9053460B2 · Gilbert et al. · 2015 [cited by applicant]
US 9069737B1 · Kimotho et al. · 2015 [cited by applicant]
US 9971826B1 · Belmar · 2018 [cited by applicant]
US 10673963B1 · Feiguine et al. · 2020 [cited by applicant]
US 10749943B1 · Feiguine et al. · 2020 [cited by applicant]
US 10771344B2 · Bitterfeld et al. · 2020 [cited by applicant]
US 10824650B2 · Bar Oz et al. · 2020 [cited by applicant]
US 10944654B2 · Rimar et al. · 2021 [cited by applicant]
US 10999152B1 · Bar Oz et al. · 2021 [cited by applicant]
US 11025481B1 · Louca et al. · 2021 [cited by applicant]
US 11089115B2 · Garty et al. · 2021 [cited by applicant]
US 11095506B1 · Erblat et al. · 2021 [cited by applicant]
US 11176464B1 · Sagi · 2021 [cited by applicant]
US 11275580B2 · Tamir et al. · 2022 [cited by applicant]
US 11277475B1 · Tal et al. · 2022 [cited by applicant]
US 11281442B1 · Tal et al. · 2022 [cited by applicant]
US 11294666B1 · Look · 2022 [cited by applicant]
US 11296922B2 · Leibkowiz et al. · 2022 [cited by applicant]
US 11301503B2 · Burli · 2022 [cited by applicant]
US 11379089B2 · Goswami et al. · 2022 [cited by applicant]
US 11451573B2 · Waplington · 2022 [cited by applicant]
US 11470107B2 · Waplington · 2022 [cited by applicant]
US 11582106B2 · Hameiri et al. · 2023 [cited by applicant]
US 11616690B2 · Feiguine et al. · 2023 [cited by applicant]
US 11630717B2 · Vutukuru et al. · 2023 [cited by applicant]
US 11632303B2 · Bitterfeld et al. · 2023 [cited by applicant]
US 11640369B2 · Bhogle et al. · 2023 [cited by applicant]
US 11671444B2 · Waplington · 2023 [cited by applicant]
US 11695641B2 · Bar Oz et al. · 2023 [cited by applicant]
US 11829233B2 · Watkins et al. · 2023 [cited by applicant]
US 11868593B2 · Bradley et al. · 2024 [cited by applicant]
US 20020116340A1 · Hellberg et al. · 2002 [cited by applicant]
US 20020133584A1 · Greuel et al. · 2002 [cited by applicant]
US 20020158969A1 · Gupta · 2002 [cited by applicant]
US 20030118087A1 · Goldthwaite et al. · 2003 [cited by applicant]
US 20030200293A1 · Fearn et al. · 2003 [cited by applicant]
US 20050015217A1 · Weidl et al. · 2005 [cited by applicant]
US 20050091356A1 · Izzo · 2005 [cited by applicant]
US 20060026453A1 · Frost et al. · 2006 [cited by applicant]
US 20060095461A1 · Raymond · 2006 [cited by applicant]
US 20060179058A1 · Bram et al. · 2006 [cited by applicant]
US 20060288053A1 · Holt et al. · 2006 [cited by applicant]
US 20060293942A1 · Chaddha et al. · 2006 [cited by applicant]
US 20070033279A1 · Battat et al. · 2007 [cited by applicant]
US 20070188494A1 · Agutter et al. · 2007 [cited by applicant]
US 20070288389A1 · Vaughan et al. · 2007 [cited by applicant]
US 20080133289A1 · Armour et al. · 2008 [cited by applicant]
US 20080148253A1 · Badwe et al. · 2008 [cited by applicant]
US 20080319779A1 · Hughes et al. · 2008 [cited by applicant]
US 20090088875A1 · Baier et al. · 2009 [cited by applicant]
US 20090228984A1 · Sterin · 2009 [cited by applicant]
US 20100110932A1 · Doran et al. · 2010 [cited by applicant]
US 20120198399A1 · Safarpour · 2012 [cited by examiner]
US 20130283273A1 · Miyazaki · 2013 [cited by applicant]
US 20140046735A1 · Ashikawa · 2014 [cited by applicant]
US 20140122427A1 · Dary · 2014 [cited by applicant]
US 20150135018A1 · Hotta · 2015 [cited by applicant]
US 20160293133A1 · Dutt · 2016 [cited by examiner]
US 20180123940A1 · Rimar et al. · 2018 [cited by applicant]
US 20190073257A1 · Dasgupta et al. · 2019 [cited by applicant]
US 20190089597A1 · Pathak · 2019 [cited by applicant]
US 20190104398A1 · Owen et al. · 2019 [cited by applicant]
US 20190129739A1 · Al Reza et al. · 2019 [cited by applicant]
US 20190149515A1 · Sharma et al. · 2019 [cited by applicant]
US 20190165957A1 · Abbott et al. · 2019 [cited by applicant]
US 20190342162A1 · Bendre et al. · 2019 [cited by applicant]
US 20200034462A1 · Narayanasamy et al. · 2020 [cited by applicant]
US 20200050689A1 · Tal et al. · 2020 [cited by applicant]
US 20200204443A1 · Bar Oz et al. · 2020 [cited by applicant]
US 20200301678A1 · Burman et al. · 2020 [cited by applicant]
US 20200310939A1 · Timo · 2020 [cited by applicant]
US 20210027205A1 · Sevakula · 2021 [cited by applicant]
US 20210097168A1 · Patel et al. · 2021 [cited by applicant]
US 20210149790A1 · Renner · 2021 [cited by applicant]
US 20210194764A1 · Badyan et al. · 2021 [cited by applicant]
US 20210281492A1 · Di Pietro · 2021 [cited by applicant]
US 20210287109A1 · Cmielowski · 2021 [cited by examiner]
US 20210294717A1 · Wang · 2021 [cited by applicant]
US 20210306201A1 · Wang · 2021 [cited by examiner]
US 20220156134A1 · Lehmann · 2022 [cited by applicant]
US 20220171800A1 · Kumaresan · 2022 [cited by applicant]
US 20220188705A1 · Davoodi · 2022 [cited by applicant]
US 20220303352A1 · Herzog et al. · 2022 [cited by applicant]
US 20230021373A1 · Kabbinale · 2023 [cited by examiner]
US 20230089759A1 · Hu · 2023 [cited by examiner]
US 20230229542A1 · Watkins et al. · 2023 [cited by applicant]
US 20240250885A1 · Kantal · 2024 [cited by examiner]
US 20240298225A1 · Hyde · 2024 [cited by examiner]
US 20240354220A1 · Mahajan · 2024 [cited by examiner]
EP 0433979A2 · 1991 [cited by applicant]
EP 1607824A2 · 2005 [cited by applicant]
WO 9934285A1 · 1999 [cited by applicant]
WO 0052559A1 · 2000 [cited by applicant]
WO 0179970A1 · 2001 [cited by applicant]