{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:31Z","timestamp":1725561271300},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_29","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:53:55Z","timestamp":1280393635000},"page":"422-437","source":"Crossref","is-referenced-by-count":4,"title":["Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL"],"prefix":"10.1007","author":[{"given":"Frank D.","family":"Valencia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(89)90138-2","volume":"65","author":"M. Abadi","year":"1989","unstructured":"Abadi, M.: The power of temporal proofs. Theoretical Computer Science\u00a065, 35\u201384 (1989)","journal-title":"Theoretical Computer Science"},{"key":"29_CR2","unstructured":"Buchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Int. Conf. on Logic, Methodology, and Philosophy of Science, pp. 1\u201311 (1962)"},{"key":"29_CR3","first-page":"19","volume":"10","author":"Y. Choueka","year":"1974","unstructured":"Choueka, Y.: Theories of automata on \u03c9-tapes:A simplified approach. Computer and System Sciences\u00a010, 19\u201335 (1974)","journal-title":"Computer and System Sciences"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/inco.1999.2879","volume":"161","author":"F. Boer de","year":"2000","unstructured":"de Boer, F., Gabbrielli, M., Meo, M.C.: Atimed concurrent constraint language. Information and Computation\u00a0161, 45\u201383 (2000)","journal-title":"Information and Computation"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"de Boer, F., Gabbrielli, M., Marchiori, E., Palamidessi, C.: Proving concurrent constraint programs correct. ACM Transactions on Programming Languages and Systems\u00a019(5) (1997)","DOI":"10.1145\/265943.265954"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-49059-0_16","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"G. Delzanno","year":"1999","unstructured":"Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, p. 223. Springer, Heidelberg (1999)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Application and Theory of Petri Nets 1997","author":"J. Esparza","year":"1997","unstructured":"Esparza, J., Melzer, S.: Model checking LTL using constraint programming. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.\u00a01248. Springer, Heidelberg (1997)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Falaschi, M., Policriti, A., Villanueva, A.: Modelling timed concurrent systems in a temporal concurrent constraint language - I. ENTCS, vol.\u00a048 (2001)","DOI":"10.1016\/S1571-0661(04)00157-4"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0168-0072(00)00018-X","volume":"106","author":"I. Hodkinson","year":"2000","unstructured":"Hodkinson, I., Wolter, F., Zakharyasche, M.: Decidable fragments of first-order temporal logic. Ann. Pure. Appl. Logic\u00a0106, 85\u2013134 (2000)","journal-title":"Ann. Pure. Appl. Logic"},{"key":"29_CR10","volume-title":"The Temporal Logic of Reactive and Concurrent Systems, Specification","author":"Z. Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer, Heidelberg (1991)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Merz, S.: Decidability and incompleteness results for first-order temporal logics of linear time. Journal of Applied Non-Classical Logic\u00a02(2) (1992)","DOI":"10.1080\/11663081.1992.10510779"},{"key":"29_CR12","unstructured":"Milner, R.: A finite delay operator in synchronous ccs. TR CSR-116-82, Univ. of Edinburgh"},{"key":"29_CR13","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-calculus (1999)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1145\/571157.571173","volume-title":"PPDP 2002","author":"M. Nielsen","year":"2002","unstructured":"Nielsen, M., Palamidessi, C., Valencia, F.: On the expressive power of concurrent constraint programming languages. In: PPDP 2002, October 2002, pp. 156\u2013167. ACM Press, New York (2002)"},{"issue":"2","key":"29_CR15","first-page":"145","volume":"9","author":"M. Nielsen","year":"2002","unstructured":"Nielsen, M., Palamidessi, C., Valencia, F.: Temporal concurrent constraint programming: Denotation, logic and applications. Nordic Journal of Computing\u00a09(2), 145\u2013188 (2002)","journal-title":"Nordic Journal of Computing"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-45711-9_17","volume-title":"Formal and Natural Computing","author":"M. Nielsen","year":"2002","unstructured":"Nielsen, M., Valencia, F.: Temporal Concurrent Constraint Programming: Applications and Behavior. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 298\u2013324. Springer, Heidelberg (2002)"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-45578-7_21","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"C. Palamidessi","year":"2001","unstructured":"Palamidessi, C., Valencia, F.: A temporal concurrent constraint programming calculus. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, p. 302. Springer, Heidelberg (2001)"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Saraswat, V., Jagadeesan, R., Gupta, V.: Foundations of timed concurrent constraint programming. In: Proc. of LICS 1994, pp. 71\u201380 (1994)","DOI":"10.1109\/LICS.1994.316085"},{"key":"29_CR19","first-page":"361","volume-title":"Constraint Programming: Proc. 1993","author":"V. Saraswat","year":"1994","unstructured":"Saraswat, V., Jagadeesan, R., Gupta, V.: Programming in timed concurrent constraint languages. In: Constraint Programming: Proc. 1993, pp. 361\u2013410. Springer, Heidelberg (1994)"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jsco.1996.0064","volume":"22","author":"V. Saraswat","year":"1996","unstructured":"Saraswat, V., Jagadeesan, R., Gupta, V.: Timed default concurrent constraint programming. Journal of Symbolic Computation\u00a022, 475\u2013520 (1996)","journal-title":"Journal of Symbolic Computation"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Saraswat, V., Rinard, M., Panangaden, P.: The semantic foundations of concurrent constraint programming. In: POPL 1991, pp. 333\u2013352 (1991)","DOI":"10.1145\/99583.99627"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A. Sistla","year":"1987","unstructured":"Sistla, A., Vardi, M., Wolper, P.: The complementation problem for buchi automata with applications to temporal logic. Theoretical Computer Science\u00a049, 217\u2013237 (1987)","journal-title":"Theoretical Computer Science"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Tini, S.: On the expressiveness of timed concurrent constraint programming. ENTCS, vol.\u00a027 (1999)","DOI":"10.1016\/S1571-0661(05)80291-9"},{"key":"29_CR24","unstructured":"Valencia, F.: Temporal Concurrent Constraint Programming. PhD thesis, BRICS Univ. of Aarhus (2003), Available online via http:\/\/www.brics.dk\/~fvalenci\/publications.html"},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Logics for Concurrency","author":"M. Vardi","year":"1996","unstructured":"Vardi, M.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:54:53Z","timestamp":1559346893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}