Cristian Masalagiu
Skip Abstract Section
Abstract
Abstract
Both specification and verification of business processes are gaining more and more attention in the field. Most of the existing works in the last years are dealing with important, yet very specialized, issues. Among these, we can enumerate compensation constructs to cope with exceptions generated by long running business transactions, fully programmable fault and compensation handling mechanism, web service area, scope-based compensation and shared-labels for synchronization, and so on. The main purpose of this paper is to present a semi-automatized framework to describe and analyse business processes. Business analysts can now use a simple specification language (e.g., BPMN [Obj06]) to describe any type of activity in a company, in a concurrent and modular fashion. The associated programs (e.g., BPDs [Obj06]) have to be executed in an appropriate language (e.g., BPEL4WS [ACD+03]). Much more, they have to be confirmed to be sound, via some prescribed (a priori) conditions. We suggest how all the issues can be embedded in a unifying computer tool. We link our work with similar approaches and we justify our particular choices (besides BPMN and BPD): the TLA+ language for expressing the imposed behavioural conditions and Petri Nets ([EB87], [EB88]) to describe an intermediate semantics. In fact, we want to manage in an appropriate way the general relationship diagram (Fig. 1). Examples and case studies are provided.
- ABJ+04 Altintas I, Berkley C, Jaeger E, Jones M, Ludascher B, Mock S (2004) Kepler: an extensible system for design and execution of scientific workflows. In: SSDBM ’04: proceedings of the 16th international conference on scientific and statistical database management. IEEE Computer Society, Washington, DC, p 423Google Scholar
- AC04 Andrei S, Chin WN (2004) Incremental satisfiability counting for real-time systems. In: The tenth IEEE real-time and embedded technology and applications symposium (RTAS’2004), Toronto, CanadaGoogle Scholar
- ACCL06 Automatic debugging of real-time systems based on incremental satisfiability countingIEEE Trans Comput200655783084210.1109/TC.2006.97Google ScholarDigital Library
- ACD+03 Andrews T, Curbera F, Dholakia H, Goland Y, Klein J, Leymann F, Roller KLD, Smith D, Thatte S, Trickovic I, Weerawarana S (2003) Business Process Execution Language for Web Services, version 1.1. BEA Systems, International Business Machines Corporation, Microsoft Corporation, SAP AG, Siebel SystemsGoogle Scholar
- And95 The determinant of the boolean formulaeAnalele Universităţii Bucureşti, Informatică1995XLIV83921378006Google Scholar
- And04 Counting for satisfiability by inverting resolutionArtif Intell Rev20042243393661099.6809810.1007/s10462-004-4329-22321608Google ScholarDigital Library
- Ark02 Arkin A (2002) Business Process Modeling Language (BPML), version 1.0. Business Process Management Initiative, NovemberGoogle Scholar
- Bay04 Bayens T (2004) The state of workflow. http://www.jboss.com/products/jbpm/stateofworkflowGoogle Scholar
- BFN05 Precise modelling of compensating business transactions and its application to bpelJ Univers Comput Sci2005115712743Google Scholar
- CCG+02 Cimatti A, Clarke E, Giunchiglia E, Giunchiglia F, Pistore M, Roveri M, Sebastiani R, Tacchella A (2002) Nusmv 2: an opensource tool for symbolic model checking. In: Proceedings of CAV’02, Lecture Notes in Computer Science. Springer, HeidelbergGoogle Scholar
- CE82 Design and synthesis of synchronization skeletons using branching-time temporal logicLect Notes Comput Sci1982131527110.1007/BFb0025774Google ScholarCross Ref
- CK04 Curbera F, Khalaf R (2004) Implementing bpel4ws: The architecture of a bpel4ws implementation. In: GGF 10 Workshop: workflow in grid systems, Berlin, March 2004. IBM T.J. Watson Research CenterGoogle Scholar
- CL97 Symbolic logic and mechanical theorem proving1997OrlandoAcademic PressGoogle ScholarDigital Library
- Coo71 Cook SA (1971) The complexity of theorem-proving procedures. In: STOC’71: proceedings of the third annual ACM symposium on theory of computing. ACM, New York, pp 151–158Google Scholar
- CWA+96 Formal methods: state of the art and future directionsACM Comput Surv199628462664310.1145/242223.242257Google ScholarDigital Library
- DLL62 A machine program for theorem-provingCommun ACM196253943970217.5400210.1145/368273.368557149690Google ScholarDigital Library
- Dub91 Counting the number of solutions for instances of satisfiabilityTheor Comput Sci19918149640725.6804510.1016/0304-3975(91)90315-SGoogle ScholarDigital Library
- EB87 Fernandez C, Best E (1987) Notations and terminology on petri net theory. Arbeitspapiere der GMD, p 195Google Scholar
- EB88 Fernandez C, Best E (1988) Nonsequential processes. a petri net point of view. EATCS monographs on theoretical computer scienceGoogle Scholar
- Fer04 Ferrara A (2004) Web services: a process algebra approach. In: ICSOC’04: proceedings of the second international conference on service oriented computing. ACM, New York, pp 242–251Google Scholar
- GGST00 Giunchiglia E, Giunchiglia F, Sebastiani R, Tacchella A (2000) Sat vs. translation based decision procedures for modal logics: a comparative evaluation. J Appl Non-Classical Logics 10(2)Google Scholar
- GJ90 Computers and intractability; a guide to the theory of NP-completeness1990New YorkW.H. FreemanGoogle ScholarDigital Library
- GL94 Model checking and modular verificationACM Trans Programm Lang Syst199416384387110.1145/177492.177725Google ScholarDigital Library
- Gro04 BPMI Notation Working Group (2004) Business Process Modeling Notation (BPMN), version 1.0Google Scholar
- HLL+03 Hylands C, Lee E, Liu J, Liu X, Neuendorffer S, Xiong Y, Zhao Y, Zheng H (2003) Overview of the ptolemy projectGoogle Scholar
- Hol04 SPIN model checker, the: primer and reference manual2004ReadingAddison–WesleyGoogle Scholar
- Hoo93 Solving the incremental satisfiability problemJ Logic Programm199315121771860787.6804910.1016/0743-1066(93)90018-C1194824Google ScholarDigital Library
- Iwa89 CNF satisfiability test by counting and polynomial average timeSiam J Comput198918238539110.1137/0218026986674Google ScholarDigital Library
- JHG07 A model for BPEL-like languagesJ Front Comput Sci China20071191910.1007/s11704-007-0002-7Google ScholarCross Ref
- JM86 Safety analysis of timing properties in real-time systemsIEEE Trans Softw Eng1986SE-129890904Google ScholarDigital Library
- JM87 A graph-theoretic approach for timing analysis and its implementationIEEE Trans Comput1987C-36896197510.1109/TC.1987.5009519Google ScholarDigital Library
- KTK02 Koehler J, Tirenni G, Kumaran S (2002) From business process model to consistent implementation: a case for formal verification methods. In: Proceedings of sixth IEEE international enterprise distributed object computing conference (EDOC), pp 96–106Google Scholar
- Lam94 The temporal logic of actionsACM Trans Program Lang Syst199416387292310.1145/177492.177726Google ScholarDigital Library
- Lam02 Specifying systems: the TLA+ language and tools for hardware and software engineers2002ReadingAddison–WesleyGoogle ScholarDigital Library
- Law87 Lawford MS (1987) Model reduction of discrete real-time systems. PhD thesis, University of Toronto, CanadaGoogle Scholar
- Obj06 Object Management Group (2006) Business process modeling notation (BPMN), Final Adopted Specification, dtc/06-02-01Google Scholar
- Pel03 Peltz C (2003) Web services orchestration. a review of emerging technologies, tools and standards. Technical report, Hewlett Packard Co., JanuaryGoogle Scholar
- QWPZ05 Qiu Z, Wang S, Pu G, Zhao X (2005) Semantics of bpel4ws-like fault and compensation handling. In: FM, pp 350–365Google Scholar
- RO03 Roj J, Owen M (2003) Bpmn and business process management—introduction to the new business process modeling standard. Technical report, BPMI Library. http://www.bpmi.org/downloads/LIB-2003-09-1.pdf, SeptemberGoogle Scholar
- Sas94 Sassone V (1994) Strong concatenable processes: an approach to the category of petri net computations. BRICS Report Series RS-94-33, BRICSGoogle Scholar
- SBS04 Salaün G, Bordeaux L, Schaerf M (2004) Describing and reasoning on web services using process algebra. In: ICWS’04: proceedings of the IEEE international conference on web services. IEEE Computer Society, Washington, DC, p 43Google Scholar
- Tho91 Type theory and functional programming1991ReadingAddison–Wesley0753.68026Google ScholarDigital Library
- TJM91 Conditional petri net languagesJ Inf Process Cybern (former E.I.K.)19911275566Google Scholar
- TT02 Tiplea FL, Tiplea A (2002) A simulation preorder for abstraction of reactive systems. In: Proceedings of VMCAI 2002, Springer, Heidelberg, pp 272–288Google Scholar
- Tur05 Turner KJ (2005) Formalising web services. In: FORTE, pp 473–488Google Scholar
- Val79 The complexity of enumeration and reliability problemsSIAM J Comput1979834104210419.6808210.1137/0208032539258Google ScholarDigital Library
- vdA03 van der Aalst WMP (2003) Inheritance of business processes: A journey visiting four notorious problems. Petri Net Technology for Communication-Based Systems, pp 383–408Google Scholar
- Vir04 Towards a formal foundation to orchestration languagesElectr. Notes Theor Comput Sci2004105517110.1016/j.entcs.2004.05.008Google Scholar
- Whi04 White SA (2004) Introduction to BPMN. http://www.bpmn.org/Documents/IntroductiontoBPMN.pdfGoogle Scholar
- WKS01 Whittemore J, Kim J, Sakallah K (2001) SATIRE: a new incremental satisfiability engine. In: Proceedings of the 38th ACM/IEEE conference on design automation, pp 542–545Google Scholar
- YML99 Yu Y, Manolios P, Lamport L (1999) Model checking TLA+ specifications. In: Conference on correct hardware design and verification methods, pp 54–66Google Scholar
- Zha96 Number of models and satisfiability of sets of clausesTheor Comput Sci199615512772880873.6809410.1016/0304-3975(95)00144-1Google ScholarDigital Library
Recommendations
Specification, Refinement and Verification of Concurrent Systems—An Integration of Object-Z and CSP
This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of ...
A formal requirements engineering method for specification, synthesis, and verification
SEE '97: Proceedings of the 8th International Conference on Software Engineering Environments (SEE '97)This paper presents a formal requirements engineering method capturing specification, synthesis, and verification. Being multi-paradigm, our approach integrates individual established formal methods: temporal logics are used to express abstract ...
Experiences with specification and verification in LOTOS: a report on two case studies
WIFT '95: Proceedings of the 1st Workshop on Industrial-Strength Formal Specification TechniquesWe consider the problems of verifying properties of LOTOS specifications with specific reference to two case studies, one of which was proposed by an industrial collaborator. The case studies present quite different verification requirements and we ...
Comments