{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:33Z","timestamp":1725566733327},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_2","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"3-17","source":"Crossref","is-referenced-by-count":0,"title":["Verification in Predicate Logic with Time: Algorithmic Questions"],"prefix":"10.1007","author":[{"given":"Anatol","family":"Slissenko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"2_CR2","unstructured":"Beauquier, D., Crolard, T., Prokofieva, E.: Automatic verification of real time systems: A case study. In: Third Workshop on Automated Verification of Critical Systems (AVoCS 2003), University of Southampton, pp. 98\u2013108 (2003)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-24730-2_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Beauquier","year":"2004","unstructured":"Beauquier, D., Crolard, T., Prokofieva, E.: Automatic parametric verification of a root contention protocol based on abstract state machines and first order timed logic. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 372\u2013387. Springer, Heidelberg (2004)"},{"key":"2_CR4","unstructured":"Beauquier, D., Crolard, T., Slissenko, A.: A predicate logic framework for mechanical verification of real-time Gurevich Abstract State Machines: A case study with PVS. Technical Report 00\u201325, University Paris 12, Department of Informatics (2000), Available at \n                    \n                      http:\/\/www.univ-paris12.fr\/lacl\/"},{"key":"2_CR5","unstructured":"Beauquier, D., Rabinovich, A., Slissenko, A.: A logic of probability with decidable model-checking. Journal of Logic and Computation, 24 pages (to appear)"},{"key":"2_CR6","unstructured":"Beauquier, D., Slissenko, A.: Periodicity based decidable classes in a first order timed logic. Annals of Pure and Applied Logic, 38 pages (to appear)"},{"issue":"1-2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(01)00186-4","volume":"275","author":"D. Beauquier","year":"2002","unstructured":"Beauquier, D., Slissenko, A.: Decidable verification for reducible timed automata specified in a first order logic with time. Theoretical Computer Science\u00a0275(1-2), 347\u2013388 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0168-0072(01)00049-5","volume":"113","author":"D. Beauquier","year":"2002","unstructured":"Beauquier, D., Slissenko, A.: A first order logic for specification of timed algorithms: Basic properties and a decidable class. Annals of Pure and Applied Logic\u00a0113(1-3), 13\u201352 (2002)","journal-title":"Annals of Pure and Applied Logic"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45619-8_1","volume-title":"Logic Programming","author":"B. Boigelot","year":"2002","unstructured":"Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: An overview. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 1\u201319. Springer, Heidelberg (2002)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-24622-0_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Ouaknine, J., Strichman, O.: Completeness and complexity of bounded model checking. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 85\u201396. Springer, Heidelberg (2004)"},{"issue":"2","key":"2_CR11","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1145\/174652.174658","volume":"41","author":"R. Fagin","year":"1994","unstructured":"Fagin, R., Halpern, J.: Reasoning about knowledge and probability. J. of the Assoc. Comput. Mach.\u00a041(2), 340\u2013367 (1994)","journal-title":"J. of the Assoc. Comput. Mach."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-61377-3_43","volume-title":"Computer Science Logic","author":"Y. Gurevich","year":"1996","unstructured":"Gurevich, Y., Huggins, J.: The railroad crossing problem: an experiment with instantaneous actions and immediate reactions. In: Kleine B\u00fcning, H. (ed.) CSL 1995. LNCS, vol.\u00a01092, pp. 266\u2013290. Springer, Heidelberg (1996)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/2274706","volume":"56","author":"J. Halpern","year":"1991","unstructured":"Halpern, J.: Presburger arithmetic with unary predicates is \u03c01 1-complete. J. of symbolic Logic\u00a056, 637\u2013642 (1991)","journal-title":"J. of symbolic Logic"},{"key":"2_CR14","volume-title":"Software Quality","author":"J. Sanders","year":"1994","unstructured":"Sanders, J., Curran, E.: Software Quality. Addison-Wesley, Reading (1994)"},{"key":"2_CR15","first-page":"1","volume":"69","author":"A. Slissenko","year":"2004","unstructured":"Slissenko, A.: A logic framework for verification of timed algorithms. Fundamenta Informaticae\u00a069, 1\u201339 (2004)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR16","volume-title":"Software Engineering","author":"I. Sommerville","year":"1992","unstructured":"Sommerville, I.: Software Engineering, 4th edn. Addison-Wesley, Reading (1992)","edition":"4"},{"key":"2_CR17","unstructured":"Sorea, M.: Bounded model checking for timed automata. Electronic Notes in Theoretical Computer Science\u00a068(5) (2002), \n                    \n                      http:\/\/www.elsevier.com\/locate\/entcs\/volume68.html"},{"volume-title":"Introduction to Distributed Algorithms","year":"1994","key":"2_CR18","unstructured":"Tel, G. (ed.): Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (1994)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/309831.309888","volume-title":"Proc. of the 1999 Int. Symp. on Symbolic and Algebraic Computations (ISSAC 1999)","author":"V. Weispfenning","year":"1999","unstructured":"Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: Proc. of the 1999 Int. Symp. on Symbolic and Algebraic Computations (ISSAC 1999), pp. 129\u2013136. ACM Press, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:13Z","timestamp":1619506453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11538363_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}