IP Library Granted Patent US 12,438,916
Granted Patent B2
US 12,438,916 · App. 18/433,378 · Granted Oct 7, 2025

Intelligent automated planning system for large-scale operations

Inventors: Jason Crabtree (Vienna, VA); Andrew Sellers (Monument, CO)
Assignee: QOMPLX LLC
H04L63/20G06F16/2477G06F16/951H04L63/1425H04L63/1441
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,438,916
App. No.
18/433,378
Granted
Oct 7, 2025
Kind
B2
Abstract

A system for corporate plan determination and validation employing an advanced decision platform comprises a data retrieval module configured to retrieve cooperative venture related data such as financial, operations and historical data related to the current cooperative plan. A predictive analytics module performs predictive risk functions on venture related data. A predictive simulation module performs predictive simulation functions on risk, operations, and financial data. An interactive display module displays the results of predictive analytics and predictive simulation according to pre-designated specifications of the analysts.

Claims (85)

1. A computing system for prediction of future performance of large-scale operations and to manage financial, operational and market execution risk employing an intelligent automated planning system, the computing system comprising:

one or more hardware processors configured for:

instantiating a distributed computational graph comprising nodes representing data transformations and edges representing messages between the nodes, wherein:

the distributed computational graph comprises a data processing workflow for analyzing a large-scale operational plan and associated risk factors based on market, operations and financial data retrieved over the web from both corporate operations data stores and other exogenous sources; and

the data transformation of one or more of the nodes comprises receipt of data from at least one physical or virtual sensor or application telemetry source;

storing the data processing workflow of the distributed computational graph;

performing a plurality of analytic and simulation computations as directed by the data processing workflow of the distributed computational graph;

producing a first result comprising a first plurality of estimated future states of the large-scale operational plan under at least one scenario over a finite time horizon; and

producing a second result comprising at least one additional scenario and a second plurality of estimated future states associated with the at least one additional scenario, and a plurality of associated risk factors and their impact on the first and second pluralities of estimated future states.

2. The computing system of claim 1 , wherein the one or more hardware processors are further configured for:

automatically negotiating contract terms for at least two system subscriber parties jointly undertaking the large-scale operational plan using difference estimation analytics such that a resultant contract requires only contract term acceptance by human representatives of the system subscriber parties to bind the parties to carry out the large-scale operational plan.

3. The computing system of claim 2 , wherein natural language processing is used to analyze text of at least one existing contract to extract contract primitives as part of its contract analysis.

4. The computing system of claim 2 , wherein the system determines a valuation and a maximum liability for a counterparty of at least one existing contract or contract portfolio.

5. The computing system of claim 2 , wherein the system renegotiates or optimizes at least one contract in a portfolio of contracts between parties in the large-scale operational plan using existing contract instruments as input.

6. The computing system of claim 2 , wherein the system renegotiates or optimizes at least one contract between corporation parties in at least one multi-corporation venture plan using existing an existing contract instrument as input.

7. The computing system of claim 2 , wherein the one or more hardware processors are further configured for:

determining contract terms for at least two system subscriber parties jointly undertaking the large-scale operational plan using difference estimation analytics such that a resultant contract requires only contract term acceptance by human representatives of the system subscriber parties to bind the parties to carry out the large-scale operational plan;

presenting a contract comprising the contract terms to both of the at least two system subscriber parties; and

obtaining the contract term acceptance by the human representatives.

8. The computing system of claim 1 , wherein the one or more hardware processors are further configured for:

comparing the at least one scenario of the first result to the at least one additional scenario of the second result based on individual metrics and aggregate metrics, wherein the aggregate metrics are determined by at least one objective function.

9. The computing system of claim 8 , wherein multiple objective functions are used to perform the comparison, wherein each objective function of the multiple objective functions is for a different business objective.

10. A computer-implemented method executed on an intelligent automated planning system for prediction of future performance of large-scale operations and to manage financial, operational and market execution risk, the computer implemented method comprising:

instantiating a distributed computational graph comprising nodes representing data transformations and edges representing messages between the nodes, wherein:

the distributed computational graph comprises a data processing workflow for analyzing a large-scale operational plan and associated risk factors based on market, operations and financial data retrieved over the web from both corporate operations data stores and analogous previous venture outcome data stores; and

the data transformation of one or more of the nodes comprises receipt of data from a physical sensor;

storing the data processing workflow of the distributed computational graph;

performing a plurality of analytic and simulation computations as directed by the data processing workflow of the distributed computational graph;

producing a first result comprising a first plurality of estimated future states of the large-scale operational plan under at least one scenario over a finite time horizon; and

producing a second result comprising at least one additional scenario and a second plurality of estimated future states associated with the at least one additional scenario, and a plurality of associated risk factors and their impact on the first and second pluralities of estimated future states.

11. The computer-implemented method of claim 10 , comprising the additional step of:

automatically negotiating contract terms for at least two system subscriber parties jointly undertaking the large-scale operational plan using difference estimation analytics such that a resultant contract requires only contract term acceptance by human representatives of the system subscriber parties to bind the parties to carry out the large-scale operational plan.

12. The computer-implemented method of claim 11 wherein the intelligent automated planning subsystem uses natural language processing to analyze the text of at least one existing contract to extract contract primitives as part of its contract analysis.

13. The computer-implemented method of claim 11 , wherein the intelligent automated planning subsystem is used to intelligently determine a valuation and a maximum liability for a counterparty of at least one existing contract or contract portfolio.

14. The computer-implemented method of claim 11 , wherein the intelligent automated planning subsystem is used to intelligently renegotiate or optimize at least one contract in a portfolio of contracts between parties in the large-scale operational plan using existing contract instruments as input.

15. The computer-implemented method of claim 11 , wherein the intelligent automated planning subsystem is used to intelligently renegotiate or optimize at least one contract between corporation parties in at least one multi-corporation venture plan using existing an existing contract instrument as input.

16. The computer-implemented method of claim 11 , comprising the additional steps of:

determining contract terms for at least two system subscriber parties jointly undertaking the large-scale operational plan using difference estimation analytics such that a resultant contract requires only contract term acceptance by human representatives of the system subscriber parties to bind the parties to carry out the large-scale operational plan;

presenting a contract comprising the contract terms to both of the at least two system subscriber parties; and

obtaining the contract term acceptance by the human representatives.

17. The computer-implemented method of claim 10 , comprising the additional step of:

comparing the at least one scenario of the first result to the at least one additional scenario of the second result based on individual metrics and aggregate metrics, wherein the aggregate metrics are determined by at least one objective function.

18. The computer-implemented method of claim 17 , wherein multiple objective functions are used to perform the comparison, wherein each objective function of the multiple objective functions is for a different business objective.

19. A system for prediction of future performance of large-scale operations and to manage financial, operational and market execution risk employing an intelligent automated planning system, comprising one or more computers each comprising a hardware processor with executable instructions that, when executed, cause the system to:

instantiate a distributed directed computational graph comprising nodes representing data transformations and edges representing messages between the nodes, wherein:

the distributed computational graph comprises a data processing workflow for analyzing a large-scale operational plan and associated risk factors based on market, operations and financial data retrieved over the web from both corporate operations data stores and other exogenous sources; and

the data transformation of one or more of the nodes comprises receipt of data from at least one physical or virtual sensor or application telemetry source;

store the data processing workflow of the distributed computational graph;

perform a plurality of analytic and simulation computations as directed by the data processing workflow of the distributed computational graph;

produce a first result comprising a first plurality of estimated future states of the large-scale operational plan under at least one scenario over a finite time horizon; and

produce a second result comprising at least one additional scenario and a second plurality of estimated future states associated with it the at least one additional scenario, and a plurality of associated risk factors and their impact on the first and second pluralities of estimated future states.

20. The system of claim 19 , wherein the system is further caused to:

automatically negotiate contract terms for at least two system subscriber parties jointly undertaking the large-scale operational plan using difference estimation analytics such that a resultant contract requires only contract term acceptance by human representatives of the system subscriber parties to bind the parties to carry out the large-scale operational plan.

21. The system of claim 20 , wherein the natural language processing is used to analyze the text of at least one existing contract to extract contract primitives as part of its contract analysis.

22. The system of claim 20 , wherein the system is further caused to intelligently determine a valuation and a maximum liability for a counterparty of at least one existing contract or contract portfolio.

23. The system of claim 20 , wherein the system is further caused to renegotiate or optimize at least one contract in a portfolio of contracts between parties the large-scale operational plan using existing contract instruments as input.

24. The system of claim 20 , wherein the system intelligently renegotiates or optimizes at least one contract between corporation parties in at least one multi-corporation venture plan using existing an existing contract instrument as input.

25. The system of claim 20 , wherein the system is further caused to:

determine contract terms for at least two system subscriber parties jointly undertaking the large-scale operational plan using difference estimation analytics such that a resultant contract requires only contract term acceptance by human representatives of the system subscriber parties to bind the parties to carry out the large-scale operational plan;

present a contract comprising the contract terms to both of the at least two system subscriber parties; and

obtain the contract term acceptance by the human representatives.

26. The system of claim 19 , wherein the system is further caused to:

compare the at least one scenario of the first result to the at least one additional scenario of the second result based on individual metrics and aggregate metrics, wherein the aggregate metrics are determined by at least one objective function.

27. The system of claim 26 , wherein multiple objective functions are used to perform the comparison, wherein each objective function of the multiple objective functions is for a different business objective.

28. Non-transitory, computer-readable storage media having computer-executable instructions embodied thereon that, when executed by one or more processors of a computing system employing an intelligent automated planning system for prediction of future performance of large-scale operations and to manage financial, operational and market execution risk, cause the computing system to:

instantiate a distributed computational graph comprising nodes representing data transformations and edges representing messages between the nodes, wherein:

the distributed computational graph comprises a data processing workflow for analyzing a large-scale operational plan and associated risk factors based on market, operations and financial data retrieved over the web from both corporate operations data stores and other exogenous sources; and

the data transformation of one or more of the nodes comprises receipt of data from at least one physical or virtual sensor or application telemetry source;

store the data processing workflow of the distributed computational graph;

perform a plurality of analytic and simulation computations as directed by the data processing workflow of the distributed computational graph;

produce a first result comprising a first plurality of estimated future states of the large-scale operational plan under at least one scenario over a finite time horizon; and

produce a second result comprising at least one additional scenario and a second plurality of estimated future states associated with it the at least one additional scenario, and a plurality of associated risk factors and their impact on the first and second pluralities of estimated future states.

29. The non-transitory, computer-readable storage media of claim 28 , wherein the computing system is further caused to:

automatically negotiate contract terms for at least two system subscriber parties jointly undertaking the large-scale operational plan using difference estimation analytics such that a resultant contract requires only contract term acceptance by human representatives of the system subscriber parties to bind the parties to carry out the large-scale operational plan.

30. The non-transitory, computer-readable storage media of claim 29 , wherein the natural language processing is used to analyze the text of at least one existing contract to extract contract primitives as part of its contract analysis.

31. The non-transitory, computer-readable storage media of claim 29 , wherein the system intelligently determines a valuation and a maximum liability for a counterparty of at least one existing contract or contract portfolio.

32. The non-transitory, computer-readable storage media of claim 29 , wherein the computing system is further caused to intelligently renegotiate or optimize at least one contract in a portfolio of contracts between parties in the large-scale operational plan using existing contract instruments as input.

33. The non-transitory, computer-readable storage media of claim 29 , wherein the computing system is further caused to intelligently renegotiate or optimize at least one contract between corporation parties in at least one multi-corporation venture plan using existing an existing contract instrument as input.

34. The non-transitory, computer-readable storage media of claim 29 , wherein the computing system is further caused to:

determine contract terms for at least two system subscriber parties jointly undertaking the large-scale operational plan using difference estimation analytics such that a resultant contract requires only contract term acceptance by human representatives of the system subscriber parties to bind the parties to carry out the large-scale operational plan;

present a contract comprising the contract terms to both of the at least two system subscriber parties; and

obtain the contract term acceptance by the human representatives.

35. The non-transitory, computer-readable storage media of claim 28 , wherein the computing system is further caused to:

compare the at least one scenario of the first result to the at least one additional scenario of the second result based on individual metrics and aggregate metrics, wherein the aggregate metrics are determined by at least one objective function.

36. The non-transitory, computer-readable storage media of claim 35 , wherein multiple objective functions are used to perform the comparison, wherein each objective function of the multiple objective functions is for a different business objective.

Assignments (4)
CHANGE OF NAME Recorded Jul 8, 2024
From: QPX LLC
To: QOMPLX LLC
Reel/Frame 067930/0619 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2024
From: QOMPLX, INC.
To: QPX LLC
Reel/Frame 067807/0831 →
CHANGE OF NAME Recorded Jun 13, 2024
From: FRACTAL INDUSTRIES, INC.
To: QOMPLX, INC.
Reel/Frame 067723/0717 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 11, 2024
From: CRABTREE, JASON; SELLERS, ANDREW
To: FRACTAL INDUSTRIES, INC.
Reel/Frame 067694/0732 →
Continuity (3)
Continuation 17106997 · Nov 30, 2020
Continuation In Part 15931534 · May 13, 2020
Related Publication 20240179185A1 · May 30, 2024
References Cited (177)
US 5669000A · Jessen et al. · 1997 [cited by applicant]
US 6256544B1 · Weissinger · 2001 [cited by applicant]
US 6477572B1 · Elderton et al. · 2002 [cited by applicant]
US 7072863B1 · Phillips et al. · 2006 [cited by applicant]
US 7171515B2 · Ohta et al. · 2007 [cited by applicant]
US 7530105B2 · Gilbert et al. · 2009 [cited by applicant]
US 7657406B2 · Tolone et al. · 2010 [cited by applicant]
US 7698213B2 · Lancaster · 2010 [cited by applicant]
US 7739653B2 · Venolia · 2010 [cited by applicant]
US 8065257B2 · Kuecuekyan · 2011 [cited by applicant]
US 8145761B2 · Liu et al. · 2012 [cited by applicant]
US 8180854B2 · Schneider · 2012 [cited by applicant]
US 8281121B2 · Nath et al. · 2012 [cited by applicant]
US 8595262B1 · Hayden · 2013 [cited by examiner]
US 8615800B2 · Baddour et al. · 2013 [cited by applicant]
US 8677473B2 · Dennerline et al. · 2014 [cited by applicant]
US 8788254B2 · Peloski · 2014 [cited by applicant]
US 8788306B2 · Delurgio et al. · 2014 [cited by applicant]
US 8793758B2 · Raleigh et al. · 2014 [cited by applicant]
US 8856936B2 · Ray et al. · 2014 [cited by applicant]
US 8914878B2 · Burns et al. · 2014 [cited by applicant]
US 8990392B1 · Stamos · 2015 [cited by applicant]
US 8997233B2 · Green et al. · 2015 [cited by applicant]
US 9020802B1 · Florissi et al. · 2015 [cited by applicant]
US 9092616B2 · Kumar et al. · 2015 [cited by applicant]
US 9122694B1 · Dukes et al. · 2015 [cited by applicant]
US 9134966B2 · Brock et al. · 2015 [cited by applicant]
US 9137131B1 · Sarukkai et al. · 2015 [cited by applicant]
US 9141360B1 · Chen et al. · 2015 [cited by applicant]
US 9231962B1 · Yen et al. · 2016 [cited by applicant]
US 9299029B1 · Kim · 2016 [cited by applicant]
US 9319430B2 · Bell, Jr. et al. · 2016 [cited by applicant]
US 9350550B2 · Nix · 2016 [cited by applicant]
US 9357381B2 · Cho et al. · 2016 [cited by applicant]
US 9384345B2 · Dixon et al. · 2016 [cited by applicant]
US 9426118B2 · Kim · 2016 [cited by applicant]
US 9451462B2 · Kim et al. · 2016 [cited by applicant]
US 9503470B2 · Gertner et al. · 2016 [cited by applicant]
US 9571510B1 · Shen et al. · 2017 [cited by applicant]
US 9602530B2 · Ellis et al. · 2017 [cited by applicant]
US 9654495B2 · Hubbard et al. · 2017 [cited by applicant]
US 9672355B2 · Titonis et al. · 2017 [cited by applicant]
US 9686308B1 · Srivastava · 2017 [cited by applicant]
US 9762443B2 · Dickey · 2017 [cited by applicant]
US 9811794B2 · Mun · 2017 [cited by examiner]
US 9887933B2 · Lawrence, III · 2018 [cited by applicant]
US 9946517B2 · Talby et al. · 2018 [cited by applicant]
US 9967334B2 · Ford · 2018 [cited by applicant]
US 10061635B2 · Ellwein · 2018 [cited by applicant]
US 10200233B2 · Anderson et al. · 2019 [cited by applicant]
US 10210246B2 · Stojanovic et al. · 2019 [cited by applicant]
US 10210255B2 · Crabtree et al. · 2019 [cited by applicant]
US 10216485B2 · Misra et al. · 2019 [cited by applicant]
US 10242406B2 · Kumar et al. · 2019 [cited by applicant]
US 10248910B2 · Crabtree et al. · 2019 [cited by applicant]
US 10262321B1 · Ramanathan et al. · 2019 [cited by applicant]
US 10318882B2 · Brueckner et al. · 2019 [cited by applicant]
US 10320828B1 · Derbeko et al. · 2019 [cited by applicant]
US 10367829B2 · Huang et al. · 2019 [cited by applicant]
US 10511498B1 · Narayan et al. · 2019 [cited by applicant]
US 10831838B2 · Kraning et al. · 2020 [cited by applicant]
US 11017096B2 · Tsokos et al. · 2021 [cited by applicant]
US 20030115080A1 · Kasravi et al. · 2003 [cited by applicant]
US 20040010491A1 · Riedinger · 2004 [cited by applicant]
US 20040255167A1 · Knight · 2004 [cited by applicant]
US 20050000165A1 · Dischinat et al. · 2005 [cited by applicant]
US 20050289072A1 · Sabharwal · 2005 [cited by applicant]
US 20060100958A1 · Cheng et al. · 2006 [cited by applicant]
US 20060149575A1 · Varadarajan et al. · 2006 [cited by applicant]
US 20070012161A1 · Lyles · 2007 [cited by applicant]
US 20070021955A1 · Tolone et al. · 2007 [cited by applicant]
US 20070043656A1 · Lancaster · 2007 [cited by applicant]
US 20070226796A1 · Gilbert et al. · 2007 [cited by applicant]
US 20080027690A1 · Watts · 2008 [cited by applicant]
US 20080091757A1 · Ingrassia et al. · 2008 [cited by applicant]
US 20080172353A1 · Lim et al. · 2008 [cited by applicant]
US 20090018996A1 · Hunt et al. · 2009 [cited by applicant]
US 20090064088A1 · Barcia et al. · 2009 [cited by applicant]
US 20090089227A1 · Sturrock et al. · 2009 [cited by applicant]
US 20090222562A1 · Liu et al. · 2009 [cited by applicant]
US 20090293128A1 · Lippmann et al. · 2009 [cited by applicant]
US 20100042846A1 · Trotter et al. · 2010 [cited by applicant]
US 20100180337A1 · Bajekal · 2010 [cited by applicant]
US 20100185579A1 · Hong et al. · 2010 [cited by applicant]
US 20100205588A1 · Yu et al. · 2010 [cited by applicant]
US 20100228693A1 · Dawson et al. · 2010 [cited by applicant]
US 20110054860A1 · Guild et al. · 2011 [cited by applicant]
US 20110060821A1 · Loizeaux et al. · 2011 [cited by applicant]
US 20110154341A1 · Pueyo et al. · 2011 [cited by applicant]
US 20110208681A1 · Kuecuekyan · 2011 [cited by applicant]
US 20120030757A1 · Baikalov et al. · 2012 [cited by applicant]
US 20120266244A1 · Green et al. · 2012 [cited by applicant]
US 20120303396A1 · Winkler et al. · 2012 [cited by applicant]
US 20130041921A1 · Cooper et al. · 2013 [cited by applicant]
US 20130073062A1 · Smith et al. · 2013 [cited by applicant]
US 20130073686A1 · Sandholm · 2013 [cited by applicant]
US 20130111592A1 · Zhu et al. · 2013 [cited by applicant]
US 20130117852A1 · Stute · 2013 [cited by applicant]
US 20130132149A1 · Wei et al. · 2013 [cited by applicant]
US 20130179982A1 · Bridges et al. · 2013 [cited by applicant]
US 20130191416A1 · Lee et al. · 2013 [cited by applicant]
US 20130246996A1 · Duggal et al. · 2013 [cited by applicant]
US 20130304623A1 · Kumar et al. · 2013 [cited by applicant]
US 20130346354A1 · Mizell et al. · 2013 [cited by applicant]
US 20140074826A1 · Cooper et al. · 2014 [cited by applicant]
US 20140156806A1 · Karpistsenko et al. · 2014 [cited by applicant]
US 20140201221A1 · Eden et al. · 2014 [cited by applicant]
US 20140237599A1 · Gertner et al. · 2014 [cited by applicant]
US 20140244612A1 · Bhasin et al. · 2014 [cited by applicant]
US 20140245376A1 · Hibbert · 2014 [cited by examiner]
US 20140245443A1 · Chakraborty · 2014 [cited by applicant]
US 20140274022A1 · Bell et al. · 2014 [cited by applicant]
US 20140279762A1 · Xaypanya et al. · 2014 [cited by applicant]
US 20140358911A1 · McCarthy et al. · 2014 [cited by applicant]
US 20140359552A1 · Misra et al. · 2014 [cited by applicant]
US 20140365938A1 · Black et al. · 2014 [cited by applicant]
US 20150020199A1 · Neil et al. · 2015 [cited by applicant]
US 20150095303A1 · Sonmez et al. · 2015 [cited by applicant]
US 20150106941A1 · Muller et al. · 2015 [cited by applicant]
US 20150149979A1 · Talby et al. · 2015 [cited by applicant]
US 20150163242A1 · Laidlaw et al. · 2015 [cited by applicant]
US 20150169294A1 · Brock et al. · 2015 [cited by applicant]
US 20150186427A1 · Logothetis et al. · 2015 [cited by applicant]
US 20150195192A1 · Vasseur et al. · 2015 [cited by applicant]
US 20150236935A1 · Bassett · 2015 [cited by applicant]
US 20150339263A1 · Ata et al. · 2015 [cited by applicant]
US 20150347414A1 · Xiao et al. · 2015 [cited by applicant]
US 20150370811A1 · Ding et al. · 2015 [cited by applicant]
US 20150371224A1 · Lingappa · 2015 [cited by applicant]
US 20150379072A1 · Dirac et al. · 2015 [cited by applicant]
US 20150379424A1 · Dirac et al. · 2015 [cited by applicant]
US 20160004858A1 · Chen et al. · 2016 [cited by applicant]
US 20160006629A1 · Tanakiev et al. · 2016 [cited by applicant]
US 20160028758A1 · Ellis et al. · 2016 [cited by applicant]
US 20160078361A1 · Brueckner et al. · 2016 [cited by applicant]
US 20160080399A1 · Harris et al. · 2016 [cited by applicant]
US 20160086275A1 · Adler · 2016 [cited by examiner]
US 20160092557A1 · Stojanovic et al. · 2016 [cited by applicant]
US 20160099960A1 · Gerritz et al. · 2016 [cited by applicant]
US 20160105454A1 · Li et al. · 2016 [cited by applicant]
US 20160140446A1 · Adderly et al. · 2016 [cited by applicant]
US 20160140519A1 · Trepca et al. · 2016 [cited by applicant]
US 20160164905A1 · Wood et al. · 2016 [cited by applicant]
US 20160179945A1 · Lastra Diaz et al. · 2016 [cited by applicant]
US 20160203448A1 · Metnick et al. · 2016 [cited by applicant]
US 20160241580A1 · Watters et al. · 2016 [cited by applicant]
US 20160241581A1 · Watters et al. · 2016 [cited by applicant]
US 20160275123A1 · Lin et al. · 2016 [cited by applicant]
US 20160285732A1 · Brech et al. · 2016 [cited by applicant]
US 20160342606A1 · Mouel et al. · 2016 [cited by applicant]
US 20160350442A1 · Crosby · 2016 [cited by applicant]
US 20160364307A1 · Garg et al. · 2016 [cited by applicant]
US 20160371618A1 · Leidner · 2016 [cited by examiner]
US 20170019678A1 · Kim et al. · 2017 [cited by applicant]
US 20170063896A1 · Muddu et al. · 2017 [cited by applicant]
US 20170083380A1 · Bishop et al. · 2017 [cited by applicant]
US 20170126712A1 · Crabtree et al. · 2017 [cited by applicant]
US 20170139763A1 · Ellwein · 2017 [cited by applicant]
US 20170149802A1 · Huang et al. · 2017 [cited by applicant]
US 20170193110A1 · Crabtree et al. · 2017 [cited by applicant]
US 20170206360A1 · Brucker et al. · 2017 [cited by applicant]
US 20170322959A1 · Tidwell et al. · 2017 [cited by applicant]
US 20170323089A1 · Duggal et al. · 2017 [cited by applicant]
US 20180144243A1 · Hsieh et al. · 2018 [cited by applicant]
US 20180197128A1 · Carstens et al. · 2018 [cited by applicant]
US 20180288085A1 · Hailpern et al. · 2018 [cited by applicant]
US 20180300930A1 · Kennedy et al. · 2018 [cited by applicant]
US 20180373766A1 · Crabtree · 2018 [cited by examiner]
US 20190082305A1 · Proctor · 2019 [cited by applicant]
US 20190095533A1 · Levine et al. · 2019 [cited by applicant]
US 20200043113A1 · DePalma · 2020 [cited by examiner]
US 20200104958A1 · Cheng-Shorland · 2020 [cited by examiner]
WO 2001063534A2 · 2001 [cited by applicant]
WO 2014159150A1 · 2014 [cited by applicant]
WO 2017075543A1 · 2017 [cited by applicant]
Matthiaslohr, Provide a method Peer.close(), Mar. 27, 2013. [cited by applicant]
Microsoft; What's new in Kerberos Authentication, Aug. 31, 2016. [cited by applicant]