Login / Signup
An improved timed automata approach for computing exact worst-case delays of AFDX sporadic flows.
Muhammad Adnan
Jean-Luc Scharbarg
Jérôme Ermont
Christian Fraboul
Published in:
ETFA (2012)
Keyphrases
</>
timed automata
worst case
model checking
reachability analysis
error bounds
lower bound
theorem prover
np hard
upper bound
average case
real time systems
theorem proving
high confidence
data sets
computational complexity
knowledge base
database
greedy algorithm
brute force
running times
databases