{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:49Z","timestamp":1725490129825},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417682"},{"type":"electronic","value":"9783540452416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45241-9_17","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:24:00Z","timestamp":1188296640000},"page":"245-258","source":"Crossref","is-referenced-by-count":1,"title":["Constraint Database Models Characterizing Timed Bisimilarity"],"prefix":"10.1007","author":[{"given":"Supratik","family":"Mukhopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-48654-1_16","volume-title":"The observational power of clocks","author":"R. Alur","year":"1994","unstructured":"R. Alur, C. Courcoubetis, and T. A. Henzinger. The observational power of clocks. In B. Jonsson and J. Parrow, editors, CONCUR: fifth Internationsl Conference on Concurrency Theory, volume 836 of LNCS, pages 162\u2013177, 1994."},{"issue":"2","key":"17_CR2","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\u2013236, 1994.","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BFb0055622","volume-title":"Alternating refinement relations","author":"R. Alur","year":"1998","unstructured":"R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi. Alternating refinement relations. In D. Sangiorgi and R. de Simone, editors, CONCUR: International Conference on Concurrency Theory, LNCS, pages 163\u2013178. Springer, 1998."},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/3-540-61042-1_66","volume-title":"TACAS","author":"J. Bengtsson","year":"1996","unstructured":"Johan Bengtsson, Kim. G. Larsen, Fredrik Larsson, Paul Petersson, and Wang Yi. Uppaal in 1995. In T. Margaria and B. Steffen, editors, TACAS, LNCS 1055, pages 431\u2013434. Springer-Verlag, 1996."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"A. Brodsky and Y. Sagiv. Inference of inequality constraints in logic programs. In PODS: Principles of Database Systems, pages 227\u2013240. ACM Press, 1991.","DOI":"10.1145\/113413.113434"},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"PLAP\/ALP98","author":"B. Cui","year":"1998","unstructured":"B. Cui, Y. Dong, X. Du, K. N. Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, A. Roychoudhury, S. A. Smolka, and D. S. Warren. Logic programming and model checking. In PLAP\/ALP98, volume 1490of LNCS, pages 1\u201320. Springer-Verlag, 1998."},{"key":"17_CR7","series-title":"Lect Notes Comput Sci","first-page":"302","volume-title":"CAV 92: Computeraided Verification","author":"K. Cer\u0101ns","year":"1992","unstructured":"K. Cer\u0101ns. Decidability of bisimulation equivalence for parallel timer processes. In G. von Bochmann and D.K. Probst, editors, CAV 92: Computeraided Verification, Lecture Notes in Computer Science 663, pages 302\u2013315. Springer-Verlag, 1992."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. JACM, 43(1):20\u201374, 1996.","journal-title":"JACM"},{"key":"17_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-48523-6_25","volume-title":"ICALP: Automata, Languages and Programming","author":"M. Dickh\u00f6fer","year":"1999","unstructured":"M. Dickh\u00f6fer and T. Wilke. Timed alternating tree automata: The automata-theoretic solution to the tctl model checking problem. In J. Widermann, P. van Emde Boas, and M. Nielsen, editors, ICALP: Automata, Languages and Programming, volume 1644 of LNCS, pages 281\u2013290. Springer-Verlag, 1999."},{"key":"17_CR10","unstructured":"Laurent Fribourg and Marcos Veloso Peixoto. Concurrent constraint automata. Technical Report LIENS 93-10, ENS Paris, 1993."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"G. Gupta and E. Pontelli. A constraint-based approach for the specification and verification of real-time systems. In Kwei-Jay Lin, editor, IEEE Real-Time Systems Symposium, pages 230\u2013239. IEEE Press, 1997.","DOI":"10.1109\/REAL.1997.641285"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Gopal Gupta. Horn logic denotations and their applications. In The Logic Programming Paradigm: A 25 year perspective. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-642-60085-2_6"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T.A. Henzinger","year":"1994","unstructured":"T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193\u2013244, 1994. Special issue for LICS 92.","journal-title":"Information and Computation"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"J. Jaffar and M. J. Maher. Constraint logic programming: A survey. The Journal of Logic Programming, 19\/20:503\u2013582, May-July 1994.","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P. C. Kanellakis","year":"1995","unstructured":"P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51:26\u201352, 1995. (Preliminary version in Proc. 9th ACM PODS, 299\u2013313, 1990.).","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"F. Laroussinie, K. G. Larsen, and C. Weise. From timed automata to logic-and back. Technical Report RS-95-2, BRICS, 1995.","DOI":"10.7146\/brics.v2i2.19504"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Kenneth. L. McMillan. Symbolic Model Checking. Kluwer, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"17_CR18","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Supratik Mukhopadhyay and Andreas Podelski. Model checking for timed logic processes, 1999. Available at http:\/\/www.mpi-sb.mpg.de\/~supratik\/ .","DOI":"10.1007\/3-540-44957-4_40"},{"key":"17_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-53507-1_77","volume-title":"A closed form for datalog queries with integer order","author":"P. Revesz","year":"1990","unstructured":"Peter Revesz. A closed form for datalog queries with integer order. In S. Abiteboul and P. C\u2019. Kanellakis, editors, ICDT: the International Conference on Database Theory, volume 470of LNCS, pages 187\u2013201. Springer-Verlag, 1990."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Y. S. Ramakrishna, C. R. Ramakrishnan, I. V Ramakrishnan, S. A. Smolka, T. W. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In O. Grumberg, editor, the 9th International Conference on Computer-Aided-Verification, pages 143\u2013154. Springer-Verlag, July 1997.","DOI":"10.1007\/3-540-63166-6_16"},{"key":"17_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-60045-0_52","volume-title":"Local model checking for real-time systems","author":"O. Sokolsky","year":"1995","unstructured":"Oleg Sokolsky and Scott. A. Smolka. Local model checking for real-time systems. In Pierre Wolper, editor, 7th International Conference on Computer-Aided Verification, volume 939 of LNCS, pages 211\u2013224. Springer-Verlag, July 1995."},{"key":"17_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-16492-8_66","volume-title":"Old resolution with tabulation","author":"H. Tamaki","year":"1986","unstructured":"H. Tamaki and T. Sato. Old resolution with tabulation. In International Conference on Logic Programming, LNCS, pages 84\u201398. Springer-Verlag, 1986."},{"key":"17_CR24","unstructured":"L. Vielle. A database-complete proof procedure based on sld-resolution. In Fourth International Conference on Logic Programming. MITPress, 1987."},{"key":"17_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BFb0023458","volume-title":"Efficient scaling-invariant checking of timed bisimulation","author":"C. Weise","year":"1997","unstructured":"C. Weise and D. Lenzes. Efficient scaling-invariant checking of timed bisimulation. In R. Reischuk and M. Morvan, editors, STACS: Annual Symposium on Theoretical Aspects of Computer Science, volume 1200of LNCS, pages 177\u2013188, 1997."}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45241-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:08:18Z","timestamp":1556802498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45241-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417682","9783540452416"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45241-9_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}