메뉴 건너뛰기




Volumn 2648, Issue , 2003, Pages 1-17

Optimal scheduling using branch and bound with SPIN 4.0

Author keywords

[No Author keywords available]

Indexed keywords

JOB SHOP SCHEDULING; OPTIMAL SYSTEMS; OPTIMIZATION; SCHEDULING; TRAVELING SALESMAN PROBLEM;

EID: 35248834656     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44829-2_1     Document Type: Article
Times cited : (34)

References (22)
  • 2
    • 84903129019 scopus 로고    scopus 로고
    • Efficient Guiding Towards Cost-Optimality in UPPAAL
    • T. Margaria and W. Yi, editors, Procs. of the 7th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), Genova, Italy, April Springer
    • G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, and J. Romijn. Efficient Guiding Towards Cost-Optimality in UPPAAL. In T. Margaria and W. Yi, editors, Procs. of the 7th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), volume 2031 of LNCS, pages 174-188, Genova, Italy, April 2001. Springer.
    • (2001) LNCS , vol.2031 , pp. 174-188
    • Behrmann, G.1    Fehnker, A.2    Hune, T.3    Larsen, K.4    Pettersson, P.5    Romijn, J.6
  • 6
    • 84894638887 scopus 로고    scopus 로고
    • Directed Explicit Model Checking with HSF-SPIN
    • M. B. Dwyer, editor, Model Checking Software, Procs. of the 8th Int. SPIN Workshop, Toronto, Canada, May Springer
    • S. Edelkamp, A. L. Lafuente, and S. Leue. Directed Explicit Model Checking with HSF-SPIN. In M. B. Dwyer, editor, Model Checking Software, Procs. of the 8th Int. SPIN Workshop, volume 2057 of LNCS, pages 57-79, Toronto, Canada, May 2001. Springer.
    • (2001) LNCS , vol.2057 , pp. 57-79
    • Edelkamp, S.1    Lafuente, A.L.2    Leue, S.3
  • 9
    • 35248884596 scopus 로고    scopus 로고
    • K. Havelund, J. Penix, and W. Visser, editors. SPIN Model Checking and Software Verification, Procs. of the 7th Int. SPIN Workshop (SPIN'2000), Stanford, California, USA, August Springer
    • K. Havelund, J. Penix, and W. Visser, editors. SPIN Model Checking and Software Verification, Procs. of the 7th Int. SPIN Workshop (SPIN'2000), volume 1885 of LNCS, Stanford, California, USA, August 2000. Springer.
    • (2000) LNCS , vol.1885
  • 14
    • 8644254552 scopus 로고    scopus 로고
    • On Nested Depth First Search
    • J.-C. Grégoire, G. J. Holzmann, and D. A. Peled, editors, The SPIN Verification System, Procs. of the 2nd Int. SPIN Workshop (SPIN'96), Rutgers University, New Jersey, USA, August AMS
    • G. J. Holzmann, D. Peled, and M. Yannakakis. On Nested Depth First Search. In J.-C. Grégoire, G. J. Holzmann, and D. A. Peled, editors, The SPIN Verification System, Procs. of the 2nd Int. SPIN Workshop (SPIN'96), volume 32 of DIMACS Series, Rutgers University, New Jersey, USA, August 1996. AMS.
    • (1996) DIMACS Series , vol.32
    • Holzmann, G.J.1    Peled, D.2    Yannakakis, M.3
  • 15
    • 0008287887 scopus 로고    scopus 로고
    • As Cheap As Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
    • G. Berry, H. Comon, and A. Finkel, editors, Procs. of the 13th Int. Conf. on Computer Aided Verification (CAV 2001), Paris, France, July Springer
    • K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As Cheap As Possible: Efficient 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.
    • (2001) LNCS , vol.2102 , pp. 493-505
    • Larsen, K.1    Behrmann, G.2    Brinksma, E.3    Fehnker, A.4    Hune, T.5    Pettersson, P.6    Romijn, J.7
  • 16
    • 33745172914 scopus 로고    scopus 로고
    • Princeton University, Mathematics Department.
    • Princeton University, Mathematics Department. Traveling Salesman Problem - Homepage, http://www.math.princeton.edu/tsp/.
    • Traveling Salesman Problem
  • 17
    • 21844527073 scopus 로고
    • The Travelling Salesman - Computational Solutions for TSP Applications
    • Springer
    • G. Reinelt. The Travelling Salesman - Computational Solutions for TSP Applications, volume 840 of LNCS. Springer, 1994.
    • (1994) LNCS , vol.840
    • Reinelt, G.1
  • 19
    • 0013451778 scopus 로고    scopus 로고
    • PhD thesis, University of Twente, Enschede, The Netherlands, March
    • T. C. Ruys. Towards Effective Model Checking. PhD thesis, University of Twente, Enschede, The Netherlands, March 2001. Available from the author's homepage.
    • (2001) Towards Effective Model Checking
    • Ruys, T.C.1
  • 20
    • 84947929060 scopus 로고    scopus 로고
    • Experience with Literate Programming in the Modelling and Validation of Systems
    • B. Steffen, editor, Procs. of the 4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), number 1384 Lisbon, Portugal, April
    • T. C. Ruys and E. Brinksma. Experience with Literate Programming in the Modelling and Validation of Systems. In B. Steffen, editor, Procs. of the 4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), number 1384 in LNCS, pages 393-408, Lisbon, Portugal, April 1998.
    • (1998) LNCS , pp. 393-408
    • Ruys, T.C.1    Brinksma, E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.