Efficient guiding towards cost-optimality in UPPAAL

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

Volumn 2031 LNCS, Issue , 2001, Pages 174-188

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

^a AALBORG UNIVERSITY   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^d UNIVERSITY OF TWENTE   (Netherlands)

^e UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; SEMANTICS; AUTOMATA THEORY; COMPUTATION THEORY; COSTS;

BRANCH-AND-BOUND ALGORITHMS; COST-OPTIMALITY; DIFFERENCE BOUND MATRICES; DIJKSTRA'S SHORTEST PATH ALGORITHM; NEAR-OPTIMAL SOLUTIONS; SYMBOLIC SEMANTICS; TIMED AUTOMATA; VERIFICATION TOOLS;

AUTOMATA THEORY; ALGORITHMS;

EID: 84903129019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_13     Document Type: Conference Paper

References (20)

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. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kro-nos: A Model-Checking Tool for Real-Time Systems. In Proc. of the 10th Int. Conf. on Computer Aided Verification, number 1427 in Lecture Notes in Computer Science, pages 546-550. Springer-Verlag, 1998.
3. G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. Accepted for Hybrid Systems: Computation and Control, 2001.
4. P. Brucker, B. Jurisch, and B. Sievers. Code of a Branch & Bound Algorithm for the Job Shop Problem. Available at url http://www.mathematik.uni- osnabrueck.de/research/OR/, 1995.
5. R. Boel and G. Stremersch. Report for VHS: Timed Petri Net Model of Steel Plant at SIDMAR. Technical report, SYSTeMS Group, University Ghent, 1999.
6. 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.
7. A. Fehnker. Bounding and heuristics in forward reachability algorithms. Technical Report CSI-R0002, Computing Science Institute Nijmegen, 1999.
8. 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.
9. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HYTECH: A Model Checker 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.
10. T. Hune, K. G. Larsen, and P. Pettersson. Guided synthesis of control programs using UPPAAL for VHS case study 5. VHS deliverable, 1999.
11. 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.
12. K. G. Larsen, P. Pettersson, and W. Yi. Diagnostic Model-Checking for Real-Time Systems. In Proc. of Workshop on Verification and Control of Hybrid Systems III, number 1066 in Lecture Notes in Computer Science, pages 575-586. Springer-Verlag, October 1995.
13. 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.
14. P. Niebert, S. Tripakis, and S. Yovine. Minimum-time reachability for timed automata. In IEEE Mediteranean Control Conference, 2000. Accepted for publication.
15. P. Niebert and S. Yovine. Computing optimal operation schemes for multi batch operation of chemical plants. VHS deliverable, May 1999. Draft.
16. 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 (TAGASJ98), number 1384 in Lecture Notes in Computer Science (LNCS), pages 393-408, Lisbon, Portugal, April 1998. Springer-Verlag, Berlin.
17. F. Reffel and S. Edelkamp. Error Detection with Directed Symbolic Model Checking. In Proc. of Formal Methods, volume 1708 of Lecture Notes in Computer Science, pages 195-211. Springer-Verlag, 1999.
18. T. G. Rokicki. Representing and Modeling Digital Circuits. PhD thesis, Stanford University, 1993.
19. M. Stobbe. Results on scheduling the sidmar steel plant using constraint programming. Internal report, 2000.
20. F. Vaandrager. Analysis of a biphase mark protocol with Uppaal. to appear, 2000.