according to embodiments of the invention , a system , method , and computer program provide an execution probability of a limit order of a given security during a given time period . the system , method , and computer program capture and / or calculate the frequency of trade execution , the time evolution of the price , the time evolution of the trade volume , and the current state of the market , among other parameters , for the given security . the system , method , and computer program generate a probability function based on the parameters corresponding to various time spans , i . e ., the execution probability of a limit order within a given time period is provided . fig1 depicts an embodiment of a high - level flow 100 for estimating the probability of a limit order being executed . as populated , database 102 represents a database of trade data for the concerned security . in an embodiment , the database contains the trade price , trade volume , and trade timestamps for completed trades . this data may be obtained in any suitable manner by a programmed computer that received a data stream of market data or tick data and / or accesses a database , and selects and stores relevant data in the database 102 . as populated , database 104 represents a limit order book database . in an embodiment , the database contains ask and bid prices , volume data , and timestamp data . limit order data may be obtained from one or more entities &# 39 ; order management system ( oms ). firms maintain omss for orders of that firm in various securities , and services maintain omss for their clients . limit order data for a given security may be obtained from one or more omss in any suitable manner by a programmed computer having access to the concerned oms ( s ), which selects the limit order book data and populates database 104 . in block 106 , the trade data is extracted from databases 102 and 104 for a given security during a given time period . for example , a programmed computer may download the trade price , trade volume , and trade timestamps for each trade during a five minute period of time as well as the last bid price ( if the order is a buy order ) or last ask price ( if the order is a sell order ) and volume data during the same five minute period . in blocks 108 , 110 , and 112 market characteristics related to the trading of the security are captured or calculated by a programmed computer using algorithms such as described herein . in block 108 the frequency of trade execution , is calculated for the security . in an embodiment , interarrival trade times are independent and identically - distributed exponential random variables . in this embodiment , an intensity parameter is calibrated based on input parameters comprising an array of trade timestamps for the interarrival trade times . in an embodiment , the following algorithm 108 calibrates the intensity parameter in block 108 based on the input parameters comprising an array of trade timestamps for the interarrival trade times , where t is trade timestamp data and n is the number of trades : in an embodiment , the above algorithm is executed in block 108 by the following pseudocode : in block 110 the price movement of the security is calculated . price movements may follow a certain model , e . g ., a brownian motion , a geometric brownian motion , martingale , a semimartingale , or monte carlo . in an embodiment , the drift and volatility parameters are calibrated based on input parameters comprising an array of trade prices and trade timestamps for a given model , e . g ., a brownian motion with a drift . in an embodiment , the following algorithm 110 a calibrates the drift coefficient in block 110 based on the input of an array of trade prices and an array of corresponding trade timestamps , where m is the estimate for the two moments of inter - arrival trade times , p is trade price , and t is trade timestamp data . in an embodiment , the following algorithm 110 b calibrates the volatility coefficient in block 110 based on the input of an array of trade prices and an array of corresponding trade timestamps , where m is the estimate for the two moments of inter - arrival trade times , p is trade price , and t is trade timestamp data . in an embodiment , the above algorithms for drift and volatility coefficients are executed in block 110 by the following pseudocode : in block 112 , the distribution of trade volumes of the security is calculated . in an embodiment , trade volumes are independent and identically - distributed weibull random variables . accordingly , location , scale , and shape weibull parameters are calibrated based on input parameters comprising an array of trade volumes . more specifically , block 112 takes as input an array of independent and identically - distributed observations of a three - parameter weibull distribution and returns , as output , the estimates for the location , scale , and shape parameters . in an embodiment , the following algorithm 112 a calibrates the shape parameter in block 112 where n is the number of sample data : in an embodiment , the following algorithm 112 b calibrates the location parameter in block 112 , where n is the number of sample data and minimum is the minimum trade volume : in an embodiment , the following algorithm 112 c calibrates the scale parameter in block 112 , where n is the number of sample data and minimum is the minimum trade volume : in an embodiment , the above algorithms for calibrating the shape , location , and scale coefficients are executed in block 112 by the following pseudocode : in block 114 , the current state of the market is calculated based on the price - volume pair of an order . in an embodiment , in a buy order , the current state is defined as algorithm 114 a comprising the price - volume pair of the latest ask price and the latest ask volume . in an embodiment , in a sell order , the current state is defined as algorithm 114 b comprising the price - volume pair of the latest bid price and the latest bid volume . in an embodiment , the above algorithms for calibrating the price - volume pairs are executed in block 114 by the following pseudocode : the parameters calculated in blocks 108 , 110 , 112 , and 114 are received in block 116 as input to the execution probability algorithms . the algorithms produce , as output , a probability function corresponding to various time spans , i . e ., the execution probability of a limit order within a given time period , e . g ., the next two minutes , based on the input parameters . fig2 illustrates a flow of block 116 of fig1 which receives input parameters from blocks 108 , 110 , 112 , and 114 of fig1 and calculates the execution probability of a limit order within a given time period . fig2 depicts an embodiment of a flow 200 for calculating the parameters discussed in connection with fig1 for a sell limit order , to which the following description applies . parameters may be calculated for a buy limit order in a similar fashion . in block 202 , input parameters from blocks 108 , 110 , 112 , and 114 of fig1 are transformed into auxiliary parameters to simplify the algorithms prior to final computation of the execution probability and to allow the same set of algorithms to be used in both buy and sell orders , with only the definitions of the auxiliary parameters differing . the auxiliary parameters may be generated by suitable mathematical transformation as can be determined by any person reasonably skilled in the art . in an embodiment , the auxiliary parameters are generated differentials . in an embodiment , the following algorithms 202 a , 202 b , and 202 c generate the auxiliary parameters in block 202 , where x is price , y is volume , t is trade timestamp data , μ is the drift coefficient , and γ is the volatility coefficient : calculating the execution probability of a limit order within a given time period may be based on any of a series of algorithms to improve the accuracy of the probability result . in an embodiment , the algorithm used for calculating the execution probability of a given limit order is chosen based on price and volume parameters . in an embodiment , three algorithms are employed for different orders . more specifically , a first algorithm is applied if the sell price of a given security is equal to or below the bid price , and if the sell volume is below or equal to the bid volume . a second algorithm is applied if the sell price of a given security is equal to or below the bid price , and if the sell volume is greater than the bid volume . a third algorithm is applied if the sell price of a given security is greater than the bid price . to determine which of the three algorithms to apply , in an embodiment , block 204 ( fig2 ) determines whether the sell price of a given security is equal to or below the bid price . if the sell price is indeed below the bid price , the flow progresses to block 206 . in block 206 , to further determine which of the three algorithms to apply , in an embodiment , it is determined whether the sell volume of a given security is equal to or below the bid volume . if the sell volume of a given security is equal to or below the bid volume , the flow progresses to block 208 . in an embodiment , the above algorithms for generating the auxiliary parameters and the decisions in blocks 204 and 206 for a sell order may be executed by the pseudocode below , corresponding to fig2 , where the ordertype is equal to “ sell .” in the pseudocode below , “ op ” corresponds to sell price in fig2 , and “ sp ” corresponds to “ state price ” or bid price in fig2 . the flow for an order type equal to “ buy ” is similar to the flow depicted in fig2 , with the inequality and relationships being reversed for buy and offer prices . in block 208 , where the sell price of a given security has been determined to be equal to or below the bid price and the sell volume has been determined to be equal to or below the bid volume , the execution probability of the order is assumed to be one hundred percent , which is set in block 210 without further calculation . returning to block 206 , if the sell volume of a given security is greater than the bid volume , the flow progresses to block 212 . in block 212 , where the sell price of a given security has been determined to be equal to or below the bid price and the sell volume has been determined to be greater than the bid volume , the execution probability of the order is assumed to be less than one hundred percent . more specifically , as the bid volume is below the sell volume , a situation is created where the seller may request that the bidder execute a larger order , thereby affecting the execution probability . to calculate an execution probability where the sell price of a given security is equal to or below the bid price , but the sell volume is greater than the bid volume , the flow progresses to block 214 . in this block , an integration formula is applied using the auxiliary parameters generated in block 202 along with the amount of time by which the order is to be executed , thereby returning the appropriate integrand . the returned integrand will be used to numerically evaluate execution probability in block 216 . in an embodiment , the er f c function , a complementary error function of the c math library , is employed . in an embodiment , the following algorithm 214 returns the appropriate integrand in block 214 , where p , q and θ are as defined above in algorithms 202 a , 202 b , and 202 c , and t is trade timestamp data : in block 216 , an adaptive numerical integration routine is applied using the auxiliary parameters generated in block 202 along with the amount of time by which the order is to be executed and along with the integrand calculated in block 214 . in an embodiment , the adaptive numerical integration routine comprises the adaptive gauss - kronrod quadrature routine . the output of the adaptive numerical integration routine is the execution probability of the limit order based on the given parameters . in an embodiment , the following algorithm 216 returns the execution probability of the limit order based on the given parameters in block 216 , where p , q and θ are as defined above in algorithms 202 a , 202 b , and 202 c , and t is trade timestamp data : returning to block 204 ( fig2 ), if the sell price of a given security is greater than the bid price , the flow progresses to block 218 . in such a case , the execution probability of the order is below one hundred percent as the bid price is below the sell price . accordingly , an execution probability formula computes the probability that the order gets executed within a pre - specified time window . to calculate an execution probability where the sell price of a given security is greater than the bid price , the flow progresses to block 220 . this block applies an integration formula using the auxiliary parameters generated in block 202 along with the amount of time by which the order is to be executed , thereby returning the appropriate integrand . the returned integrand will be used to numerically evaluate execution probability in block 222 . in an embodiment , the er f c function , a complementary error function of the c math library , is employed . in an embodiment , the following algorithm 220 returns the appropriate integrand in block 220 , where p , q and θ are as defined above in algorithms 202 a , 202 b , and 202 c , and t is trade timestamp data : in block 222 , an adaptive numerical integration routine is applied using the auxiliary parameters generated in block 202 along with the amount of time by which the order is to be executed and the integrand calculated in block 220 . in an embodiment , the adaptive numerical integration routine comprises the adaptive gauss - kronrod quadrature routine . the output of the adaptive numerical integration routine is the execution probability of the limit order based on the given parameters . in an embodiment , the following algorithm 222 returns the execution probability of the limit order based on the given parameters in block 222 , where p , q and θ are as defined above in algorithms 202 a , 202 b , and 202 c , and t is trade timestamp data : fig3 illustrates a computer system 300 for implementing the functionality described herein . order management system database 312 feeds order management system 310 . market data database 316 and ticker plant 318 feed market data system 314 . execution probability system 308 receives data from order management system 310 comprising at least one computer and market data system 314 comprising at least one computer and stores the extracted data in limit order book database 304 and trade data database 306 . execution probability system 308 generates execution probabilities and forwards the execution probability data to computer 320 , which may be a personal computer , a financial terminal , or a web server . computer 320 may also be used to manage execution probability system 308 . limit order book database 304 , trade data database 306 , order management system database 312 , market data database 316 , ticker plant 318 , order management system 310 , market data system 314 , execution probability system 308 , and computer 320 may be connected via network connection 302 which may be any type of network system such as a local network , wide area network , or the internet . other arrangements of computer hardware and computer architecture may be used to collect , calculate , and store data , generate visual representations , and provide reports . in various embodiments of the present invention , a computer program product comprises a computer program embodied on at least one computer readable medium , the computer program when executed being operative in performing the functionality described herein . while the invention has been described and illustrated in connection with embodiments , many variations and modifications as will be evident to those skilled in this art may be made without departing from the spirit and scope of the invention as defined by the claims , and the invention is thus not to be limited to the precise details of methodology or construction set forth above as such variations and modifications are intended to be included within the scope of the invention as defined by the claims .