{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:05:16Z","timestamp":1725573916162},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540216711"},{"type":"electronic","value":"9783540409038"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-40903-8_3","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T15:37:38Z","timestamp":1294414658000},"page":"18-33","source":"Crossref","is-referenced-by-count":2,"title":["Checking ACTL *\u00a0Properties of Discrete Timed Automata via Bounded Model Checking"],"prefix":"10.1007","author":[{"given":"Bo\u017cena","family":"Wo\u017ana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Zbrzezny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.: Model checking in dense real-time. Information and Computation\u00a0104(1), 2\u201334 (1993)","journal-title":"Information and Computation"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Audemard, G., Cimatti, A., Kornilowicz, A., Sebastiani, R.: Bounded model checking for timed systems. In: Proc. of RT-TOOLS 2002 (2002)","DOI":"10.1007\/3-540-36135-9_16"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-36577-X_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Benedetti","year":"2003","unstructured":"Benedetti, M., Cimatti, A.: Bounded Model checking for Past LTL. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 18\u201333. Springer, Heidelberg (2003)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J. Bengtsson","year":"1998","unstructured":"Bengtsson, J., Jonsson, B., Lilius, J., Yi, W.: Partial order reductions for timed systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 485\u2013500. Springer, Heidelberg (1998)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-45251-6_18","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity","author":"D. Beyer","year":"2001","unstructured":"Beyer, D.: Improvements in BDD-based reachability analysis of Timed Automata. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol.\u00a02021, p. 318. Springer, Heidelberg (2001)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Proc. of DAC 1999 (1999)","DOI":"10.21236\/ADA360973"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, p. 193. Springer, Heidelberg (1999)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-48153-2_11","volume-title":"Correct Hardware Design and Verification Methods","author":"M. Bozga","year":"1999","unstructured":"Bozga, M., Maler, O., Tripakis, S.: Efficient verification of Timed Automata using dense and discrete time semantics. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 125\u2013141. Springer, Heidelberg (1999)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E. Clarke","year":"2001","unstructured":"Clarke, E., 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":"3_CR10","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"3_CR11","volume-title":"Proceedings of PROCOMET 1994","author":"D. Dams","year":"1994","unstructured":"Dams, D., Grumberg, O., Gerth, R.: Abstract interpretation of reactive systems: Abstractions preserving ACTL*, ECTL* and CTL*. In: Proceedings of PROCOMET 1994, Elsevier Science Publishers, Amsterdam (1994)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C. Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, p. 313. Springer, Heidelberg (1998)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-36577-X_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P. Dembi\u0144ski","year":"2003","unstructured":"Dembi\u0144ski, P., Janowska, A., Janowski, P., Penczek, W., P\u00f3\u0142rola, A., Szreter, M., Wo\u017ana, B., Zbrzezny, A.: $\\surd$ erics: A tool for verifying timed automata and estelle specifications. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 278\u2013283. Springer, Heidelberg (2003)"},{"key":"3_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-45620-1_35","volume-title":"Automated Deduction - CADE-18","author":"L. Moura de","year":"2002","unstructured":"de Moura, L., Rue\u00df, H., Sorea, M.: Lazy theorem proving for bounded model checking over infinite domains. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, p. 438. Springer, Heidelberg (2002)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1995","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Formal Methods in System Design\u00a09, 105\u2013131 (1995)","journal-title":"Formal Methods in System Design"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201991","author":"O. Grumberg","year":"1991","unstructured":"Grumberg, O., Long, D.E.: Model checking and modular verification. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, Springer, Heidelberg (1991)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-44685-0_15","volume-title":"CONCUR 2001 - Concurrency Theory","author":"K. Heljanko","year":"2001","unstructured":"Heljanko, K.: Bounded reachability checking with process semantics. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, p. 218. Springer, Heidelberg (2001)"},{"key":"3_CR18","series-title":"Lecture Notes in Artificial Intelligence","first-page":"200","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"K. Heljanko","year":"2001","unstructured":"Heljanko, K., Niemel\u00e4, I.: Bounded LTL model checking with stable models. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, p. 200. Springer, Heidelberg (2001)"},{"key":"3_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking: An Approach to the State Explosion Problem","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, Dordrecht (1993)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45739-9_15","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"P. Niebert","year":"2002","unstructured":"Niebert, P., Mahfoudh, M., Asarin, E., Bozga, M., Maler, O., Jain, N.: Verification of Timed Automata via Satisfiability Checking. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, p. 225. Springer, Heidelberg (2002)"},{"key":"3_CR21","series-title":"ACM\/AMS DIMACS Series","volume-title":"Proc. of POMIV 1996","author":"D. Peled","year":"1996","unstructured":"Peled, D.: Partial order reduction: Linear and branching temporal logics and process algebras. In: Proc. of POMIV 1996. ACM\/AMS DIMACS Series, vol.\u00a029, Amer. Math. Soc., Providence (1996)"},{"key":"3_CR22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-2000-43123413","volume":"43","author":"W. Penczek","year":"2000","unstructured":"Penczek, W., Szreter, M., Gerth, R., Kuiper, R.: Improving partial order reductions for universal branching time properties. Fundamenta Informaticae\u00a043, 245\u2013267 (2000)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"3_CR23","first-page":"135","volume":"51","author":"W. Penczek","year":"2002","unstructured":"Penczek, W., Wo\u017ana, B., Zbrzezny, A.: Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae\u00a051(1-2), 135\u2013156 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Penczek, W., Wo\u017ana, B., Zbrzezny, A.: SAT-Based Bounded Model Checking for the Universal Fragment of TCTL. Technical Report 947, ICS PAS (2002)","DOI":"10.1007\/3-540-45739-9_17"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-45739-9_17","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"W. Penczek","year":"2002","unstructured":"Penczek, W., Wo\u017ana, B., Zbrzezny, A.: Towards bounded model checking for the universal fragment of TCTL. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, p. 265. Springer, Heidelberg (2002)"},{"key":"3_CR26","series-title":"ENTCS","volume-title":"Proc. of MTCS 2002","author":"M. Sorea","year":"2002","unstructured":"Sorea, M.: Bounded model checking for timed automata. In: Proc. of MTCS 2002. ENTCS, vol.\u00a068(5), Elsevier Science Publishers, Amsterdam (2002)"},{"issue":"1","key":"3_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1008734703554","volume":"18","author":"S. Tripakis","year":"2001","unstructured":"Tripakis, S., Yovine, S.: Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design\u00a018(1), 25\u201368 (2001)","journal-title":"Formal Methods in System Design"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR\u201993","author":"P. Wolper","year":"1993","unstructured":"Wolper, P., Godefroid, P.: Partial-order methods for temporal verification. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, Springer, Heidelberg (1993)"},{"key":"3_CR29","unstructured":"Wo\u017ana, B., Penczek, W., Zbrzezny, A.: Reachability for timed systems based on SAT-solvers. In: Proc. of CS&P 2002. Informatik-Berichte Nr 161, vol. II. Humboldt University (2002)"},{"key":"3_CR30","unstructured":"Wo\u017ana, B., Zbrzezny, A.: Reaching the limits for Bounded Model Checking. Technical Report 958, ICS PAS (2003)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40903-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T11:03:31Z","timestamp":1592219011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40903-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540216711","9783540409038"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40903-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}