{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:35:59Z","timestamp":1784241359700,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441656","type":"print"},{"value":"9783540457398","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45739-9_17","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T22:42:01Z","timestamp":1179268921000},"page":"265-288","source":"Crossref","is-referenced-by-count":17,"title":["Towards Bounded Model Checking for the Universal Fragment of TCTL"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Penczek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo\u017cena","family":"Wo\u017ana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Zbrzezny","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"R. Alur, C. Courcoubetis, and D. Dill. Model checking in dense real-time. Information and Computation, 104(1):2\u201334, 1993.","journal-title":"Information and Computation"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proc. of RTSS\u201992, p. 157\u2013166. IEEE Comp. Soc. Press, 1992.","DOI":"10.1109\/REAL.1992.242667"},{"key":"17_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BFb0084802","volume-title":"Proc. of CONCUR\u201992","author":"R. Alur","year":"1992","unstructured":"R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In Proc. of CONCUR\u201992, volume 630 of LNCS, p. 340\u2013354. Springer-Verlag, 1992."},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill. A theory of Timed Automata. Theoretical Computer Science, 126(2):183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"R. Alur, T. Feder, and T. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116\u2013146, 1996.","journal-title":"Journal of the ACM"},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/BFb0014737","volume-title":"Proc. of HART\u201997","author":"E. Asarin","year":"1997","unstructured":"E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli, and A. Rasse. Data-structures for the verification of Timed Automata. In Proc. of HART\u201997, volume 1201 of LNCS, p. 346\u2013360. Springer-Verlag, 1997."},{"key":"17_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"Proc. of CONCUR\u201998","author":"J. Bengtsson","year":"1998","unstructured":"J. Bengtsson, B. Jonsson, J. Lilius, and W. Yi. Partial order reductions for timed systems. In Proc. of CONCUR\u201998, volume 1466 of LNCS, p. 485\u2013500. Springer-Verlag, 1998."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"A. Biere, A. Cimatti, E. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. of DAC\u201999, p. 317\u2013320, 1999.","DOI":"10.1145\/309847.309942"},{"key":"17_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Proc. of TACAS\u201999","author":"A. Biere","year":"1999","unstructured":"A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of TACAS\u201999, volume 1579 of LNCS, p. 193\u2013207. Springer-Verlag, 1999."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, S. Tripakis, and S. Yovine. On-the-fly symbolic model checking for real-time systems. In Proc. of RTSS\u201997, p. 232\u2013243. IEEE Comp. Soc. Press, 1997.","DOI":"10.1109\/REAL.1997.641266"},{"issue":"8","key":"17_CR11","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers, 35(8):677\u2013691, 1986.","journal-title":"IEEE Transaction on Computers"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E. Clarke","year":"2001","unstructured":"E. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. In Formal Methods in System Designe, volume 19(1), p. 7\u201334, 2001.","journal-title":"Formal Methods in System Designe"},{"key":"17_CR13","unstructured":"E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"D. Dams, R. Gerth, B. Knaack, and R. Kuiper. Partial-order reduction techniques for real-time model checking. In Proc. of the 3rd Int. Workshop on Formal Methods for Industrial Critical Systems, p. 157\u2013169, 1998.","DOI":"10.1007\/s001650050028"},{"key":"17_CR15","unstructured":"D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstractions preserving ACTL*, ECTL* and CTL*. In Proc. of PROCOMET\u201994. Elsevier Science Publishers, 1994."},{"key":"17_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Proc. of TACAS\u201998","author":"C. Daws","year":"1998","unstructured":"C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In Proc. of TACAS\u201998, volume 1384 of LNCS, p. 313\u2013329. Springer-Verlag, 1998."},{"key":"17_CR17","unstructured":"Richard H. Eckhouse. Minicomputer systems. Organization and programming. Prentice-Hall, 1975."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"E. A. Emerson. Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter Temporal and Modal Logic, p. 995\u20131067. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E. A. Emerson","year":"1982","unstructured":"E. A. Emerson and E. M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241\u2013266, 1982.","journal-title":"Science of Computer Programming"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E. A. Emerson","year":"1995","unstructured":"E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9:105\u2013131, 1995.","journal-title":"Formal Methods in System Design"},{"key":"17_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-54430-5_93","volume-title":"Proc. of CONCUR\u201991","author":"O. Grumberg","year":"1991","unstructured":"O. Grumberg and D. E. Long. Model checking and modular verification. In Proc. of CONCUR\u201991, volume 527 of LNCS, p. 250\u2013265. Springer-Verlag, 1991."},{"key":"17_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-45402-0_15","volume-title":"Proc. of LPNMR\u20192001","author":"K. Heljanko","year":"2001","unstructured":"K. Heljanko and I. Niemel\u00e4. Bounded LTL model checking with stable models. In Proc. of LPNMR\u20192001, volume 2173 of LNCS, p. 200\u2013212. Springer-Verlag, 2001."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"D. S. Johnson and M. A. Trick, editors. Cliques, Coloring and Satisfiability: The Second DIMACS Implementation Challenge, volume 26 of ACM\/AMS DIMACS Series. Amer. Math. Soc., 1996.","DOI":"10.1090\/dimacs\/026"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"I. Kang and I. Lee. An Efficient State Space Generation for the Analysis of Realtime Systems. In Proc. of Int. Symposium on Software Testing and Analysis, 1996.","DOI":"10.1145\/229000.226297"},{"key":"17_CR25","series-title":"Lect Notes Comput Sci","first-page":"514","volume-title":"Proc. of CONCUR\u201996","author":"O. Kupferman","year":"1996","unstructured":"O. Kupferman, T. A. Henzinger, and M. Y. Vardi. A space-efficient on-the-fly algorithm for real-time model checking. In Proc. of CONCUR\u201996, volume 1119 of LNCS, p. 514\u2013529. Springer-Verlag, 1996."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"J. Lilius. Efficient state space search for Time Petri Nets. In Proc. of MFCS, volume 18 of ENTCS. Elsevier Science Publishers, 1999.","DOI":"10.1016\/S1571-0661(05)80254-3"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In Proc. of DAC\u201901, June 2001.","DOI":"10.1145\/378239.379017"},{"key":"17_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-61648-9_49","volume-title":"Proc. of FTRTFT\u201996","author":"F. Pagani","year":"1996","unstructured":"F. Pagani. Partial orders and verification of real-time systems. In Proc. of FTRTFT\u201996, volume 1135 of LNCS, p. 327\u2013346. Springer-Verlag, 1996."},{"key":"17_CR30","unstructured":"D. Peled. Partial order reduction: Linear and branching temporal logics and process algebras. In Proc. of POMIV\u201996, volume 29 of ACM\/AMS DIMACS Series, p. 79\u201388. Amer. Math. Soc., 1996."},{"key":"17_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-45740-2_19","volume-title":"Proc. of ICATPN\u201901","author":"W. Penczek","year":"2001","unstructured":"W. Penczek and A. P\u00f3\u0142rola. Abstractions and partial order reductions for checking branching properties of Time Petri Nets. In Proc. of ICATPN\u201901, volume 2075 of LNCS, p. 323\u2013342. Springer-Verlag, 2001."},{"key":"17_CR32","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-2000-43123413","volume":"43","author":"W. Penczek","year":"2000","unstructured":"W. Penczek, M. Szreter, R. Gerth, and R. Kuiper. Improving partial order reductions for universal branching time properties. Fundamenta Informaticae, 43:245\u2013267, 2000.","journal-title":"Fundamenta Informaticae"},{"key":"17_CR33","unstructured":"W. Penczek and B. Wo\u017ana. Towards bounded model checking for Timed Automata. In Proc. of CS&P\u201901, p. 195\u2013209, 2001."},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"W. Penczek, B. Wo\u017ana, and A. Zbrzezny. Bounded Model Checking for the Universal Fragment of CTL. Fundamenta Informaticae, 2002. to appear.","DOI":"10.1007\/3-540-45739-9_17"},{"key":"17_CR35","unstructured":"W. Penczek, B. Wo\u017ana, and A. Zbrzezny. Branching Time Bounded Model Checking for Elementary Net Systems. Report ICS PAS, 940, January 2002."},{"issue":"1","key":"17_CR36","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1008734703554","volume":"18","author":"S. Tripakis","year":"2001","unstructured":"S. Tripakis and S. Yovine. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, 18(1):25\u201368, 2001.","journal-title":"Formal Methods in System Design"},{"key":"17_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-57208-2_17","volume-title":"Proc. of CONCUR\u201993","author":"P. Wolper","year":"1993","unstructured":"P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proc. of CONCUR\u201993, volume 715 of LNCS, p. 233\u2013246. Springer-Verlag, 1993."},{"issue":"2","key":"17_CR38","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1008682131325","volume":"11","author":"T. Yoneda","year":"1997","unstructured":"T. Yoneda and B.H. Schlingloff. Efficient verification of parallel real-time systems. Formal Methods in System Design, 11(2):197\u2013215, 1997.","journal-title":"Formal Methods in System Design"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a boolean satisfiability solver. In Proc. of ICCAD\u201901, Nov. 2001.","DOI":"10.1145\/774572.774637"},{"key":"17_CR40","unstructured":"Lintao Zhang. Zchaff. http:\/\/www.ee.princeton.edu\/~chaff\/zchaff.php , 2001."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques in Real-Time and Fault-Tolerant Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45739-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T21:27:50Z","timestamp":1587504470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45739-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441656","9783540457398"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/3-540-45739-9_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}