{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T15:48:21Z","timestamp":1765381701542},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_34","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"377-388","source":"Crossref","is-referenced-by-count":10,"title":["Composability of Infinite-State Activity Automata"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwen","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In: Proc. 16th Int. Colloq. on Automata, Languages and Programming (1989)","DOI":"10.1007\/BFb0035748"},{"issue":"2","key":"34_CR2","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.: Automata for modeling real-time systems. Theoretical Computer Science\u00a0126(2), 183\u2013236 (1994)","journal-title":"Theoretical Computer Science"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B. Baker","year":"1974","unstructured":"Baker, B., Book, R.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences\u00a08, 315\u2013332 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-24593-3_4","volume-title":"Service-Oriented Computing - ICSOC 2003","author":"D. Berardi","year":"2003","unstructured":"Berardi, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Mecella, M.: Automatic composition of E-services that export their behavior. In: Orlowska, M.E., Weerawarana, S., Papazoglou, M.P., Yang, J. (eds.) ICSOC 2003. LNCS, vol.\u00a02910, pp. 43\u201358. Springer, Heidelberg (2003)"},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J. Buchi","year":"1969","unstructured":"Buchi, J., Landweber, L.: Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society\u00a0138, 295\u2013311 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(02)00743-0","volume":"302","author":"Z. Dang","year":"2003","unstructured":"Dang, Z.: Pushdown time automata: a binary reachability characterization and safety verification. Theoretical Computer Science\u00a0302, 93\u2013121 (2003)","journal-title":"Theoretical Computer Science"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-44585-4_48","volume-title":"Computer Aided Verification","author":"Z. Dang","year":"2001","unstructured":"Dang, Z., Ibarra, O., Bultan, T., Kemmerer, R., Su, J.: Binary reachability analysis of pushdown timed automata with dense clocks. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 69\u201384. Springer, Heidelberg (2001)"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(02)00432-2","volume":"296","author":"Z. Dang","year":"2003","unstructured":"Dang, Z., Ibarra, O.H., Kemmerer, R.A.: Generalized discrete timed automata: decidable approximations for safety verification. Theoretical Computer Science\u00a0296, 59\u201374 (2003)","journal-title":"Theoretical Computer Science"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-45294-X_12","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"Z. Dang","year":"2001","unstructured":"Dang, Z., Ibarra, O.H., San Pietro, P.: Liveness verification of reversal-bounded multicounter machines with a free counter. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 132\u2013143. Springer, Heidelberg (2001)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-36136-7_10","volume-title":"Algorithms and Computation","author":"Z. Dang","year":"2002","unstructured":"Dang, Z., Ibarra, O.H., Sun, Z.-W.: On the emptiness problem for two-way NFA with one reversal-bounded counter. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 103\u2013114. Springer, Heidelberg (2002)"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0304-3975(02)00485-1","volume":"299","author":"Z. Dang","year":"2003","unstructured":"Dang, Z., San Pietro, P., Kemmerer, R.A.: Presburger liveness verification for discrete timed automata. Theoretical Computer Science\u00a0299, 413\u2013438 (2003)","journal-title":"Theoretical Computer Science"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Gerede, C.E., Hull, R., Su, J.: Automated composition of e-services with lookahead. Technical report, UCSB (2004)","DOI":"10.1145\/1035167.1035203"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.: Semigroups, presburger formulas, and languages. Pacific J. of Mathematics\u00a016, 285\u2013296 (1966)","journal-title":"Pacific J. of Mathematics"},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM\u00a025(1), 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1137\/S0097539792240625","volume":"24","author":"O.H. Ibarra","year":"1995","unstructured":"Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput.\u00a024, 123\u2013137 (1995)","journal-title":"SIAM J. Comput."},{"key":"34_CR16","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proc. IEEE Symposium on Logic In Computer Science (2001)"},{"key":"34_CR17","unstructured":"Lu, S.: Semantic Correctness of Transactions and Workflows. PhD thesis, SUNY at Stony Brook (2002)"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Lynch, N., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. In: Proc. 6th ACM Symp. Principles of Distributed Computing, pp. 137\u2013151 (1987)","DOI":"10.1145\/41840.41852"},{"issue":"4","key":"34_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/367211.367268","volume":"44","author":"M. Papazoglou","year":"2001","unstructured":"Papazoglou, M.: Agent-oriented technology in support of e-business. Communications of the ACM\u00a044(4), 71\u201377 (2001)","journal-title":"Communications of the ACM"},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45071-8_18","volume-title":"Computing and Combinatorics","author":"P. San Pietro","year":"2003","unstructured":"San Pietro, P., Dang, Z.: Automatic verification of multi-queue discrete timed automata. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 159\u2013171. Springer, Heidelberg (2003)"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proc. IEEE Symp. on Foundations of Computer Science (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. Savitch","year":"1970","unstructured":"Savitch, W.: Relationship between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences\u00a04, 177\u2013192 (1970)","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Singh, M.: Semantical considerations on workflows: An algebra for intertask dependencies. In: Proc. Workshop on Database Programming Languages, DBPL (1995)","DOI":"10.14236\/ewic\/DBPL1995.23"},{"issue":"2","key":"34_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0166-3615(99)00007-X","volume":"39","author":"W.M.P. Aalst van der","year":"1999","unstructured":"van der Aalst, W.M.P.: On the automatic generation of workflow processes based on product structures. Computer in Industry\u00a039(2), 97\u2013111 (1999)","journal-title":"Computer in Industry"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:25Z","timestamp":1605759685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}