Login / Signup

Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata.

Pavel KrcálWang Yi
Published in: TACAS (2004)
Keyphrases
  • np complete
  • learning algorithm
  • data analysis
  • timed automata
  • real time
  • data sets
  • data model
  • special case
  • distributed systems
  • sufficient conditions
  • first order logic
  • decision problems