Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas
Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas
George J. Pappas
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n (|δ(A)|+|wmax|)), where n …
Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas
Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas
George J. Pappas
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n (|δ(A)|+|wmax|)), where n …
Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas
Optimal Paths In Weighted Timed Automata, Rajeev Alur, Salvatore La Torre, George J. Pappas
George J. Pappas
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n (|δ(A)|+|wmax|)), where n …