{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:31:12Z","timestamp":1736400672179,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_16","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"171-180","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing Chain Programs over Difference Constraints"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Argentieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994) Fundamental Study","journal-title":"Theoretical Computer Science"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Armando, A., Castellini, C., Giunchiglia, E.: Sat-based procedures for temporal reasoning. In: ECP, pp. 97\u2013108 (1999)","DOI":"10.1007\/10720246_8"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: SFM, pp. 200\u2013236 (2004)","DOI":"10.1007\/978-3-540-30080-9_7"},{"key":"16_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03612-9","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"1998","unstructured":"Brucker, P.: Scheduling Algorithms, 2nd edn. Springer, Heidelberg (1998)","edition":"2"},{"key":"16_CR5","series-title":"IFIP Transactions A: Computer Science and Technology","first-page":"163","volume-title":"Proceedings of the 11th International Conference on Computer Hardware Description Languages and their Applications (CHDL 1993)","author":"E.M. Clarke","year":"1993","unstructured":"Clarke, E.M.: Automatic verification of sequential circuit designs. In: Agnew, D., Claesen, L., Camposano, R. (eds.) Proceedings of the 11th International Conference on Computer Hardware Description Languages and their Applications (CHDL 1993). IFIP Transactions A: Computer Science and Technology, vol.\u00a032, pp. 163\u2013166. North-Holland, Amsterdam (1993)"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E.M. Clarke","year":"2001","unstructured":"Clarke, E.M., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design\u00a019(1), 7\u201334 (2001)","journal-title":"Formal Methods in System Design"},{"key":"16_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1992","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill Book Company, Boston (1992)","edition":"2"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence\u00a049, 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"issue":"6","key":"16_CR9","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1145\/1039488.1039492","volume":"51","author":"C. Demtrescu","year":"2004","unstructured":"Demtrescu, C.: A new approach to dynamic all pairs shortest paths. Journal of the ACM\u00a051(6), 968\u2013992 (2004)","journal-title":"Journal of the ACM"},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/12.372041","volume":"44","author":"R. Gerber","year":"1995","unstructured":"Gerber, R., Pugh, W., Saksena, M.: Parametric dispatching of hard real-time tasks. IEEE Trans. Computers\u00a044(3), 471\u2013479 (1995)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"A.V. Goldberg","year":"1995","unstructured":"Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM Journal on Computing\u00a024(3), 494\u2013504 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0190(92)90091-9","volume":"12","author":"C.C. Han","year":"1992","unstructured":"Han, C.C., Lin, K.J.: Scheduling real-time computations with separation constraints. Information Processing Letters\u00a012, 61\u201366 (1992)","journal-title":"Information Processing Letters"},{"key":"16_CR13","volume-title":"Linear Programming","author":"J.P. Ignizio","year":"1993","unstructured":"Ignizio, J.P., Cavalier, T.P.: Linear Programming. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"16_CR14","unstructured":"Larsen, K.G., Steffen, B., Weise, C.: Continuous modelling of real time and hybrid systems. Technical report, Aalborg Universitet, BRICS Technical Report (2003)"},{"key":"16_CR15","unstructured":"M\u00f8ller, J., Lichternberg, J., Andersen, H.R., Hulgaard, H.: On the symbolic verification of timed systems. Technical report, Technical University of Denmark (2003)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"M\u00f8ller, J.B., Lichtenberg, J., Andersen, H.R., Hulgaard, H.: Difference decision diagrams. In: CSL, pp. 111\u2013125 (1999)","DOI":"10.1007\/3-540-48168-0_9"},{"key":"16_CR17","unstructured":"M\u00f8ller, J.B., Lichtenberg, J., Andersen, H.R., Hulgaard, H.: Fully symbolic model checking of timed systems using difference decision diagrams. Electr. Notes Theor. Comput. Sci.vol\u00a023(2) (1999)"},{"key":"16_CR18","unstructured":"Muscettola, N., Smith, B., Chien, S., Fry, C., Rabideau, G., Rajan, K., Yan, D.: Inboard planning for autonomous spacecraft. In: The Fourth International Symposium on Artificial Intelligence, Robotics, and Automation for Space (i-SAIRAS) (July 1997)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Muscettola, N., Morris, P., Pell, B., Smith, B.: Issues in temporal reasoning for autonomous control systems. In: The Second International Conference on Autonomous Agents, Minneapolis, MI (1998)","DOI":"10.1145\/280765.280862"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Pallottino. S., Scutellam, M.G.: Dual algorithms for the shortest path tree problem. Networks: An International Journal 29 (1997)","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<125::AID-NET7>3.0.CO;2-L"},{"key":"16_CR21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230140206","volume":"14","author":"S. Pallottino","year":"1984","unstructured":"Pallottino, S.: Shortest path methods: Complexity, interrelations and new propositions. Networks: An International Journal\u00a014, 257\u2013267 (1984)","journal-title":"Networks: An International Journal"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BF01585517","volume":"7","author":"U. Pape","year":"1974","unstructured":"Pape, U.: Implementation and efficiency of moore algorithms for the shortest root problem. Mathematical Programming\u00a07, 212\u2013222 (1974)","journal-title":"Mathematical Programming"},{"key":"16_CR23","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs (1995)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-24730-2_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.I. Rasmussen","year":"2004","unstructured":"Rasmussen, J.I., Larsen, K.G., Subramani, K.: Resource-optimal scheduling using priced timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 220\u2013235. Springer, Heidelberg (2004)"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Strichman, O., Seshia, S.A., Bryant, R.E.: Deciding separation formulas with sat. In: CAV, pp. 209\u2013222 (2002)","DOI":"10.1007\/3-540-45657-0_16"},{"issue":"2","key":"16_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10951-005-6367-2","volume":"8","author":"K. Subramani","year":"2005","unstructured":"Subramani, K.: An analysis of totally clairvoyant scheduling. Journal of Scheduling\u00a08(2), 113\u2013133 (2005)","journal-title":"Journal of Scheduling"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11561354_27","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"K. Subramani","year":"2005","unstructured":"Subramani, K.: Stressing is better than relaxing for negative cost cycle detection in networks. In: Syrotiuk, V.R., Ch\u00e1vez, E. (eds.) ADHOC-NOW 2005. LNCS, vol.\u00a03738, pp. 320\u2013333. Springer, Heidelberg (2005)"},{"issue":"4","key":"16_CR28","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.future.2004.09.001","volume":"21","author":"K. Subramani","year":"2005","unstructured":"Subramani, K., Kovalchick, L.: A greedy strategy for detecting negative cost cycles in networks. Future Generation Computer Systems\u00a021(4), 607\u2013623 (2005)","journal-title":"Future Generation Computer Systems"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Wall, A., Sandstr\u00f6m, K., M\u00e4ki-Turja, J., Norstr\u00f6m, C., Yi, W.: Verifying temporal constraints on data in multi-rate transactions using timed automata. In: RTCSA, pp. 263\u2013270 (2000)","DOI":"10.1109\/RTCSA.2000.896400"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:19:26Z","timestamp":1736367566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11750321_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}