Optimal conditional reachability for multi-priced timed automata
From MaRDI portal
Recommendations
- Optimal reachability for multi-priced timed automata
- Revisiting decidability and optimum reachability for multi-priced timed automata
- Minimum-cost reachability for priced timed automata
- As cheap as possible: Efficient cost-optimal reachability for priced timed automata
- On the optimal reachability problem of weighted timed automata
Cited in
(18)- Costs and rewards in priced timed automata
- Optimal reachability for multi-priced timed automata
- On model-checking timed automata with stopwatch observers
- The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- Concavely-Priced Probabilistic Timed Automata
- Weight assignment logic
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Concavely-Priced Timed Automata
- Model checking logic WCTL with multi constrained modalities on one clock priced timed automata
- Revisiting decidability and optimum reachability for multi-priced timed automata
- As cheap as possible: Efficient cost-optimal reachability for priced timed automata
- Minimum-cost reachability for priced timed automata
- Costs and rewards in priced timed automata
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- A Kleene-Schützenberger theorem for weighted timed automata
- Extended beam search for non-exhaustive state space analysis
- Multi-weighted reachability games
This page was built for publication: Optimal conditional reachability for multi-priced timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705878)