K. G. Larsen, G. Behrman, E. Brinksma, A. Fehnker, T. Hune, P. Petersson, and J. Romijn. As cheap as possible: Ecient cost-optimal reachability for priced timed automata. In Proc. of the 13th International Conference on Computer Aided Veri cation, CAV'01, LNCS, pages 493-505. Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Taxys = Esterel + Kronos - A tool for verifying.. - Bertin, Closse.. (Correct)
....guided by the knowledge of all the possible behaviors of the environment. In this case, we can use a model of the system, the environment and the requirements to build an application speci c scheduler. Several model based approaches to schedulability have been proposed in the literature, e.g. [19, 6, 16, 1, 17]. In fact, a scheduler can be regarded as a controller that prevents the system from performing undesired actions that can lead to the violation of a deadline. Thus, the construction of a scheduler from a model can theoretically be rephrased as a controller synthesis problem. One well known ....
K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: ecient cost-optimal reachability for priced timed automata. In CAV'01. LNCS 2102, Springer, 2001.
Synthesis of Optimal Strategies Using HYTECH - Bouyer, Cassez, Fleury, Larsen (2004) (1 citation) Self-citation (Larsen) (Correct)
No context found.
K.G. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: E#cient cost-optimal reachability for priced timed automata. In Proc. 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of Lecture Notes in Computer Science, pages 493--505. Springer, 2001.
Staying Alive As Cheaply As Possible - Bouyer, Brinksma, Larsen (2004) Self-citation (Larsen Brinksma) (Correct)
No context found.
Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Angskar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As cheap as possible: E#cient cost-optimal reachability for priced timed automata. In Proc. 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of Lecture Notes in Computer Science, pages 493--505. Springer, 2001.
Optimal Strategies in Priced Timed Game Automata - Bouyer, Cassez, Fleury, Larsen (2004) (1 citation) Self-citation (Larsen) (Correct)
No context found.
Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Angskar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As cheap as possible: E#cient cost-optimal reachability for priced timed automata. In Proc. 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of Lecture Notes in Computer Science, pages 493--505. Springer, 2001.
Analyzing Real-Time Systems: Theory and Tools - Hune (2001) Self-citation (Hune) (Correct)
....and Validation, pages E15 E22, 1998. 26] G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson and J. Romijn. Efficient Guiding Towards Cost Optimality in Uppaal. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2001, pages 174 188, [105] K. G. Larsen, G. Behrmann, E. Briksma, A. Fehnker, T. Hune, P. Pettersson and J. Romijn. As Cheap as Possible: E#cient Cost Optimal Reachability for Priced Timed Automata. To appear in Proceedings of Computer Aided Verification, 2001. 86] T. Hune, J. Romijn, M. Stoelinga and F. Vaandrager. ....
....guiding the exploration algorithm using priorities. E#cient Representation of Linear Cost The paper As Cheap as Possible: E#cient Cost Optimal Reachability for Priced Timed Automata presented in this chapter has not been published yet, but is accepted for Computer Aided Verification 2001. [105] K. G. Larsen, G. Behrmann, E. Briksma, A. Fehnker, T. Hune, P. Pettersson and J. Romijn. As Cheap as Possible: E#cient Cost Optimal Reachability for Priced Timed Automata. To appear in Proceedings of Computer Aided Verification, 2001. The content of this chapter is a slightly modified version of ....
K. G. Larsen, G. Behrmann, E. Briksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: E#cient cost-optimal reachability for priced timed automata. Accepted for CAV 2001.
UPPAAL - Present and Future - Behrmann, Larsen, Möller, al. (2001) (6 citations) Self-citation (Larsen Behrmann Pettersson) (Correct)
No context found.
Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As Cheap as Possible: Ecient Cost-Optimal Reachability for Priced Timed Automata. Submitted for publication., 2001.
UPPAAL - Now, Next, and Future - Amnell, Behrmann, Bengtsson.. Self-citation (Larsen Behrmann Fehnker Hune Pettersson) (Correct)
No context found.
Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As Cheap as Possible: Ecient Cost-Optimal Reachability for Priced Timed Automata. Submitted for publication, 2001.
UPPAAL - Present and Future - Behrmann, David, Larsen, Möller.. (2001) (6 citations) Self-citation (Larsen Behrmann Pettersson) (Correct)
No context found.
Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, and Judi Romijn. As Cheap as Possible: Ecient Cost-Optimal Reachability for Priced Timed Automata. Submitted for publication., 2001.
Optimal-Reachability and Control for Acyclic Weighted.. - Torre, Mukhopadhyay.. (2002) (3 citations) (Correct)
No context found.
K. G. Larsen, G. Behrman, E. Brinksma, A. Fehnker, T. Hune, P. Petersson, and J. Romijn. As cheap as possible: Ecient cost-optimal reachability for priced timed automata. In Proc. of the 13th International Conference on Computer Aided Veri cation, CAV'01, LNCS, pages 493-505. Springer, 2001.
Performance Analysis of Probabilistic Timed - Automata Using Digital (Correct)
No context found.
K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: Ecient cost-optimal reachability for priced timed automata. In Proc. CAV'01, volume 2102 of LNCS, pages 493-505. Springer, 2001.
Advanced Methods for Timed Systems - Ametist Proposal For (Correct)
No context found.
K.G. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T.S. Hune, P. Petterson, and J.M.T. Romijn. As cheap as possible: E#cient cost-optimal reachability for priced timed automata. In Proceedings CAV'01, 2001.
Performance Analysis of Probabilistic Timed - Automata Using Digital (Correct)
No context found.
K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: Ecient cost-optimal reachability for priced timed automata. In G. Berry, H. Comon, and A. Finkel, editors, Proc. 13th International Conference on Computer Aided Veri cation (CAV'01), volume 2102 of Lecture Notes in Computer Science, pages 493-505. SpringerVerlag, 2001.
Optimal Scheduling Using Branch and Bound with SPIN 4.0 - Ruys (2003) (2 citations) (Correct)
No context found.
K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As Cheap As Possible: E#cient Cost-Optimal Reachability for Priced Timed Automata. In G. Berry, H. Comon, and A. Finkel, editors, Procs. of the 13th Int. Conf. on Computer Aided Verification (CAV 2001), volume 2102 of LNCS, pages 493--505, Paris, France, July 2001. Springer.
Optimal-Reachability and Control for Acyclic Weighted.. - Torre, Mukhopadhyay.. (2002) (3 citations) (Correct)
No context found.
K. G. Larsen, G. Behrman, E. Brinksma, A. Fehnker, T. Hune, P. Petersson, and J. Romijn. As cheap as possible: Ecient cost-optimal reachability for priced timed automata. In Proc. of the 13th International Conference on Computer Aided Veri cation, CAV'01, LNCS, pages 493-505. Springer, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC