Symbolic Optimal Reachability in Weighted Timed Automata

CAV, 2016.

Cited by: 17|Bibtex|Views9|Links
EI

Abstract:

Weighted timed automata have been defined in the early 2000 s for modelling resource-consumption or -allocation problems in real-time systems. Optimal reachability is decidable in weighted timed automata, and a symbolic forward algorithm has been developed to solve that problem. This algorithm uses so-called priced zones, an extension of ...More

Code:

Data:

Your rating :
0

 

Tags
Comments