{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:01Z","timestamp":1725745261761},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642407246"},{"type":"electronic","value":"9783642407253"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40725-3_26","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T03:09:51Z","timestamp":1376881791000},"page":"337-349","source":"Crossref","is-referenced-by-count":1,"title":["SAT-Based Bounded Model Checking for RTECTL and Simply-Timed Systems"],"prefix":"10.1007","author":[{"given":"Bo\u017cena","family":"Wo\u017ana-Szcze\u015bniak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnieszka","family":"Zbrzezny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Zbrzezny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/3-540-48683-6_3","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1999","unstructured":"Alur, R.: Timed automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 8\u201322. Springer, Heidelberg (1999)"},{"issue":"1","key":"26_CR2","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":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G. Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 200\u2013236. Springer, Heidelberg (2004)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Berthomieu, B., Vernadat, F.: Time petri nets analysis with tina. In: Proceedings of QEST 2006, pp. 123\u2013124. IEEE Computer Society (2006)","DOI":"10.1002\/9780470611647.ch5"},{"key":"26_CR5","unstructured":"Beyer, D.: Rabbit: Verification of real-time systems. In: Proceedings of the Workshop on Real-Time Tools (RT-TOOLS 2001), pp. 13\u201321 (2001)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cabodi, G., Camurati, P., Quer, S.: Can BDDs compete with SAT solvers on bounded model checking? In: Proceedings of DAC 2002, pp. 117\u2013122. ACM (2002)","DOI":"10.1109\/DAC.2002.1012605"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/s100090050033","volume":"2","author":"S. Campos","year":"1999","unstructured":"Campos, S., Clarke, E.: Analysis and verification of real-time systems using quantitative symbolic algorithms. International Journal on Software Tools for Technology Transfer\u00a02(3), 260\u2013269 (1999)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"1","key":"26_CR8","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":"26_CR9","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85762-4_9","volume-title":"Theoretical Aspects of Computing - ICTAC 2008","author":"C.A. Furia","year":"2008","unstructured":"Furia, C.A., Spoletini, P.: Tomorrow and all our yesterdays: MTL satisfiability over the integers. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol.\u00a05160, pp. 126\u2013140. Springer, Heidelberg (2008)"},{"issue":"1-4","key":"26_CR11","first-page":"313","volume":"85","author":"M. Kacprzak","year":"2008","unstructured":"Kacprzak, M., Nabialek, W., Niewiadomski, A., Penczek, W., P\u00f3lrola, A., Szreter, M., Wo\u017ana, B., Zbrzezny, A.: VerICS 2007 - a model checker for knowledge and real-time. Fundamenta Informaticae\u00a085(1-4), 313\u2013328 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-30206-3_9","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"N. Markey","year":"2004","unstructured":"Markey, N., Schnoebelen, P.: Symbolic model checking for simply-timed systems. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 102\u2013117. Springer, Heidelberg (2004)"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-642-30947-2_56","volume-title":"Agent and Multi-Agent Systems. Technologies and Applications","author":"A. M\u0119ski","year":"2012","unstructured":"M\u0119ski, A., et al.: Two approaches to bounded model checking for linear time logic with knowledge. In: Jezic, G., et al. (eds.) KES-AMSTA 2012. LNCS, vol.\u00a07327, pp. 514\u2013523. Springer, Heidelberg (2012)"},{"issue":"9","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TCOM.1976.1093424","volume":"24","author":"P. Merlin","year":"1976","unstructured":"Merlin, P., Farber, D.J.: Recoverability of communication protocols - implication of a theoretical study. IEEE Transaction on Communications\u00a024(9), 1036\u20131043 (1976)","journal-title":"IEEE Transaction on Communications"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: On model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"issue":"1-2","key":"26_CR16","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":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/978-3-642-05089-3_47","volume-title":"FM 2009: Formal Methods","author":"M. Pradella","year":"2009","unstructured":"Pradella, M., Morzenti, A., San Pietro, P.: A metric encoding for bounded model checking. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 741\u2013756. Springer, Heidelberg (2009)"},{"key":"26_CR18","volume-title":"Super Strategies for Puzzles and Games","author":"X. Saul","year":"1981","unstructured":"Saul, X., Levmore, E.E.C.: Super Strategies for Puzzles and Games. Doubleday, Garden City (1981)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-28038-2_13","volume-title":"Advances in Software Engineering Techniques","author":"B. Wo\u017ana-Szcze\u015bniak","year":"2012","unstructured":"Wo\u017ana-Szcze\u015bniak, B.: Bounded model checking for the existential part of real-time CTL and knowledge. In: Szmuc, T., Szpyrka, M., Zendulka, J. (eds.) CEE-SET 2009. LNCS, vol.\u00a07054, pp. 164\u2013178. Springer, Heidelberg (2012)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-37890-4_10","volume-title":"Declarative Agent Languages and Technologies X","author":"B. Wo\u017ana-Szcze\u015bniak","year":"2013","unstructured":"Wo\u017ana-Szcze\u015bniak, B., Zbrzezny, A.: SAT-Based BMC for Deontic Metric Temporal Logic and Deontic Interleaved Interpreted Systems. In: Baldoni, M., Dennis, L., Mascardi, V., Vasconcelos, W. (eds.) DALT 2012. LNCS, vol.\u00a07784, pp. 170\u2013189. Springer, Heidelberg (2013)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-642-24769-9_40","volume-title":"Progress in Artificial Intelligence","author":"B. Wo\u017ana-Szcze\u015bniak","year":"2011","unstructured":"Wo\u017ana-Szcze\u015bniak, B., Zbrzezny, A., Zbrzezny, A.: The BMC method for the existential part of RTCTLK and interleaved interpreted systems. In: Antunes, L., Pinto, H.S. (eds.) EPIA 2011. LNCS, vol.\u00a07026, pp. 551\u2013565. Springer, Heidelberg (2011)"},{"issue":"1-4","key":"26_CR22","first-page":"513","volume":"85","author":"A. Zbrzezny","year":"2008","unstructured":"Zbrzezny, A.: Improving the translation from ECTL to SAT. Fundamenta Informaticae\u00a085(1-4), 513\u2013531 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"3-4","key":"26_CR23","first-page":"579","volume":"79","author":"A. Zbrzezny","year":"2007","unstructured":"Zbrzezny, A., P\u00f3lrola, A.: Sat-based reachability checking for timed automata with discrete data. Fundamenta Informaticae\u00a079(3-4), 579\u2013593 (2007)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Computer Performance Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40725-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T18:39:56Z","timestamp":1558031996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40725-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642407246","9783642407253"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40725-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}