{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T04:26:19Z","timestamp":1744604779296},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677703"},{"type":"electronic","value":"9783540450474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722167_32","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T22:00:33Z","timestamp":1167429633000},"page":"419-434","source":"Crossref","is-referenced-by-count":43,"title":["Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems"],"prefix":"10.1007","author":[{"given":"Aurore","family":"Annichini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene","family":"Asarin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Bouajjani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-49059-0_15","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"P. Abdulla","year":"1999","unstructured":"Abdulla, P., Annichini, A., Bouajjani, A.: Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, p. 208. Springer, Heidelberg (1999)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-48683-6_15","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"1999","unstructured":"Abdulla, P.A., Annichini, A., Bensalem, S., Bouajjani, A., Lakhnech, Y., Habermehl, P.: Verification of infinite-state systems by combining abstraction and reachability analysis. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 146\u2013159. Springer, Heidelberg (1999)"},{"key":"32_CR3","volume-title":"RTSS 1992","author":"R. Alur","year":"1992","unstructured":"Alur, R., Courcoubetis, C., Dill, D., Halbwachs, N., Wong-Toi, H.: An implementation of three algorithms for timing verification based on au-tomata emptiness. In: RTSS 1992. IEEE, Los Alamitos (1992)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.: A Theory of Timed Automata. TCS\u00a0126 (1994)","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"32_CR5","first-page":"592","volume-title":"Proceedings of the 25th Annual Symposium on Theory of Computing","author":"R. Alur","year":"1993","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Proceedings of the 25th Annual Symposium on Theory of Computing, pp. 592\u2013601. ACM Press, New York (1993)"},{"key":"32_CR6","volume-title":"Proc. of the Intern. Symp. on Software Testing and Analysis","author":"T. Bultan","year":"1998","unstructured":"Bultan, T., Gerber, R., League, C.: Verifying systems with integer constraints and Boolean predicates: A composite approach. In: Proc. of the Intern. Symp. on Software Testing and Analysis. ACM Press, New York (1998)"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"T. Bultan","year":"1997","unstructured":"Bultan, T., Gerber, R., Pugh, W.: Symbolic model checking of infinite state systems using Presburger arithmetic. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, Springer, Heidelberg (1997)"},{"key":"32_CR8","unstructured":"Bultan, T., Gerber, R., Pugh, W.: Model checking con- current systems with unbounded integer variables: Symbolic representations, approximations and experimental results. Tech. Rep. CS-TR-3870, University of Maryland, College Park (1998)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/3-540-58179-0_43","volume-title":"Computer Aided Verification","author":"B. Boigelot","year":"1994","unstructured":"Boigelot, B., Wolper, P.: Symbolic Verification with Periodic Sets. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 55\u201367. Springer, Heidelberg (1994)"},{"key":"32_CR10","volume-title":"IFIP Conf. on Formal Description of Programming Concepts","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Static Determination of Dynamic Properties of Recursive Procedures. In: IFIP Conf. on Formal Description of Programming Concepts. North-Holland Pub., Amsterdam (1977)"},{"key":"32_CR11","volume-title":"POPL 1978","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL 1978. ACM, New York (1978)"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028751","volume-title":"Computer Aided Verification","author":"H. Comon","year":"1998","unstructured":"Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and presburger arithmetic. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427. Springer, Heidelberg (1998)"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D. Dill","year":"1990","unstructured":"Dill, D.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407. Springer, Heidelberg (1990)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P. D\u2019Argenio","year":"1997","unstructured":"D\u2019Argenio, P., Katoen, J.-P., Ruys, T., Tretmans, G.J.: The Bounded Retransmission Protocol must be on Time. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, Springer, Heidelberg (1997)"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020947","volume-title":"Hybrid Systems III","author":"C. Daws","year":"1996","unstructured":"Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The Tool KRONOS. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol.\u00a01066. Springer, Heidelberg (1996)"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/261320.261324","volume":"31","author":"A. Dolzmann","year":"1997","unstructured":"Dolzmann, A., Sturm, T.: Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin\u00a031(2), 2\u20139 (1997)","journal-title":"ACM SIGSAM Bulletin"},{"issue":"3","key":"32_CR17","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/A:1006031329384","volume":"21","author":"A. Dolzmann","year":"1998","unstructured":"Dolzmann, A., Sturm, T., Weispfenning, V.: A new approach for automatic theorem proving in real geometry. Automated Reasoning\u00a021(3), 357\u2013380 (1998)","journal-title":"Automated Reasoning"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"J.-C. Fernandez","year":"1996","unstructured":"Fernandez, J.-C., Garavel, H., Kerbrat, A., Mateescu, R., Mounier, L., Sighireanu, M.: CADP: A Protocol Validation and Verification Toolbox. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102. Springer, Heidelberg (1996)"},{"key":"32_CR19","series-title":"Electronical Notes in Theoretical Computer Science","volume-title":"Infinity 1997","author":"L. Fribourg","year":"1997","unstructured":"Fribourg, L., Olsen, H.: Reachability sets of parametrized rings as regular languages. In: Infinity 1997. Electronical Notes in Theoretical Computer Science, vol.\u00a09. Elsevier Science, Amsterdam (1997)"},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014338","volume-title":"Algebraic Methodology and Software Technology","author":"J.-F. Groote","year":"1996","unstructured":"Groote, J.-F., Van de Pol, J.: A Bounded Retransmission Protocol for Large Data Packets. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol.\u00a01101. Springer, Heidelberg (1996)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"N. Halbwachs","year":"1993","unstructured":"Halbwachs, N.: Delay Analysis in Synchronous Programs. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697. Springer, Heidelberg (1993)"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Henzinger","year":"1995","unstructured":"Henzinger, T., Ho, P.H., Wong-Toi, H.: A User Guide to HyTech. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019, Springer, Heidelberg (1995)"},{"key":"32_CR23","volume-title":"LICS 1992","author":"T.A. Henzinger","year":"1992","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model- Checking for Real-Time Systems. In: LICS 1992. IEEE, Los Alamitos (1992)"},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Types for Proofs and Programs","author":"L. Helmink","year":"1994","unstructured":"Helmink, L., Sellink, M.P.A., Vaandrager, F.: Proof checking a Data Link Protocol. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol.\u00a0806. Springer, Heidelberg (1994)"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"K. Larsen","year":"1999","unstructured":"Larsen, K., Pearson, J., Weise, C., Yi, W.: Efficient timed reachability analysis using clock difference diagrams. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633. Springer, Heidelberg (1999)"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL: Status and Developments. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254. Springer, Heidelberg (1997)","DOI":"10.1007\/3-540-63166-6_47"},{"key":"32_CR27","unstructured":"Mateescu, R.: Formal Description and Analysis of a Bounded Retransmission Protocol. Technical report no. 2965, INRIA (1996)"},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"Moller, J., Lichtenberg, J., Andersen, H.R., Hulgaard, H.: Difference decision diagrams. Tech. rep it-tr-1999-023, Department of Information Technology, Technical University of Denmark (1999)","DOI":"10.1007\/3-540-48168-0_9"},{"key":"32_CR29","unstructured":"Valmari, A.: State generation with induction. In: Scandinavian Conference on Artificial Intelligence (1989)"},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Yovine, S.: Model-checking timed automata. In: Embedded Systems. LNCS (1998)","DOI":"10.1007\/3-540-65193-4_20"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10722167_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:49:14Z","timestamp":1556005754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722167_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677703","9783540450474"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/10722167_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}