{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:12:22Z","timestamp":1725466342198},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308284"},{"type":"electronic","value":"9783642308291"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30829-1_8","type":"book-chapter","created":{"date-parts":[[2012,6,8]],"date-time":"2012-06-08T12:19:10Z","timestamp":1339157950000},"page":"104-121","source":"Crossref","is-referenced-by-count":1,"title":["First-Order Dynamic Logic for Compensable Processes"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bruni","sequence":"first","affiliation":[]},{"given":"Carla","family":"Ferreira","sequence":"additional","affiliation":[]},{"given":"Anne","family":"Kersten Kauer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-69937-8_9","volume-title":"Logic, Language, Information and Computation","author":"M.R.F. Benevides","year":"2008","unstructured":"Benevides, M.R.F., Schechter, L.M.: A Propositional Dynamic Logic for CCS Programs. In: Hodges, W., de Queiroz, R. (eds.) WOLLIC 2008. LNCS (LNAI), vol.\u00a05110, pp. 83\u201397. Springer, Heidelberg (2008)"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1017\/S0960129509007683","volume":"19","author":"M. Bravetti","year":"2009","unstructured":"Bravetti, M., Zavattaro, G.: On the expressive power of process interruption and compensation. Math. Struct. in Comput. Sci.\u00a019(3), 565\u2013599 (2009)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"8_CR3","unstructured":"Broersen, J.: Modal Action Logics for Reasoning about Reactive Systems. PhD thesis, Faculteit der Exacte Wetenschappen, Vrije Universiteit Amsterdam (2003)"},{"issue":"2-3","key":"8_CR4","first-page":"107","volume":"48","author":"J. Broersen","year":"2001","unstructured":"Broersen, J., Wieringa, R., Meyer, J.-J.: A fixed-point characterization of a deontic logic of regular action. Fundamenta Informaticae\u00a048(2-3), 107\u2013128 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: Nested Commits for Mobile Calculi: Extending Join. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IFIP AICT, vol.\u00a0155, pp. 563\u2013576. Kluwer Academics (2004)","DOI":"10.1007\/1-4020-8141-3_43"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: Palsberg, J., Abadi, M. (eds.) POPL 2005, pp. 209\u2013220. ACM (2005)","DOI":"10.1145\/1040305.1040323"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-40911-4_5","volume-title":"Integrated Formal Methods","author":"M. Butler","year":"2000","unstructured":"Butler, M., Ferreira, C.: A Process Compensation Language. In: Grieskamp, W., Santen, T., Stoddart, B. (eds.) IFM 2000. LNCS, vol.\u00a01945, pp. 61\u201376. Springer, Heidelberg (2000)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11423348_8","volume-title":"Communicating Sequential Processes. The First 25 Years","author":"M. Butler","year":"2005","unstructured":"Butler, M., Hoare, C., Ferreira, C.: A Trace Semantics for Long-Running Transactions. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. The First 25 Years. LNCS, vol.\u00a03525, pp. 133\u2013150. Springer, Heidelberg (2005)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-00945-7_6","volume-title":"Trustworthy Global Computing","author":"L. Caires","year":"2009","unstructured":"Caires, L., Ferreira, C., Vieira, H.: A Process Calculus Analysis of Compensations. In: Kaklamanis, C., Nielson, F. (eds.) TGC 2008. LNCS, vol.\u00a05474, pp. 87\u2013103. Springer, Heidelberg (2009)"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.jal.2009.02.001","volume":"7","author":"P. Castro","year":"2009","unstructured":"Castro, P., Maibaum, T.S.E.: Deontic action logic, atomic boolean algebras and fault-tolerance. Journal of Applied Logic\u00a07(4), 441\u2013466 (2009)","journal-title":"Journal of Applied Logic"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V. Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible Communicating Systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 292\u2013307. Springer, Heidelberg (2004)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-15375-4_39","volume-title":"CONCUR 2010 - Concurrency Theory","author":"E. Vries de","year":"2010","unstructured":"de Vries, E., Koutavas, V., Hennessy, M.: Communicating Transactions - (Extended Abstract). In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 569\u2013583. Springer, Heidelberg (2010)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-01364-5_7","volume-title":"Web Services and Formal Methods","author":"C. Eisentraut","year":"2009","unstructured":"Eisentraut, C., Spieler, D.: Fault, Compensation and Termination in WS-BPEL\u00a02.0 \u2014 A Comparative Analysis. In: Bruni, R., Wolf, K. (eds.) WS-FM 2008. LNCS, vol.\u00a05387, pp. 107\u2013126. Springer, Heidelberg (2009)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09237-4","volume-title":"First-Order Dynamic Logic","author":"D. Harel","year":"1979","unstructured":"Harel, D.: First-Order Dynamic Logic. LNCS, vol.\u00a068. Springer, Heidelberg (1979)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic logic. In: Handbook of Philosophical Logic, pp. 497\u2013604. MIT Press (1984)","DOI":"10.1007\/978-94-009-6259-0_10"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-15375-4_33","volume-title":"CONCUR 2010 - Concurrency Theory","author":"I. Lanese","year":"2010","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversing Higher-Order Pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 478\u2013493. Springer, Heidelberg (2010)"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jlap.2006.05.007","volume":"70","author":"R. Lucchi","year":"2007","unstructured":"Lucchi, R., Mazzara, M.: A pi-calculus based semantics for WS-BPEL. J. Log. Algebr. Program.\u00a070(1), 96\u2013118 (2007)","journal-title":"J. Log. Algebr. Program."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11841197_17","volume-title":"Web Services and Formal Methods","author":"M. Mazzara","year":"2006","unstructured":"Mazzara, M., Lanese, I.: Towards a Unifying Theory for Web Services Composition. In: Bravetti, M., N\u00fa\u00f1ez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol.\u00a04184, pp. 257\u2013272. Springer, Heidelberg (2006)"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1305\/ndjfl\/1093637776","volume":"29","author":"J.-J. Meyer","year":"1988","unstructured":"Meyer, J.-J.: A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic. Notre Dame Journal of Formal Logic\u00a029, 109\u2013136 (1988)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"8_CR21","unstructured":"OASIS. WSBPEL (2007), http:\/\/docs.oasis-open.org\/wsbpel\/2.0\/wsbpel-v2.0.html"},{"issue":"4","key":"8_CR22","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"C.H. Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM\u00a026(4), 631\u2013653 (1979)","journal-title":"J. ACM"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/23005.23008","volume":"34","author":"D. Peleg","year":"1987","unstructured":"Peleg, D.: Concurrent dynamic logic. J. ACM\u00a034, 450\u2013479 (1987)","journal-title":"J. ACM"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1093\/logcom\/6.3.465","volume":"6","author":"R. Meyden Van Der","year":"1996","unstructured":"Van Der Meyden, R.: The dynamic logic of permission. Journal of Logic and Computation\u00a06, 465\u2013479 (1996)","journal-title":"Journal of Logic and Computation"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-14458-5_10","volume-title":"Web Services and Formal Methods","author":"C. Vaz","year":"2010","unstructured":"Vaz, C., Ferreira, C.: Towards Compensation Correctness in Interactive Systems. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol.\u00a06194, pp. 161\u2013177. Springer, Heidelberg (2010)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-00945-7_13","volume-title":"Trustworthy Global Computing","author":"C. Vaz","year":"2009","unstructured":"Vaz, C., Ferreira, C., Ravara, A.: Dynamic Recovering of Long Running Transactions. In: Kaklamanis, C., Nielson, F. (eds.) TGC 2008. LNCS, vol.\u00a05474, pp. 201\u2013215. Springer, Heidelberg (2009)"},{"issue":"237","key":"8_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/mind\/LX.237.1","volume":"LX","author":"G. Wright Von","year":"1951","unstructured":"Von Wright, G.: I. deontic logic. Mind\u00a0LX(237), 1\u201315 (1951)","journal-title":"Mind"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30829-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:06:53Z","timestamp":1606187213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30829-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308284","9783642308291"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30829-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}