Login / Signup
A reachable throughput upper bound for live and safe free choice nets via T-invariants.
Francesco Basile
Ciro Carbone
Pasquale Chiacchio
Published in:
ECC (2003)
Keyphrases
</>
upper bound
lower bound
error probability
upper and lower bounds
lower and upper bounds
worst case
moment invariants
response time
real time
branch and bound algorithm
generalization error
branch and bound
affine invariant
state space
search algorithm
case study
data sets