Staying alive as cheaply as possible

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2993, Issue , 2004, Pages 203-218

  Bouyer, Patricia ^a   Brinksma, Ed ^b   Larsen, Kim G ^c  

^a CNRS   (France)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; HYBRID SYSTEMS;

ABSTRACTION TECHNIQUES; CORNER POINT; FINITE GRAPHS; OPTIMAL SCHEDULE; OPTIMALITY CRITERIA; PRECISE DEFINITION; TIMED AUTOMATA; TIMED AUTOMATA MODELS;

AUTOMATA THEORY;

EID: 35048890189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24743-2_14     Document Type: Article

References (25)

1. [AC91] D. Applegate and W. Cook. A Computational Study of the Job-Shop Scheduling Problem. OSRA Journal on Computing, vol. 3:pp. 149-156, 1991.
2. [AD90] R. Alur and D. Dill. Automata for Modeling Real-Tune Systems. In Proc. 17th Int. Coll. Automata, Languages and Programming (ICALP'90), vol. 443 of LNCS, pp. 322-335. Springer, 1990.
3. [AD94] R. Alur and D. Dill. A Theory of Timed Automata. Theoretical Computer Science (TCS), vol. 126(2):pp. 183-235, 1994.
4. [ALTP01] R. Alur, S. La Torre, and G. J. Pappas. Optimal Patlis in Weighted Timed Automata. In Proc. 4th Int. Work. Hybrid Systems: Computation and Control (HSCC'01), vol. 2034 of LNCS, pp. 49-62. Springer, 2001.
5. [AM99] E. Asarin and O. Maler. As Soon as Possible: Tune Optimal Control for Timed Automata. In Proc. 2nd Int. Work. Hybrid Systems: Computation and Control (HSCC'99), vol. 1569 of LNCS, pp. 19-30. Springer, 1999.
6. [AM01] Y. Abdeddaim and O. Maler. Job-Shop Scheduling using Tuned Automata. In Proc. 13th Int. Conf. Computer Aided Verification (CAV'01), vol. 2102 of LNCS, pp. 478-492. Springer, 2001.
7. [AM02] Y. Abdeddaïm and O. Maler. Preemptive Job-Shop Scheduling using Stopwatch Automata. In Proc. 8th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), vol. 2280 of LNCS, pp. 113-126. Springer, 2002.
8. [BBL04] P. Bouyer, E. Brinksma, and K. G. Larsen. Staying Alive as Cheaply as Possible. Research Report LSV-04-2, LSV, ENS de Cachan, France, 2004.
9. [BFH+01a] G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Efficient Guiding Towards Cost-Optimality in UPPAAL. In Proc. 7th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), vol. 2031 of LNCS, pp. 174-188. Springer, 2001.
10. [BFH+01b] G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. In Proc. 4th Int. Work. Hybrid Systems: Computation and Control (HSCC'01), vol. 2034 of LNCS, pp. 147-161. Springer, 2001.
11. [BLL+98] J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, W. Yi, and C. Weise. New Generation of UPPAL. In Proc. Int. Work. Software Tools for Technology Transfer (STTT'98), BRICS Notes Series, pp. 43-52. 1998.
12. [BMF02] E. Brinksma, A. Mader, and A. Fehnker. Verification and Optimization of a PLC Control Schedule. Journal of Software Tools for Technology Transfer (STTT), vol. 4(1):pp. 21-33, 2002.
13. [DG98] A. Dasdan and R. K. Gupta. Faster Maximum and Minimum Mean Cycle Algorithms for System Performance Analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 17(10):pp. 889-899, 1998.
14. [DIG99] A. Dasdan, S. Irani, and R. K. Gupta. Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems. In Proc. 36th ACM/IEEE Design Automation Conf. (DAC'99), pp. 47-42. ACM, 1999.
15. [DJJL01] P. R. D'Argenio, B. Jeannet, H. E. Jensen, and K. G. Larsen. Reachability Analysis of Probabilistic Systems by Successive Refinements. In Proc. Ist Int. Work. Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV'01), vol. 2165 of LNCS, pp. 39-56. Springer, 2001.
16. [DJJL02] P. R. D'Argenio, B. Jeannet, H. E. Jensen, and K. G. Larsen. Reduction and Refinement Strategies for Probabilistic Analysis. In Proc. 2nd Int. Work. Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV'02), vol. 2399 of LNCS, pp. 57-76. Springer, 2002.
17. [Feh99] A. Fehnker. Scheduling a Steel Plant with Timed Automata. In Proc. 6th Int. Conf. Real-Time Computing Systems and Applications (RTCS A'99), pp. 280-286. IEEE Computer Society Press, 1999.
18. [HLP00] T. Hune, K. G. Larsen, and P. Pettersson. Guided Synthesis of Control Programs Using UPPAAL. In Proc. IEEE ICDS Int. Work. Distributed Systems Verification and Validation, pp. E15-E22. IEEE Computer Society Press, 2000.
19. [Kar78] R. M. Karp. A Characterization of the Minimum Mean-Cycle in a Digraph. Discrete Mathematics, vol. 23(3):pp. 309-311, 1978.
20. [LBB+01] K. G. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Tuned Automata. In Proc. 13th Int. Conf. Computer Aided Verification (CAV'01), vol. 2102 of LNCS, pp. 493-505. Springer, 2001.
21. [LPY97] K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer (STTT), vol. 1(1-2):pp. 134-152, 1997.
22. [LTMM02] S. La Torre, S. Mukhopadhyay, and A. Murano. Optimal-Reachability and Control for Acyclic Weighted Timed Automata. In Proc. 2nd IFIP Int. Conf. Theoretical Computer Science (TCS 2002), vol. 223 of IFIP Conf. Proc., pp. 485-497. Kluwer, 2002.
23. [Mad03] A. Mader. Deriving Schedules for a Smart Card Personalisation System, 2003. Submitted.
24. [NY01] P. Niebert and S. Yovine. Computing Efficient Operations Schemes for Chemical Plants in Multi-batch Mode. European Journal of Control, vol. 7(4):pp. 440-453, 2001.
25. [ZP96] U. Zwick and M. Paterson. The Complexity of Mean Payoff Games on Graphs. Theoretical Computer Science (TCS), vol. 158(1-2):pp. 343-359, 1996.