Mathias Andersen

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Verification of closed timed models by explicit state-space exploration methods is an alternative to the widespread symbolic techniques based on difference bound matrices (DBMs). A few experiments found in the literature confirm that for the reachability analysis of timed automata explicit techniques can compete with DBM-based algorithms, at least for(More)
  • 1