메뉴 건너뛰기




Volumn 6, Issue 2, 2013, Pages 186-200

Formal design and verification of long-running transactions with extensible coordination tools

Author keywords

business process modeling; long running transactions; Reo coordination language; verifiable design

Indexed keywords

BUSINESS PROCESS MODELING; COORDINATION LANGUAGE; LONG-RUNNING TRANSACTIONS; MODEL-CHECKING TECHNOLOGY; SERVICE ORIENTED COMPUTING; TRANSACTIONAL PROPERTIES; VERIFIABLE DESIGNS; WEB SERVICE COMPOSITION;

EID: 84878870054     PISSN: 19391374     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSC.2011.46     Document Type: Article
Times cited : (22)

References (42)
  • 1
    • 70349352497 scopus 로고    scopus 로고
    • Applying reo to service coordination in long-running business transactions
    • N. Kokash and F. Arbab, "Applying Reo to Service Coordination in Long-Running Business Transactions," Proc. ACM Symp. Applied Computing (SAC '09), pp. 318-319, 2009.
    • (2009) Proc. ACM Symp. Applied Computing (SAC '09) , pp. 318-319
    • Kokash, N.1    Arbab, F.2
  • 7
    • 33646122491 scopus 로고    scopus 로고
    • An operational semantics for stac, a language for modelling long-running business transactions
    • M. Butler and C. Ferreira, "An Operational Semantics for StAC, A Language for Modelling Long-Running Business Transactions," Coordination Models and Languages, vol. 2949, pp. 87-104, 2004.
    • (2004) Coordination Models and Languages , vol.2949 , pp. 87-104
    • Butler, M.1    Ferreira, C.2
  • 8
    • 26444563415 scopus 로고    scopus 로고
    • A trace semantics for long-running transactions
    • Communicating Sequential Processes: The First 25 Years. Symposium on the Occasion of 25 Years of CSP. Revised Invited Papers
    • M. Butler, T. Hoare, and C. Ferreira, "A Trace Semantics for Long-Running Transactions," Proc. Communicating Sequential Processes, vol. 3525, pp. 133-150, 2005. (Pubitemid 41422259)
    • (2005) Lecture Notes in Computer Science , vol.3525 , pp. 133-150
    • Butler, M.1    Hoare, T.2    Ferreira, C.3
  • 10
    • 27244450867 scopus 로고    scopus 로고
    • Comparing two approaches to compensable flow composition
    • CONCUR 2005 - Concurrency Theory: 16th International Conference, CONCUR 2005. Proceedings
    • R. Bruni, M.J. Butler, C. Ferreira, C.A.R. Hoare, H.C. Melgratti, and U. Montanari, "Comparing Two Approaches to Compensable Flow Composition," Proc. Int'l Conf. Concurrency Theory (CONCUR '05), vol. 3653, pp. 383-397, 2005. (Pubitemid 41520754)
    • (2005) Lecture Notes in Computer Science , vol.3653 , pp. 383-397
    • Bruni, R.1    Butler, M.2    Ferreira, C.3    Hoare, T.4    Melgratti, H.5    Montanari, U.6
  • 13
    • 33750457295 scopus 로고    scopus 로고
    • A pi-calculus based semantics for WS-BPEL
    • DOI 10.1016/j.jlap.2006.05.007, PII S1567832606000312
    • R. Lucchi and M. Mazzara, "A Pi-Calculus Based Semantics for WS-BPEL," J. Logic and Algebraic Programming, vol. 70, no. 1, pp. 96-118, 2007. (Pubitemid 44647974)
    • (2007) Journal of Logic and Algebraic Programming , vol.70 , Issue.1 , pp. 96-118
    • Lucchi, R.1    Mazzara, M.2
  • 14
    • 24644473737 scopus 로고    scopus 로고
    • Foundations of Web transactions
    • Foundations of Software Science and Computational Structures - 8th Int. Conference, FOSSACS 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Proc.
    • C. Laneve and G. Zavattaro, "Foundations of Web Transactions," Proc. Eighth Int'l Conf. Foundations of Software Science and Computation Structures (FOSSACS '05), vol. 3441, pp. 282-298, 2005. (Pubitemid 41273713)
    • (2005) Lecture Notes in Computer Science , vol.3441 , pp. 282-298
    • Laneve, C.1    Zavattaro, G.2
  • 18
    • 67049097578 scopus 로고    scopus 로고
    • Formal semantics and verification of bpmn transaction and compensation
    • T. Takemura, "Formal Semantics and Verification of BPMN Transaction and Compensation," Proc. IEEE Asia-Pacific Services Computing Conf., pp. 284-290, 2008.
    • (2008) Proc. IEEE Asia-Pacific Services Computing Conf , pp. 284-290
    • Takemura, T.1
  • 21
    • 33749599831 scopus 로고    scopus 로고
    • OMG Final Adopted Specification
    • OMG, "Business Process Modeling Notation (BPMN) Specification," http://www.omg.org/bpmn/Documents/OMG-Final-Adopted-BPMN-1-0-Spec-06-02-01.pdf, Final Adopted Specification, 2006.
    • (2006) Business Process Modeling Notation (BPMN) Specification
  • 25
    • 84926020762 scopus 로고    scopus 로고
    • Reo: A channel-based coordination model for component composition
    • DOI 10.1017/S0960129504004153
    • F. Arbab, "Reo: A Channel-Based Coordination Model for Component Composition," Math. Structures in Computer Science, vol. 14, no. 3, pp. 329-366, 2004. (Pubitemid 38729561)
    • (2004) Mathematical Structures In Computer Science , vol.14 , Issue.3 , pp. 329-366
    • Arbab, F.1
  • 26
    • 33947101688 scopus 로고    scopus 로고
    • Models and temporal logical specifications for timed component connectors
    • DOI 10.1007/s10270-006-0009-9, Special Section on Software Engineering and Formal Methods
    • F. Arbab, C. Baier, F.S. de Boer, and J.J.M.M. Rutten, "Models and Temporal Logics for Timed Component Connectors," Int'l J. Software and Systems Modeling, vol. 6, no. 1, pp. 59-82, 2007. (Pubitemid 46403949)
    • (2007) Software and Systems Modeling , vol.6 , Issue.1 , pp. 59-82
    • Arbab, F.1    Baier, C.2    De Boer, F.3    Rutten, J.4
  • 27
    • 29144518344 scopus 로고    scopus 로고
    • Probabilistic models for reo connector circuits
    • C. Baier, "Probabilistic Models for Reo Connector Circuits," J. Universal Computer Science, vol. 11, no. 10, pp. 1718-1748, 2005. (Pubitemid 41807346)
    • (2005) Journal of Universal Computer Science , vol.11 , Issue.10 , pp. 1718-1748
    • Baier, C.1
  • 30
    • 33748149533 scopus 로고    scopus 로고
    • Modeling component connectors in Reo by constraint automata
    • DOI 10.1016/j.scico.2005.10.008, PII S0167642306000219
    • C. Baier, M. Sirjani, F. Arbab, and J. Rutten, "Modeling Component Connectors in Reo by Constraint Automata," Science of Computer Programming, vol. 61, pp. 75-113, 2006. (Pubitemid 44308198)
    • (2006) Science of Computer Programming , vol.61 , Issue.2 , pp. 75-113
    • Baier, C.1    Sirjani, M.2    Arbab, F.3    Rutten, J.4
  • 31
    • 34249674964 scopus 로고    scopus 로고
    • Connector colouring I: Synchronisation and context dependency
    • DOI 10.1016/j.scico.2007.01.009, PII S0167642307000366, 4th International Workshop on Foundations of Coordination Languages and Software Architectures (FOCLASA '05)
    • D. Clarke, D. Costa, and F. Arbab, "Connector Coloring I: Synchronization and Context Dependency," Science of Computer Programming, vol. 66, pp. 205-225, 2007. (Pubitemid 46824153)
    • (2007) Science of Computer Programming , vol.66 , Issue.3 , pp. 205-225
    • Clarke, D.1    Costa, D.2    Arbab, F.3
  • 33
  • 39
    • 0028413052 scopus 로고
    • A theory of timed automata
    • R. Alur and D. Dill, "A Theory of Timed Automata," Theoretical Computer Science, vol. 126, no. 2, pp. 183-235, 1994.
    • (1994) Theoretical Computer Science , vol.126 , Issue.2 , pp. 183-235
    • Alur, R.1    Dill, D.2
  • 40
    • 71849106582 scopus 로고    scopus 로고
    • SAT-based verification for timed component connectors
    • S. Kemper, "SAT-Based Verification for Timed Component Connectors," Electronic Notes in Theoretical Computer Science, vol. 255, pp. 103-118, 2009.
    • (2009) Electronic Notes in Theoretical Computer Science , vol.255 , pp. 103-118
    • Kemper, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.