As cheap as possible: Efficient cost-optimal reachability for priced timed automata

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

Volumn 2102, Issue , 2001, Pages 493-505

  Larsen, Kim ^a,b   Behrmann, Gerd ^a   Brinksma, Ed ^b   Fehnker, Ansgar ^d   Hune, Thomas ^c   Pettersson, Paul ^e   Romijn, Judi ^d  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c AARHUS UNIVERSITY   (Denmark)

^d RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^e UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; MACHINERY;

EFFICIENT COSTS; OPTIMAL COSTS; REACHABILITY; SYMBOLIC REACHABILITY; TIMED AUTOMATA;

COSTS;

EID: 0008287887     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_47     Document Type: Conference Paper

References (25)

1. D. Applegate and W. Cook. A Computational Study of the Job-Shop Scheduling Problem. OSRA Journal on Computing 3, pages 149-156, 1991.
2. P. Abdulla, K. Cerans, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems, 1996.
3. R. Alur and D. Dill. Automata for Modelling Real-Time Systems. In Proc. of Int. Colloquium on Algorithms, Languages and Programming,number 443 in Lecture Notes in Computer Science, pages 322-335, July 1990.
4. P. Abdulla and B. Jonsson. Undecidability of verifying programs with unreliable channels. In Proc. 21st Int. Coll. Automata, Languages, and Programming (ICALP'94), volume 820 of LNCS, 1994.
5. Alun, S., La Torre, and G. J. Pappas. Optimal paths in weighted timed automata. To appear in HSCC2001.
6. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: A Model-Checking Tool for Real-Time Systems. In Proc.ofthe 10th Int. Conf. on Computer Aided Verification, number 1427 in Lecture Notes in Computer Science, pages 546-550. Springer-Verlag, 1998.
7. Behrmann, A. Fehnker, T. Hune, K.G. Larsen, P. Pettersson, and J. Romijn. Efficient guiding towards cost-optimality in uppaal. To appear in Proceedings of TACAS'2001.
8. G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. To appear in Proceedings of HSCC2001, 2001.
9. J.E. Beasley, M. Krishnamoorthy, and D. Abramson. Scheduling Aircraft Landings-The Static Case. Transportation Science, 34(2):180-197, 2000.
10. Ed Brinksma and Angelika Mader. Verification and optimization of a pic control schedule. In Proceedings of the 7th SPIN Workshop, volume 1885 of Lecture Notes in Computer Science. Springer Verlag, 2000.
11. K. Cerans. Deciding properties of integral relational automata. In Proceedings of ICALP 94, volume 820 of LNCS, 1994.
12. D. Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. In J. Sifakis, editor, Proc. of Automatic Verification Methods for Finite State Systems, number 407 in Lecture Notes in Computer Science, pages 197-212. Springer-Verlag, 1989.
13. Jack J., Dongarra,. Performance of Various Computers Using Standard Linear Equations Software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, 2001. An up-to-date version of this report can be found at http://www.netlib.org/benchmark/performance.ps.
14. A. Fehnker. Scheduling a steel plant with timed automata. In Proceedings of the 6th International Conference on Real- Time Computing Systems and Applications (RTCSA99), pages 280-286. IEEE Computer Society, 1999.
15. A. Finkel and P. Schnoebelen. Fundamental structures in well-structured infinite transition systems. In Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN'98), volume 1380 of LNCS, 1998.
16. A. Finkel and Ph. Schnoebelen. Well structured transition systems every- where. Theoretical Computer Science, 256(1-2):64-92, 2001.
17. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech:A ModelChecker for Hybird Systems. In Orna Grumberg, editor, Proc. of the 9th Int. Conf. on Computer Aided Verification, number 1254 in Lecture Notes in Computer Science, pages 460-463. Springer-Verlag, 1997.
18. G. Higman. Ordering by divisibility in abstract algebras. Proc.ofthe London Math. Soc., 2:326-336, 1952.
19. T. Hune, K.G. Larsen, and P. Pettersson. Guided Synthesis of Control Programs Using uppaal. In Ten H. Lai, editor, Proc. of the IEEE ICDCS International Workshop on Distributed Systems Verification and Validation, pages E15-E22. IEEE Computer Society Press, April 2000.
20. Fredrik Larsson, Kim G. Larsen, Paul Pettersson, and Wang Yi. Efficient Veriication of Real-Time Systems: Compact Data Structures and State-Space Reduction. In Proc. of the 18th IEEE Real-Time Systems Symposium, pages 14-24. IEEE Computer Society Press, December 1997.
21. K. G. Larsen, P. Pettersson, and W. Yi. uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, October 1997.
22. R. Milner. Communication and Concurrency. Prentice Hall, Englewood Cliffs, 1989.
23. P. Niebert and S. Yovine. Computing optimal operation schemes for multi batch operation of chemical plants. VHS deliverable, May 1999. Draft.
24. T.C. Ruys and E. Brinksma. Experience with Literate Programming in the Modelling and Validation of Systems. In Bernhard Steffen, editor, Proceedings of the Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), number 1384 in Lecture Notes in Computer Science (LNCS), pages 393-408, Lisbon, Portugal, April 1998. Springer-Verlag, Berlin.
25. T.G. Rokicki. Representing and Modeling Digital Circuits. PhDthesis, Stanford University, 1993.