demonstrating the effectiveness of process improvement ... filedemonstrating the effectiveness of...

Ulmer Informatik Berichte | Universität Ulm | Fakultät für Ingenieurwissenschaften und Informatik

Demonstrating the Effectiveness of Process Improvement Patterns

with Mining Results

Matthias Lohrmann, Manfred Reichert

Ulmer Informatik-Berichte Nr. 2013-03

März 2013

Demonstrating the Effectiveness ofProcess Improvement Patterns

with Mining Results?

Matthias Lohrmann and Manfred Reichert

Ulm University,Databases and Information Systems Institute

{matthias.lohrmann,manfred.reichert}@uni-ulm.de

Abstract. Improving the operational efficiency of processes is an im-portant goal of business process management (BPM). There exist manyproposals with regard to process improvement patterns (PIPs) as prac-tices that aim at supporting this task. Nevertheless, there is still a gapwith respect to validating PIPs in terms of their actual business value fora specific organization. Based on empirical research and experience fromconsulting projects, this paper proposes a method to tackle this chal-lenge. Our approach towards a-priori validation of process improvementpatterns considers real-world constraints such as the role of senior stake-holders and opportunities such as process mining techniques. In the senseof an experience report, our approach as well as results are illustrated onthe basis of a real-world business process from human resources manage-ment, covering a transactional volume of about 29,000 process instancesover the period of one year. Overall, our proposal enables practitionersand researchers to subject PIPs to a sound validation procedure beforetaking any process implementation decision.

Key words: Business Process Governance, Business Process Design,Business Process Optimization, Process Mining, Process Intelligence

1 Introduction

Research on business process management (BPM) and process-aware informa-tion systems (PAIS) has resulted in a multitude of contributions discussing op-tions to improve the quality, performance, and economic viability of businessprocesses. Examples range from individual “best practices” [1] to comprehensivebusiness process quality frameworks [2]. In this context, we refer to process im-provement patterns (PIPs) as abstract concepts to enhance particular aspects ofprocesses. As an example, consider the “knock-out” re-arrangement of sequentialappraisal tasks to reach a decision within a process as early as possible [3].

? This technical report constitutes an amended version of our BPMDS 2013 conferencepaper titled ”‘Demonstrating the Effectiveness of Process Improvement Patterns”.Beyond the content presented there, it comprises an appendix with additional anal-ysis results on the sample business process used, and additional illustrations.

2 Matthias Lohrmann, Manfred Reichert

To realize the full potential of PIPs in terms of practical relevance, it is nec-essary to demonstrate their actual business value to practitioners, thus enablingcorresponding implementation decisions. To address this challenge, there existmany propositions to empirically establish the effectiveness of PIPs, includingrather anecdotal evidence [4] as well as case studies [5] and survey-based research[6]. Commonly, these approaches are based on an ex-post appraisal of qualita-tive evidence given by process managers or other stakeholders to obtain generalinsights applicable to analogous cases.

However, there is still a notable gap with regard to a-priori validation ofPIPs considering a particular application context, which ranges from an orga-nization’s strategy and goals to its existing business process and informationsystems landscape. In particular, this gap should be addressed for three reasons:

1. Similar to design patterns in software engineering [7], PIPs constitute ab-stract concepts which may or may not be useful in a particular context.Experience from other scenarios is thus not sufficient to take sound organi-zational or PAIS-related implementation decisions.

2. Ex-post evidence is usually obtained from persons involved in the correspond-ing implementation projects, which leads to a source of bias. In addition,a-priori evaluation allows addressing a far wider spectrum of PIPs since itis not necessary to conclude implementation projects before a PIP can beassessed.

3. Contemporary technology, combining PAISs with process intelligence andprocess mining tools [8–10], provides novel opportunities to quantitativelyand qualitatively gauge actual business processes, which should be leveragedfor scenario-specific PIP validation.

Reflecting these considerations, this paper contributes an approach towardsa-priori evaluation of PIPs for specific application scenarios on the basis of to-day’s technical means. This enables sound implementation decisions, and extendsthe relevance of corresponding propositions from BPM and information systems(IS) research. Our approach considers both scientific rigor and practical require-ments, and is demonstrated through an experience report covering a substantialreal-world business process. In particular when discussing the validity of ourresearch design, execution and results with practitioners, we made a numberof observations applicable to a-priori empirical PIP evaluation in general. Sincethese may be helpful as lessons learned for practical application as well as futureresearch, they are highlighted as key principles.

The remainder of this paper is structured as follows: Sect. 2 describes thesample process we use to illustrate our approach and results. Sect. 3 illustratesour approach towards addressing the research issue. Sect. 4 describes the actualevaluation of PIPs and sample results. Sect. 5 and Sect. 6 discuss related workand conclude the paper.

Title Suppressed Due to Excessive Length 3

2 Sample Case: Applications Management Process

The business process we use to illustrate the concepts presented in this paperstems from the field of human resources management. It addresses the handlingof incoming job applications as implemented in a professional services firm. Fig. 1describes the business objective of the process according to a notation developedin [?]. The objective of the process is to achieve one of two states for applications:either the application is to be declined or a job offer is to be sent to the applicant.A job offer can be sent if the following conditions are fulfilled: the applicationdocuments must have been accepted in terms of quality (e.g., with regard tothe CV), an interview must have taken place with a positive feedback, basicconditions must have been agreed between both parties, and senior managementapproval must be given (cf. Fig. 1). If one of these requirements is not met, aletter of refusal has to be sent (see the OR node in Fig. 1).

Job offer sent

Letter of refusal sent OR

approved

Agreement on conditions

Symbols

Conditional element

Subcondition: relevant state of conditional elements

ANDNecessary / sufficient subconditions

“Fully determinate” target aspect: to be fulfilled if and only if conditions are met

Technical quality

Interview results

AND

Senior management

approval

Simplified terminology, full set of terms available in [11]

approved

given

given

OR

not approved

not approved

not given

not given

Fig. 1. Sample Business Objective

On the basis of discussions with stakeholders and the results of process min-ing, we can model the business process implementing the business objectivedescribed above as presented in Fig. 2, using Business Process Model and Nota-tion (BPMN) symbols [11]. For reasons of brevity, we slightly simplify the model,and omit a detailed description of its elements.

Fig. 3 provides an overview on the distribution of termination states for oursample process covering a time period of one fiscal year, i.e., the frequency ofpossible states an application process instance might terminate in. We will referto this overview when discussing our research execution in Sect. 4. A correspond-ing data sample obtained from the log database tables of the corresponding PAIS(in this case, a SAP ERP system) was used for our analyses. The data sampleincludes 27,205 cases (i.e., process instances) traceable in the PAIS. The 1,972cases not included comprise, for example, cases handled in the business unitswithout involvement of the human resources (HR) department.


Application

Rec

ruiti

ng fu

nctio

nB

usin

ess

unit

Receive appli-cation

Check docu-ments

Docu-ments

ok?

Assign contact partner

Send letter of refusal

yes

Check docu-ments

Inter-view?

Plan interview

Execute interview

Job offer?yes Send

contract

Confirm with-

drawal

Receive signed

contract

Event sub-process

×Withdrawalby applicant

Obtain approval

Validate job offer

Appr-oved?yes yes

Symbols:Tasks Split / join gateways

Start / intermediate / end events

Fig. 2. Sample Process: Handling Incoming Applications (BPMN Notation)

29,177

17,081

5,1012,129 388 1,541

2,937

100% 59%

17%

7%1% 5% 10%

Incomingapplications

Declined byrecruiting

department

Declined bytechnical

department

Declined afterinterview

Job offer notapproved

Withdrawal byapplicant

Applicant hired

Critical cases

Note: analysis includes internships, but no back office applications (e.g., personal assistants); withdrawal by applicant can occur at

Fig. 3. Termination States of the Application Process: One Fiscal Year Sample


The appendix of this paper comprises additional facts and empirical analysesgenerated in the process mining tool Disco and the statistical tool Minitab forthe data sample. Note that Disco and Minitab were selected as examples of toolsavailable to practitioners, alternatives might be employed as well.

3 Methodology

Like other IS artifacts, PIPs constitute goal-bound artificial constructs in thesense of the design science paradigm [12] to be evaluated in terms of “value orutility” [13]. In our context, this results in a particular challenge: while PIPs con-stitute abstract concepts applicable to a broad range of scenarios, their businessvalue must be determined with regard to a particular case to enable actual imple-mentation decisions. To this end, we employ an extended conceptual frameworksummarized in Fig. 4.

Research Design

Process improvement objectives

Business process / application scenario

Process improvement measures

Organizational objectives

Process improvement patterns

Specific Generic

“What?”

“How?”

Additional concepts

Original concepts

Process improvement objectives

Business process / application scenario

Process improvement measures

Organizational objectives

Process improvement patterns

Generic Specific

“What?”

“How?”

Additional concepts

Original concepts

1

2

3

Fig. 4. Extended Conceptual Framework

Beyond the concepts of PIPs and business processes or application scenar-ios, we introduce organizational objectives, process improvement objectives, andprocess improvement measures:

1. Organizational objectives reflect strategic goals an organizationwants to achieve, like, for example, cost savings. In principle, respectiveobjectives are generic, but how they are prioritized against each other isspecific to an organization’s strategy.

2. Process improvement objectives (PIOs) comprise characteristicsthat enhance a process considering organizational objectives. PIOsmay be evident, like lowering cost, or they may require additional validation.Consider, for instance, short cycle times: while it is not necessarily a strate-gic goal to enact processes as fast as possible, this may be a PIO if a linkbetween cycle times and cost can be demonstrated. PIOs provide an addi-tional layer of abstraction as a “shortcut” between improvement measures


and organizational objectives. For the above example, measures might bevalidated by demonstrating a positive impact on cycle times instead of over-all cost. Note that the concept of PIOs corresponds to the requirement toidentify stakeholders’ goals as demanded in [14].

3. Process improvement measures (PIMs) are bundles of actions con-sidered jointly for implementation.1 They reflect the application of PIPsto a specific process to realize PIOs. Note that, in many practical cases, mul-tiple PIPs are bundled into one PIM to be jointly implemented, dependingon the application context. Accordingly, a PIM is a set of one or more PIPsassociated with a specific business process to address one or more particularPIOs. A-priori validation of PIPs for a particular application context thusamounts to assessing the business value of the corresponding PIMs consid-ering relevant PIOs.

Note that, following the arrows, Fig. 4 can also be read as a methodologicaltop-down approach for process improvement that has proven its value in practice,and is applied in Sect. 4: General organizational objectives are refined to PIOsspecific to the business process or application scenario. Then, correspondingPIPs are selected from a generic set to be bundled into concise PIMs, againunder consideration of specifics of the business process or application scenario.

Key Principle 1 (Top-down Process Improvement Methodology).Top-down methodologies aiming at process improvement have proven as moststable in terms of change management. In principle, this paradigm is based onan early senior management agreement on the general “call for action” (see theconcept of organizational objectives), which is then refined into process-relatedobjectives (see the PIOs concept), and finally into individual improvement mea-sures. PIPs or industry-specific “best practices” (e.g., [15]) can be leveraged toidentify appropriate improvement measures. The advantage of this top-down ap-proach lies in focusing the discussion of individual measures on how things areto be achieved instead of what to achieve in general, and in facilitating changemanagement through an early agreement on basic principles.

In the sense of this paper, business processes and PIMs as our unit of studyare implemented by means of PAISs. To maintain scientific rigor, their assess-ment should take into account requirements posed towards the empirical eval-uation of propositions in software engineering or IS research. In [14], Wieringaet al. subsume methodological considerations on scientific evaluation in IS en-gineering. Accordingly, this section proceeds by aligning the basic requirementsdescribed in [14] with regard to problem statement and research design to theconceptual framework of Fig. 4.

1 In this context, the term “measure” is not to be understood as an means of measuringsomething (e.g., a performance indicator) or as an unit of quantity.


3.1 Problem Statement

Our problem statement (cf. Fig. 5) is structured along the requirements towardseffective empirical research [14]. It refines general principles for empirical vali-dation of PIPs as appropriate for our sample case, and describes relevant keysuccess factors. Note that the research question refers to PIMs instead of PIPs.This characteristic reflects our goal of scenario-specific validation.

Problem StatementProblem Statement

Components of

the problem

statement

Unit of Study“About what?”

Research Question“What do we want to

know?”

Relevant Concepts“What do we know in

advance?”

Research Goal“Why do we want to

know?”statement

Application to

empirical

validation of PIPs

> Should PIMs be

implemented to

improve on organi-

zational objectives?

> The business process

in question

> Proposed PIMs

i i PIP

> Related work: con-

ceptual work on the

PIPs, case studies for

other processes etc

> Implementing PIMs

will result in cost and

risks incurred (e gvalidation of PIPs

Sample Case-

specific

refinement

zational objectives?

> Should PIMs be

implemented to

reduce cost per hire

(cf Section 4 1)?

comprising PIPs

> Application manage-ment process (cf. Section 2)

> Selected PIMs (cf.

other processes etc.

> Cost per hire bench-mark (cf. Section 2)

> Available research on “knock out” processes

risks incurred (e.g.,

process disruptions).

Thus, implementation

decisions should be

based on sound

investigationrefinement

Key success

factors

(cf. Section 4.1)?

> Proper demonstration

of the relevance of

organizational objec-

ti t b dd d

(Section 4.3)

> Proper selection of

relevant PIPs to be

bundled into scenario-

ifi PIM

knock-out processes

> Proper research into

available literature

> Use of available orga-

> Proper consideration

of related invest-

ments, transactional

l ttives to be addressed specific PIMs nizational knowledge volume etc.

Fig. 5. Problem Statement: Structure and Application

3.2 Research Design

Proper research design is the second requirement towards any scientific evalua-tion [14]. Fig. 6 summarizes our considerations in this regard.

Research DesignResearch Design

Unit of dataUnit of data

collection

Measurement

instruments

Data analysis

procedures

Measurement

procedures

> As-is process description

incl. flowchart

> Process instances sample

Environment of

data collection

instruments proceduresprocedures> Example: cf. Section 2

> Environment of recon-

> Process mining

> Semi-structured

stakeholder interviews

> Example: process mining

with Disco, telephone and

> Process enactment tracing

capabilities, statistical

process control

> PIMs description for

stakeholder interviews

> Quantitative analysis of

process mining results

> Qualitative analysis of

stakeholder interview

results

ciliation with stakeholders

> Example: the field: head of

recruiting, business unit HR

partner, business unit

managers

with Disco, telephone and

face-to-face interviews

based on PIMs description,

recruitment center site visit

> Example: application

management workflow log

data, PIMs as described in

Section 4.3

> Example: statistical

analysis with Minitab,

stakeholder reconciliation

as described in Section 4.3

Fig. 6. Research Design

As discussed, in practical scenarios, PIPs are bundled into PIMs addressingPIOs. Accordingly, the scenario-specific business value of PIPs can be demon-


strated by validating the respective PIMs’ positive impact on PIOs which are,in turn, desirable with respect to organizational objectives. Our research designseeks to establish these characteristics by combining quantitative analysis basedon, for example, process enactment logs, and qualitative discussion with stake-holders. Selected methods must be properly aligned to the application context:

Key Principle 2 (Appropriate Qualitative or Quantitative Demon-stration of Business Value). For each PIO to be addressed by PIMs, theunderlying business value must be empirically demonstrated based on properqualitative or quantitative analyses with respect to organizational objectives.Likewise, the business value of PIMs must be made transparent through appro-priate analyses. While applicable methods are summarized in Fig. 6, the specificapproach for individual PIOs and PIMs must consider the actual applicationcontext in order to balance expected insights against analysis effort. For exam-ple, the omission of obviously redundant tasks not contributing to the businessobjective of the process can be justified by a short qualitative description. Incontrast, the introduction of additional control tasks to diminish defects lateron in the process will require careful quantitative weighing of pros and cons.

Note that, regardless of the appropriate method of demonstrating businessvalue, all types of PIOs and PIMs require the context of a concise descriptionand a well-understood business process, and the cooperation of knowledgeablestakeholders in the field as unit and environment of data collection (cf. Fig. 6).

Key Principle 3 (Identifying Relevant Stakeholders as InterviewPartners). To ensure the validity of measurement procedures, proper selectionof interview partners is of particular relevance for PIOs and PIMs that shouldbe validated qualitatively. For BPM scenarios, it is important to interview ex-perienced senior personnel overlooking the end-to-end business process, and torepresent both the “supplier” and the “customer” perspective to avoid lopsidedoptimization. For our sample process, we interviewed the head of recruiting oper-ations and the administrator of the application management workflow from the“supplier” side, and the HR partner of a business unit as well as team managersfrom the business unit from the “customer” side.

4 Sample Case: Process Improvement Patterns Validation

We now apply the conceptual framework from Fig. 4 and our research designfrom Sect. 3.2 to the process described in Sect. 2.

4.1 Organizational Objectives

As discussed in Sect. 3.1, obtaining clarity about the content and business valueof organizational objectives is an important prerequisite to ensure relevance ofPIP validation. For our process, the following considerations apply:


Reducing Cost per Hire as Organizational Objective. In our sampleapplication field (i.e., recruiting), organizations aim at filling vacant positionsquickly, cost-effectively, and with suitable candidates. To achieve this goal, per-sonnel marketing is tasked to generate a sufficient number of suitable candidateswhile the purpose of our sample process, application management, is to convertapplications into actual hires. In this context, the cost per hire key performanceindicator captures the total cost of both personnel marketing and applicationsmanagement. While recruiting cost spent per application is proprietary data,based on client projects experience we may assume an amount of about 400Euros. In our sample scenario, generating and managing 29,000 applications peryear would thus sum up to 11.6m Euros total cost. Accordingly, cost per hire maybe assumed to be around 4,000 Euros. Since hiring cost for talent in professionalservices will be higher than in, e.g., manufacturing, this value corresponds wellto the average of 4,285 USD reported as cost per hire for larger organizationsby a benchmarking organization [16], and seems rather conservative consideringthat professional recruiting consultants commonly charge half a year’s salaryfor successful hires, depending on industry. This calculation demonstrates therelevance of reducing cost per hire through an improved application handlingprocess.

4.2 Process Improvement Objectives (PIOs)

PIOs pertain to characteristics of the business process that affect the organiza-tional objectives we want to improve on. Thus, they serve as a “shortcut” tofacilitate the discussion of the business value of PIMs without reverting to fun-damental objectives. In our sample case, cost per hire is driven by the generalefficiency of the application management process, but also by its effectivenesswith regard to avoiding the termination states marked as “critical” in Fig. 3:

– Not approving a job offer after a successful interview may be caused bydefective steering of capacities (i.e., job vacancies), defective communicationof terms to be offered, or defective review of application documents.

– Job offers declined by applicants means that the applicant does not approveof conditions offered, did not have a good impression during the applicationprocess, or has decided to take another job offer.

Since terminating the process in these states means that significant efforthas been incurred with no business value in return, organizational objectives areclearly violated: On average, only one out of six applications will successfully passinterviews. However, considering defective termination events (cf. Fig. 3), onlyone out of ten applicants can be hired. In other words, if the process enactmentdefects lined out could be fully eliminated, only about 18,000 applications wouldhave to be acquired and managed to cover demand. This would reduce totalhiring cost by about 4.6m Euros. Accordingly, we seek to identify PIOs as processcharacteristics which are apt to reduce the probability of the defective casesdescribed. Table 1 describes our results in this respect.


PIOs Rationale

Reducing processing cost Emerging potentials in terms of reducing process enact-ment effort per instance should be addressed.

Reducing failedapprovals

Final approval of job offers by senior management fails ifthere are issues regarding vacancy management, reconcili-ation of terms, or checking of documents. The probabilityof these “late defects” should be addressed.

Reducing cycle times The probability of applicants’ obtaining and taking al-ternative job offers increases with time. Therefore, cycletimes between applications being received and job offersmade should be as short as possible.

Table 1. Sample Case: Process Improvement Objectives

Note that for the first PIO, Reducing processing cost, there is an evident linkto our organizational objective of reducing cost per hire. However, the secondand third PIOs, Reducing failed approvals and Reducing cycle times, are basedon hypotheses on how process enactment defects which affect the organizationalobjective can be reduced. Accordingly, they require qualitative or quantitativeevidence with regard to their relevance in terms of reducing enactment defectsand thus, in the end, improving cost per hire.

For the second PIO, Reducing failed approvals, we obtained qualitative ev-idence by interviewing responsible managers, which confirmed the underlyingtopics described in Table 1. Since the reasons for failed approvals are not cap-tured in the applications management PAIS, quantitative evidence is not avail-able. For the third PIO, Reducing cycle times, the causal link to its underlyingdefect of applications withdrawn by candidates is not as obvious. However, thecorrelation can be quantitatively demonstrated:

Correlation between Job Offers Declined and Cycle Times. We want todetermine whether there is a significant influence of cycle time between applica-tion receipt and job offer in weeks on the probability of an applicant acceptingor declining a job offer. Accordingly, we use a binary logistic regression test toevaluate the influence of a metric independent variable on a binary dependentvariable. For the test, we use a sample of 2,721 job offers representing about70% of the annual volume (cf. Fig. 3), and consisting of instances fully coveredin the PAIS (not all interviews and feedbacks are documented in the PAIS). Thesample contains 261 cases where the job offer was eventually declined by theapplicant. This is the latest point in the process where withdrawal by the appli-cant is possible, and a significant amount of effort will have been spent on eachrespective case. Both independent samples have a size of more than 100 cases.Thus, the binary logistic regression can be applied. Fig. 7 shows an excerpt fromthe output of the statistical software package we used (Minitab). The p-value of


less than 0.05 indicates sufficient evidence to assume a significant impact of cycletime. According to the “Odds Ratio” column, a one week delay can be expectedto increase the probability of an applicant declining a job offer by 16%.

Minitab test

Logistic Regression TableOdds 95% CI

Predictor Coef SE Coef Z P Ratio Lower UpperConstant -2,88227 0.130509 -22.08 0,000Duration Weeks 0.0484205 0.0202145 2.40 0.017 1.05 1.01 1.09

P-Value: Probability of duration not being a

relevant factor

Odds Ratio: Lowering duration by one week expected to reduce

withdrawal risk by 5%

Logistic Regression TableOdds 95% CI

Predictor Coef SE Coef Z P Ratio Lower UpperConstant -2.58986 0.169500 -15.28 0.000Duration_weeks 0.144378 0.0635831 2.27 0.023 1.16 1.02 1.31

P-Value: Probability of duration not being a

relevant factor

Odds Ratio: Lowering duration by one week expected to reduce

withdrawal risk by 16%

Fig. 7. Minitab Output Excerpt: Binary Regression Test

Key Principle 4 (Considering Labor Relations and Restrictions inQuantitative Analyses). Quantitative analyses to support PIO and PIM val-idation like, for example, the use of process mining requires the collection ofdata on actual process enactment. However, it is not a research objective toassess individual performance of employees. In Germany, for example, inten-tions in this respect are subject to worker participation regulations accordingto the Betriebsverfassungsgesetz (the federal code on co-determination). Thus,researchers must be careful when designing quantitative analyses and the re-spective data collection procedures. Otherwise, organizations may refrain fromproviding relevant data.

4.3 Process Improvement Measures (PIMs)

To address the PIOs described in the previous section, relevant PIPs are bun-dled into PIMs specific to the application scenario. In our case, PIPs have beenselected from a framework by Reijers & Liman Mansar [1] on process redesignpractices (these are marked with an asterisk “*”) as well as from our ongoingresearch on improving business process quality [17, 18]. Accordingly, as a men-tal technique to identify propositions applicable to our application scenario, wereflect available results on PIPs against our PIOs to obtain PIMs (cf. Fig. 4).Table 2 summarizes PIOs and corresponding PIMs as bundles of PIPs.

Key Principle 5 (Prospective and Retrospective Identification of Po-tential PIOs, PIMs, and PIPs). Potentially applicable PIMs and PIPs shouldbe identified not only by prospectively considering the process model, but alsoby retrospectively analyzing empirical data on process enactment. This is crucialto focus on topics of actual value potential. For example, consider the selectionof critical cases in Fig. 3 that is reflected in the PIOs for our sample case.


PIOs Applicable PIMs with Comprised PIPs

Reducing processing cost PIM 1 (Application Management Automation): Task au-tomation*, routing automation

Reducing failedapprovals

PIM 2 (Utilization and Capacity Management): Empower-ment*, knock-out*PIM 3 (Standardized Terms and Conditions): Triage*,buffering*

Reducing cycle times PIM 4 (Managing Interview Feedback Cycle Times forSuccessful Applicants): Control addition*, routing automa-tion, escalation procedurePIM 5 (Improving Application Routing): Case manager*,knock-out*, mitigation of repetitive loops

Table 2. Defining Process Improvement Measures for Process Improvement Objectives

In actual design and implementation projects, it is common to document andtrack individual PIMs through measure cards. As an example of this practice,we choose two PIMs from Table 2 and describe them in more detail. For eachPIM, we give a short content description – with PIPs involved marked as italic– and required implementation effort. On that basis, we appraise the businessvalue considering the impact on PIOs as well as implementation effort. Resultsof our appraisal are validated through interviews with respective stakeholders.

Key Principle 6 (Considering Implementation Effort in BusinessValue Appraisal). When discussing the business value of particular PIMs fora business process, the respective implementation effort, including measures re-quired, cost, time, and change management issues (e.g., training personnel toenact new activities), must be taken into account. Accordingly, a PIM will pro-vide business value only if implementation effort is justified by realized processimprovement potentials. For example, an organization may demand that the re-quired investment may not exceed three times the projected annual cost savingswhen appraising operational cost optimization measures.

Note that, in addition to the scope presented here, actual measure cardscomprise additional information relevant to project management such as projectplanning, project organization, key milestones with “traffic light” status, risks,next steps, and decision requirements. Reporting on measure cards usually takesplace in steering committee meetings of senior management.

PIM Card 2 (Utilization and Capacity Management). Among other reasons,senior managers refuse to approve job offers when the business unit wishing to hire acandidate cannot fully utilize present capacity. While refusal reasons are not tracked inthe PAIS, stakeholder interviews resulted in an estimate of about 30% of total refusals


to be caused by this issue. Since candidates’ qualifications, in particular in graduate re-cruiting, are mostly not specific to particular business units, the recruiting departmentcan be empowered to route applications to more appropriate teams from the start on.This results in an early knock out of applications that would, in the end, be declinedbecause of low utilization.Implementation. To enable utilization-based routing decisions, a new report on uti-lization per team must be integrated into the application management workflow. Sincerelevant data is available, and is routinely checked at other spots, the correspondingimplementation effort has been estimated to be 25 consultant days or 27,500 Euros.In addition, relevant utilization thresholds must be agreed and communicated. Therecruiting center routes about 12,000 applications per year. If the additional operatingeffort for the utilization check can be assumed to be 10 minutes per application, thisresults in an overall additional capacity requirement of about 1.2 full time equivalents(FTEs), resulting in approximately 84,000 Euros annual cost.Business value. The PIM is expected to reduce the “late refusal” rate by about 30%or 120 cases per year. Assuming a rate of job offers declined by the applicant of 7% (cf.Sect. 4.2), this would reduce the number of applications to be generated and managedto achieve a constant volume of hires by about 1,200. As we assumed the cost per appli-cation to be about 400 Euros, an annual savings potential of 480,000 Euros comparesto 27,500 Euros one-off cost and 84,000 Euros operating expenditure per year.Stakeholder verification. When discussing the PIM with senior stakeholders, itsbusiness value appeared as rather clear. However, the distribution of utilization dataemerged as a “political” issue. Considering present organizational culture, the PIM willnot be implemented, but the basic capability to add utilization control functionality tothe PAIS will be included with the requirements definition for the new PAIS solutionto be completed by early 2013.

The abbreviated measure card presented above exemplifies how PIM im-plementation benefits can be projected and matched against expected imple-mentation effort. However, beyond this quantitative reasoning, qualitative (or“political”) topics can play a role in implementation decisions as well.

PIM Card 4 (Managing Interview Feedback Cycle Times for Successful Ap-plicants). The time span between successful interviews and job offers can be reducedby implementing a control addition, i.e., additional control flow elements to ensure thecorrect enactment of the process. Triggered through routing automation, the recruitingdepartment will call the interviewer directly when feedback is not available five busi-ness days after an interview. If the interviewer cannot be reached within two businessdays, an escalation procedure will take place by calling the respective supervisor. Ifno feedback can be obtained through these PIPs within ten business days, a letter ofrefusal will be sent.Implementation. To implement the PIM, comprehensive tracing of interview datesand an additional workflow with corresponding triggering mechanisms must be imple-mented in the PAIS. This results in an estimated cost of approx. 38,500 Euros for 35consultant days. In the data sample used for the binary regression test in Sect. 4.2,about 51% of cases would fall under the proposed regulations. Accordingly, a totalvolume of 7,000 interviews conducted annually (cf. Fig. 3) would result in about 3,600escalation procedures. On the one hand, this number can be expected to decline overtime. On the other hand, multiple phone calls might be necessary for one escalationcase. Hence, we assume that 20 escalation procedures can be handled in one person


day. This means that an additional 0.9 FTEs are required, resulting in about 63,000Euros annual cost.Business value. Based on our binary logical regression analysis (cf. Sect. 4.2), we rec-onciled with stakeholders that the maximum interview feedback time can be reducedto two weeks based on an escalation process. Applying the corresponding odds ratio(cf. Sect. 4.2) to all cases in our sample which exceed this timeframe results in a re-duction of 39.2 cases of “late withdrawals” (cf. Fig. 3). This would reduce the numberof applications to be generated and managed by about 390 per year, correspondingto 156,000 Euros in annual savings. Considering additional operating expenditures of63,000 Euros results in a total annual cost reduction of 93,000 Euros versus a one-offcost of 38,500 Euros.Stakeholder verification. During stakeholder interviews, we validated implementa-tion cost with the application workflow administrator, additional processing effort atthe recruiting center with the head of recruiting, and overall viability of the new processwith the head of recruiting and the business unit HR partner. The escalation procedureto provide timely feedback was challenged by the business unit HR partner, but notby team managers. Final consent on the positive business value of the PIM could beachieved by discussing the quantitative analysis of the underlying PIO (cf. Sect. 4.2).

Note that the PIMs presented exhibit a fairly positive business case withimplementation cost to total annual savings ratios below two years. They con-stitute good examples of a phenomenon often encountered in practice: in manycases, it is interesting to first identify and resolve existing process defects withinthe framework of available technology before additional process automation isimplemented at huge cost.

Key Principle 7 (Leveraging “Quick Win” Potentials). In many practi-cal scenarios, it is possible to identify “quick win” PIMs that can be implementedwith limited effort and should thus be prioritized, in particular in comparisonto full-scale PAIS implementation measures which are typically very costly. Ex-amples include the elimination of process defects caused by process participants’behavior, interface issues between departments, or issues with respect to mas-ter data quality. Note that these topics are often identified through empiricalanalyses (e.g., using process mining).

5 Related Work

Approaches aiming at empirical validation of PIPs can be traced back to qualitymanagement and business process reengineering approaches which have evolvedsince the 1950s and the early 1990s, respectively.

In terms of quality management, Six Sigma [19] is of particular interest be-cause it aims at eliminating errors in manufacturing processes. While the scopeof BPM usually lies in administrative processes instead, there are interestinganalogies since Six Sigma is based on step-by-step optimization of productionprocesses through a-priori experimental changes to parameters.


Business process reengineering, as exemplified in [4, 20], aims at optimizingprocesses “in the large” instead of implementing incremental PIPs. Transferringprocess enactment to an external supplier or customer constitutes a good exam-ple of this paradigm. While the potentials of this disruptive approach may seemtempting, more recent empirical evaluation has shown that the risk of projectsfailing is substantial [21]. Thus, incremental implementation of individual PIPsmay still be a valid approach.

In contemporary BPM, [6] proposes a framework to select and implementredesign practices. As opposed to our research, this approach does not aim atevaluating individual PIPs, but at efficiently appraising a broad framework ofpractices. However, we use earlier results from the same authors as a source ofPIPs to be assessed in more detail [1]. Note that research on PIPs addresses thequality of process models and process implementations in the sense of businesscontent. In contrast, [22–24] exemplify propositions addressing process modelquality in terms of structure, i.e., the proper partitioning of actual businesscontent into model elements.

In IS research, there have been diverse propositions to ensure common stan-dards of scientific rigor in empirical research such as field experiments or casestudies [25, 26]. As a basis of this paper, we chose the requirements summary byWieringa et al. [14] due to its concise, checklist-based character, which makes itreadily applicable to research as well as discussion with practitioners.

6 Conclusion

This paper described a methodology for a-priori, scenario-specific validation ofprocess improvement patterns based on organizational objectives, process im-provement objectives, and process improvement measures. In our methodology,we leveraged available work on generic requirements towards empirical researchin IS engineering [14], thus demonstrating how these principles can be appliedto practical cases while ensuring the general appeal of our approach.

We reported on the application of the methodology to a real-world businessprocess, including validation of the respective results with practitioners. Theorganization hosting our sample application scenario is currently implementinga new application management PAIS to be completed in 2013. The agreed PIMshave been included in the requirements definition for this project.

In particular when discussing research design and execution with stakehold-ers, we identified a number of key principles useful as lessons learned for sub-sequent work which we included at appropriate spots in this paper. The keyprinciples generally relate to which aspects should be considered when plan-ning and executing process improvement projects. Fig. 8 provides a respectiveoverview.

References

1. Reijers, H.A., Liman Mansar, S.: Best practices in business process redesign: anoverview and qualitative evaluation of successful redesign heuristics. Omega 33(4)

16 Matthias Lohrmann, Manfred ReichertKey Principles

> Considering Labor Relations and Restrictions in Quantitative Analyses

> Appropriate Qualitative or Quantitative Demonstration of Business Value

> Top-down Process Improvement Methodology

> Prospective and Retrospective Identification of Potential PIOs, PIMs, and PIPs

> Identifying Relevant Stakeholders as Interview Partners

1

2

3

4

5

6 > Considering Implementation Effort in Business Value Appraisal

7 > Leveraging “Quick Win” Potentials

Fig. 8. Summary: Key Principles for PIP Validation

(2005) 283–3062. Heravizadeh, M., Mendling, J., Rosemann, M.: Dimensions of business processes

quality (QoBP). In: Proc. BPM Workshops. LNBIP 17 (2009) 80–913. van der Aalst, W.M.: Reengineering knock-out processes. Decision Support Sys-

tems 30 (2001) 451–4684. Davenport, T.J., Short, J.E.: The new industrial engineering: Information tech-

nology and business process redesign. Sloan Mgmt. Rev. (4) (1990) 11–275. zur Muehlen, M., Ho, D.T.: Service process innovation: A case study of BPMN in

practice. In: Proc. 41st HICSS, IEEE Computer Society (2008) 3726. Liman Mansar, S., Reijers, H.A.: Best practices in business process redesign: use

and impact. Business Process Mgmt. J. 13(2) (2007) 193–2137. Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design patterns: Abstraction and

reuse of object-oriented design. In: Proc. 7th ECOOP. LNCS 707 (1993) 406–4318. IDS Scheer: Process intelligence white paper: What is process intelligence? (2009)

http://www.process-intelligence.com.9. van der Aalst, W.M.P.: Process Mining: Discovery, Conformance and Enhancement

of Business Processes. Springer (2011)10. Reichert, M., Weber, B.: Enabling Flexibility in Process-aware Information Sys-

tems: Challenges, Methods, Technologies. Springer (2012)11. Lohrmann, M., Reichert, M.: Modeling business objectives for business process

management. In: Proc. 4th S-BPM ONE. LNBIP 104 (2012) 106–12612. The Object Management Group: Business Process Model and Notation: Version

2.0 (January 2011) http://www.omg.org/spec/BPMN/2.0.13. Simon, H.A.: The Sciences of the Artificial. 3rd edn. MIT Press (1996)14. March, S.T., Smith, G.F.: Design and natural science research on information

technology. Decis. Support Syst. 15(4) (1995) 251–26615. Wieringa, R., Heerkens, H., Regnell, B.: How to write and read a scientific evalu-

ation paper. In: Proc. 17th RE, IEEE Computer Society (2009) 361–36416. Best Management Practice: IT Infrastructure Library. 2011 Edition (2011)17. Society for Human Resource Management: Executive brief: What factors influence

cost-per-hire? (2012) http://www.shrm.org/benchmarks.18. Lohrmann, M., Reichert, M.: Understanding Business Process Quality. SCI 444.

In: Business Process Management: Theory and Applications. Springer (2013)19. Lohrmann, M., Reichert, M.: Efficacy-aware business process modeling. In: Proc.

20th CoopIS. LNCS 7565 (2012) 38–55


20. Pyzdek, T., Keller, P.: The Six Sigma Handbook. McGraw-Hill (2009)21. Hammer, M., Champy, J.: Reengineering the corporation. A manifesto for business

revolution. HarperBusiness (1993)22. Cao, G., Clarke, S., Lehaney, B.: A critique of BPR from a holistic perspective.

Business Process Mgmt. J. 7(4) (2001)23. Becker, J., Rosemann, M., von Uthmann, C.: Guidelines of Business Process Mod-

eling. LNCS 1806. In: Business Process Management: Models, Techniques, andEmpirical Studies. Springer (2000) 241–262

24. Vanderfeesten, I., Reijers, H., van der Aalst, W.M.: Evaluating workflow processdesigns using cohesion and coupling metrics. Comp. in Ind. 59(5) (2008) 420–437

25. Weber, B., Reichert, M., Mendling, J., Reijers, H.: Refactoring large process modelrepositories. Comp. in Ind. 62(5) (2011) 467–486

26. Benbasat, I., Zmud, R.W.: Empirical research in information systems: The practiceof relevance. MIS Quarterly 23(1) (1999) 3–16

27. Jedlitschka, A., Ciolkowski, M., Pfahl, D.: Reporting Experiments in SoftwareEngineering. In: Advanced Topics in Empirical Softw. Eng. Springer (2007)

Appendix: Process Mining Results

This appendix includes additional illustrations on the topics presented in thepreceding sections. Its purpose is to further clarify the sample case we used asan example for our approach.

First, Fig. 9 shows a process map generated in the process mining tool Discofor the data sample. Note that, for the sake of readability, this process map hasbeen filtered to comprise only the most frequent part of actual paths and themost relevant events for our analyses. The process map needs to be interpretedwith the support of experienced stakeholders. In our sample case, for instance,application refusal events are also used to purge the database to comply withprivacy regulations, and not all hirings are handled through the correspondingend events. Accordingly, more detailed analyses must draw on methods and toolsbeyond process mining.

Second, Fig. 10 exhibits the corresponding statistics for the data sample asprovided in the Disco tool. Note that the distribution of events over time reflectsweekends and bank holidays.

Third, Fig. 11 shows a process map generated by applying additional filters.It corresponds to the data sample used to test for a correlation between cycletimes and job offers declined by applicants (cf. Sect. 4.2). The respective analysisconstitutes an example of the mix of tools and methods often encountered inpractice: Initially, the appropriate sub-process view is filtered in the processmining tool. Then, the filtered data sample is re-extracted and imported into aspreadsheet application where the event log is converted into a “case log”, i.e.an array of events for each case. On that basis, case attributes like cycle timesbetween particular event categories can be computed. These case attribute setscan be used as data samples for statistical analysis with appropriate tools suchas, in our case, Minitab. Accordingly, improved integration between tools, forexample by providing functionality for case variant attribute analysis in processmining tools, would be desirable.


2871

1543

397

1326

1130

2

1127

1962

750

4062928

2716

3420

575

597

25

27205

21021

9 2

Screening ZRA27205

Applicant route sheet9023

Interview notification4649

Reminder interview feedback2111

Contract offer sent3438

Contract return3444

Expenses recompensation1672

Contract declined369

Documents complete1390

Send access data1438

Contract offer inquiry9

Workers' council approval by deadline expiration2

Fig. 9. Filtered Process Map: One Fiscal Year Data Sample

Fig. 10. Filtered Process: Log Statistics


732

1969

1278

398

719

19

507

12

2075

8

3613

608

307

593

333

456

431

3628

3035

9

Screening ZRA3843

Interview notification2177

Applicant route sheet5059

Reminder interview feedback956

Contract offer sent3632

Contract return3629

Contract declined363

Documents complete768

Expenses recompensation850

Send access data1000

Contract offer inquiry9

Fig. 11. Filtered Process Map: Job Offers


Fourth, Fig. 12 compares cycle times for the sub-sets of applicants acceptingand declining job offers. Note that, in this case, the significance of the impact ofcycle time on job offer acceptance probability is not as obvious when just con-sidering the boxplot in comparison to the binary logic regression test. This ob-servation stresses the necessity to employ appropriate statistical methods whendealing with empirical data on process enactment.

Job offer declinedJob offer acceptedComplete data set

4

3

2

1

0

Data

Boxplot: Cycle time interview to job offer in weeks

Outer boxes mark second and third quartiles, horizontal lines mark median

Inner boxes mark 95% confidence interval for median, cross symbols mark mean

Fig. 12. Boxplot: Cycle Times vs. Acceptance of Job Offers

Liste der bisher erschienenen Ulmer Informatik-Berichte Einige davon sind per FTP von ftp.informatik.uni-ulm.de erhältlich

Die mit * markierten Berichte sind vergriffen

List of technical reports published by the University of Ulm Some of them are available by FTP from ftp.informatik.uni-ulm.de

Reports marked with * are out of print 91-01 Ker-I Ko, P. Orponen, U. Schöning, O. Watanabe

Instance Complexity

91-02* K. Gladitz, H. Fassbender, H. Vogler Compiler-Based Implementation of Syntax-Directed Functional Programming

91-03* Alfons Geser Relative Termination

91-04* J. Köbler, U. Schöning, J. Toran Graph Isomorphism is low for PP

91-05 Johannes Köbler, Thomas Thierauf Complexity Restricted Advice Functions

91-06* Uwe Schöning Recent Highlights in Structural Complexity Theory

91-07* F. Green, J. Köbler, J. Toran The Power of Middle Bit

91-08* V.Arvind, Y. Han, L. Hamachandra, J. Köbler, A. Lozano, M. Mundhenk, A. Ogiwara, U. Schöning, R. Silvestri, T. Thierauf Reductions for Sets of Low Information Content

92-01* Vikraman Arvind, Johannes Köbler, Martin Mundhenk On Bounded Truth-Table and Conjunctive Reductions to Sparse and Tally Sets

92-02* Thomas Noll, Heiko Vogler Top-down Parsing with Simulataneous Evaluation of Noncircular Attribute Grammars

92-03 Fakultät für Informatik 17. Workshop über Komplexitätstheorie, effiziente Algorithmen und Datenstrukturen

92-04* V. Arvind, J. Köbler, M. Mundhenk Lowness and the Complexity of Sparse and Tally Descriptions

92-05* Johannes Köbler Locating P/poly Optimally in the Extended Low Hierarchy

92-06* Armin Kühnemann, Heiko Vogler Synthesized and inherited functions -a new computational model for syntax-directed semantics

92-07* Heinz Fassbender, Heiko Vogler A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing

92-08* Uwe Schöning On Random Reductions from Sparse Sets to Tally Sets

92-09* Hermann von Hasseln, Laura Martignon Consistency in Stochastic Network

92-10 Michael Schmitt A Slightly Improved Upper Bound on the Size of Weights Sufficient to Represent Any Linearly Separable Boolean Function

92-11 Johannes Köbler, Seinosuke Toda On the Power of Generalized MOD-Classes

92-12 V. Arvind, J. Köbler, M. Mundhenk Reliable Reductions, High Sets and Low Sets

92-13 Alfons Geser On a monotonic semantic path ordering

92-14* Joost Engelfriet, Heiko Vogler The Translation Power of Top-Down Tree-To-Graph Transducers

93-01 Alfred Lupper, Konrad Froitzheim AppleTalk Link Access Protocol basierend auf dem Abstract Personal Communications Manager

93-02 M.H. Scholl, C. Laasch, C. Rich, H.-J. Schek, M. Tresch The COCOON Object Model

93-03 Thomas Thierauf, Seinosuke Toda, Osamu Watanabe On Sets Bounded Truth-Table Reducible to P-selective Sets

93-04 Jin-Yi Cai, Frederic Green, Thomas Thierauf On the Correlation of Symmetric Functions

93-05 K.Kuhn, M.Reichert, M. Nathe, T. Beuter, C. Heinlein, P. Dadam A Conceptual Approach to an Open Hospital Information System

93-06 Klaus Gaßner Rechnerunterstützung für die konzeptuelle Modellierung

93-07 Ullrich Keßler, Peter Dadam Towards Customizable, Flexible Storage Structures for Complex Objects

94-01 Michael Schmitt On the Complexity of Consistency Problems for Neurons with Binary Weights

94-02 Armin Kühnemann, Heiko Vogler A Pumping Lemma for Output Languages of Attributed Tree Transducers

94-03 Harry Buhrman, Jim Kadin, Thomas Thierauf On Functions Computable with Nonadaptive Queries to NP

94-04 Heinz Faßbender, Heiko Vogler, Andrea Wedel Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers

94-05 V. Arvind, J. Köbler, R. Schuler On Helping and Interactive Proof Systems

94-06 Christian Kalus, Peter Dadam Incorporating record subtyping into a relational data model

94-07 Markus Tresch, Marc H. Scholl A Classification of Multi-Database Languages

94-08 Friedrich von Henke, Harald Rueß Arbeitstreffen Typtheorie: Zusammenfassung der Beiträge

94-09 F.W. von Henke, A. Dold, H. Rueß, D. Schwier, M. Strecker Construction and Deduction Methods for the Formal Development of Software

94-10 Axel Dold Formalisierung schematischer Algorithmen

94-11 Johannes Köbler, Osamu Watanabe New Collapse Consequences of NP Having Small Circuits

94-12 Rainer Schuler On Average Polynomial Time

94-13 Rainer Schuler, Osamu Watanabe Towards Average-Case Complexity Analysis of NP Optimization Problems

94-14 Wolfram Schulte, Ton Vullinghs Linking Reactive Software to the X-Window System

94-15 Alfred Lupper Namensverwaltung und Adressierung in Distributed Shared Memory-Systemen

94-16 Robert Regn Verteilte Unix-Betriebssysteme

94-17 Helmuth Partsch Again on Recognition and Parsing of Context-Free Grammars: Two Exercises in Transformational Programming

94-18 Helmuth Partsch Transformational Development of Data-Parallel Algorithms: an Example

95-01 Oleg Verbitsky On the Largest Common Subgraph Problem

95-02 Uwe Schöning Complexity of Presburger Arithmetic with Fixed Quantifier Dimension

95-03 Harry Buhrman,Thomas Thierauf The Complexity of Generating and Checking Proofs of Membership

95-04 Rainer Schuler, Tomoyuki Yamakami Structural Average Case Complexity

95-05 Klaus Achatz, Wolfram Schulte Architecture Indepentent Massive Parallelization of Divide-And-Conquer Algorithms

95-06 Christoph Karg, Rainer Schuler Structure in Average Case Complexity

95-07 P. Dadam, K. Kuhn, M. Reichert, T. Beuter, M. Nathe ADEPT: Ein integrierender Ansatz zur Entwicklung flexibler, zuverlässiger kooperierender Assistenzsysteme in klinischen Anwendungsumgebungen

95-08 Jürgen Kehrer, Peter Schulthess Aufbereitung von gescannten Röntgenbildern zur filmlosen Diagnostik

95-09 Hans-Jörg Burtschick, Wolfgang Lindner On Sets Turing Reducible to P-Selective Sets

95-10 Boris Hartmann Berücksichtigung lokaler Randbedingung bei globaler Zieloptimierung mit neuronalen Netzen am Beispiel Truck Backer-Upper

95-11 Thomas Beuter, Peter Dadam: Prinzipien der Replikationskontrolle in verteilten Systemen

95-12 Klaus Achatz, Wolfram Schulte Massive Parallelization of Divide-and-Conquer Algorithms over Powerlists

95-13 Andrea Mößle, Heiko Vogler Efficient Call-by-value Evaluation Strategy of Primitive Recursive Program Schemes

95-14 Axel Dold, Friedrich W. von Henke, Holger Pfeifer, Harald Rueß A Generic Specification for Verifying Peephole Optimizations

96-01 Ercüment Canver, Jan-Tecker Gayen, Adam Moik Formale Entwicklung der Steuerungssoftware für eine elektrisch ortsbediente Weiche mit VSE

96-02 Bernhard Nebel Solving Hard Qualitative Temporal Reasoning Problems: Evaluating the Efficiency of Using the ORD-Horn Class

96-03 Ton Vullinghs, Wolfram Schulte, Thilo Schwinn An Introduction to TkGofer

96-04 Thomas Beuter, Peter Dadam Anwendungsspezifische Anforderungen an Workflow-Mangement-Systeme am Beispiel der Domäne Concurrent-Engineering

96-05 Gerhard Schellhorn, Wolfgang Ahrendt Verification of a Prolog Compiler - First Steps with KIV

96-06 Manindra Agrawal, Thomas Thierauf Satisfiability Problems

96-07 Vikraman Arvind, Jacobo Torán A nonadaptive NC Checker for Permutation Group Intersection

96-08 David Cyrluk, Oliver Möller, Harald Rueß An Efficient Decision Procedure for a Theory of Fix-Sized Bitvectors with Composition and Extraction

96-09 Bernd Biechele, Dietmar Ernst, Frank Houdek, Joachim Schmid, Wolfram Schulte Erfahrungen bei der Modellierung eingebetteter Systeme mit verschiedenen SA/RT–Ansätzen

96-10 Falk Bartels, Axel Dold, Friedrich W. von Henke, Holger Pfeifer, Harald Rueß Formalizing Fixed-Point Theory in PVS

96-11 Axel Dold, Friedrich W. von Henke, Holger Pfeifer, Harald Rueß Mechanized Semantics of Simple Imperative Programming Constructs

96-12 Axel Dold, Friedrich W. von Henke, Holger Pfeifer, Harald Rueß Generic Compilation Schemes for Simple Programming Constructs

96-13 Klaus Achatz, Helmuth Partsch From Descriptive Specifications to Operational ones: A Powerful Transformation Rule, its Applications and Variants

97-01 Jochen Messner Pattern Matching in Trace Monoids

97-02 Wolfgang Lindner, Rainer Schuler A Small Span Theorem within P

97-03 Thomas Bauer, Peter Dadam A Distributed Execution Environment for Large-Scale Workflow Management Systems with Subnets and Server Migration

97-04 Christian Heinlein, Peter Dadam Interaction Expressions - A Powerful Formalism for Describing Inter-Workflow Dependencies

97-05 Vikraman Arvind, Johannes Köbler On Pseudorandomness and Resource-Bounded Measure

97-06 Gerhard Partsch Punkt-zu-Punkt- und Mehrpunkt-basierende LAN-Integrationsstrategien für den digitalen Mobilfunkstandard DECT

97-07 Manfred Reichert, Peter Dadam ADEPTflex - Supporting Dynamic Changes of Workflows Without Loosing Control

97-08 Hans Braxmeier, Dietmar Ernst, Andrea Mößle, Heiko Vogler The Project NoName - A functional programming language with its development environment

97-09 Christian Heinlein Grundlagen von Interaktionsausdrücken

97-10 Christian Heinlein Graphische Repräsentation von Interaktionsausdrücken

97-11 Christian Heinlein Sprachtheoretische Semantik von Interaktionsausdrücken

97-12 Gerhard Schellhorn, Wolfgang Reif Proving Properties of Finite Enumerations: A Problem Set for Automated Theorem Provers

97-13 Dietmar Ernst, Frank Houdek, Wolfram Schulte, Thilo Schwinn Experimenteller Vergleich statischer und dynamischer Softwareprüfung für eingebettete Systeme

97-14 Wolfgang Reif, Gerhard Schellhorn Theorem Proving in Large Theories

97-15 Thomas Wennekers Asymptotik rekurrenter neuronaler Netze mit zufälligen Kopplungen

97-16 Peter Dadam, Klaus Kuhn, Manfred Reichert Clinical Workflows - The Killer Application for Process-oriented Information Systems?

97-17 Mohammad Ali Livani, Jörg Kaiser EDF Consensus on CAN Bus Access in Dynamic Real-Time Applications

97-18 Johannes Köbler,Rainer Schuler Using Efficient Average-Case Algorithms to Collapse Worst-Case Complexity Classes

98-01 Daniela Damm, Lutz Claes, Friedrich W. von Henke, Alexander Seitz, Adelinde Uhrmacher, Steffen Wolf Ein fallbasiertes System für die Interpretation von Literatur zur Knochenheilung

98-02 Thomas Bauer, Peter Dadam Architekturen für skalierbare Workflow-Management-Systeme - Klassifikation und Analyse

98-03 Marko Luther, Martin Strecker A guided tour through Typelab

98-04 Heiko Neumann, Luiz Pessoa Visual Filling-in and Surface Property Reconstruction

98-05 Ercüment Canver Formal Verification of a Coordinated Atomic Action Based Design

98-06 Andreas Küchler On the Correspondence between Neural Folding Architectures and Tree Automata

98-07 Heiko Neumann, Thorsten Hansen, Luiz Pessoa Interaction of ON and OFF Pathways for Visual Contrast Measurement

98-08 Thomas Wennekers Synfire Graphs: From Spike Patterns to Automata of Spiking Neurons

98-09 Thomas Bauer, Peter Dadam Variable Migration von Workflows in ADEPT

98-10 Heiko Neumann, Wolfgang Sepp Recurrent V1 – V2 Interaction in Early Visual Boundary Processing

98-11 Frank Houdek, Dietmar Ernst, Thilo Schwinn Prüfen von C–Code und Statmate/Matlab–Spezifikationen: Ein Experiment

98-12 Gerhard Schellhorn Proving Properties of Directed Graphs: A Problem Set for Automated Theorem Provers

98-13 Gerhard Schellhorn, Wolfgang Reif Theorems from Compiler Verification: A Problem Set for Automated Theorem Provers

98-14 Mohammad Ali Livani SHARE: A Transparent Mechanism for Reliable Broadcast Delivery in CAN

98-15 Mohammad Ali Livani, Jörg Kaiser Predictable Atomic Multicast in the Controller Area Network (CAN)

99-01 Susanne Boll, Wolfgang Klas, Utz Westermann A Comparison of Multimedia Document Models Concerning Advanced Requirements

99-02 Thomas Bauer, Peter Dadam Verteilungsmodelle für Workflow-Management-Systeme - Klassifikation und Simulation

99-03 Uwe Schöning On the Complexity of Constraint Satisfaction

99-04 Ercument Canver Model-Checking zur Analyse von Message Sequence Charts über Statecharts

99-05 Johannes Köbler, Wolfgang Lindner, Rainer Schuler Derandomizing RP if Boolean Circuits are not Learnable

99-06 Utz Westermann, Wolfgang Klas Architecture of a DataBlade Module for the Integrated Management of Multimedia Assets

99-07 Peter Dadam, Manfred Reichert Enterprise-wide and Cross-enterprise Workflow Management: Concepts, Systems, Applications. Paderborn, Germany, October 6, 1999, GI–Workshop Proceedings, Informatik ’99

99-08 Vikraman Arvind, Johannes Köbler Graph Isomorphism is Low for ZPPNP and other Lowness results

99-09 Thomas Bauer, Peter Dadam Efficient Distributed Workflow Management Based on Variable Server Assignments

2000-02 Thomas Bauer, Peter Dadam Variable Serverzuordnungen und komplexe Bearbeiterzuordnungen im Workflow- Management-System ADEPT

2000-03 Gregory Baratoff, Christian Toepfer, Heiko Neumann Combined space-variant maps for optical flow based navigation

2000-04 Wolfgang Gehring Ein Rahmenwerk zur Einführung von Leistungspunktsystemen

2000-05 Susanne Boll, Christian Heinlein, Wolfgang Klas, Jochen Wandel Intelligent Prefetching and Buffering for Interactive Streaming of MPEG Videos

2000-06 Wolfgang Reif, Gerhard Schellhorn, Andreas Thums Fehlersuche in Formalen Spezifikationen

2000-07 Gerhard Schellhorn, Wolfgang Reif (eds.) FM-Tools 2000: The 4th Workshop on Tools for System Design and Verification

2000-08 Thomas Bauer, Manfred Reichert, Peter Dadam Effiziente Durchführung von Prozessmigrationen in verteilten Workflow- Management-Systemen

2000-09 Thomas Bauer, Peter Dadam Vermeidung von Überlastsituationen durch Replikation von Workflow-Servern in ADEPT

2000-10 Thomas Bauer, Manfred Reichert, Peter Dadam Adaptives und verteiltes Workflow-Management

2000-11 Christian Heinlein Workflow and Process Synchronization with Interaction Expressions and Graphs

2001-01 Hubert Hug, Rainer Schuler DNA-based parallel computation of simple arithmetic

2001-02 Friedhelm Schwenker, Hans A. Kestler, Günther Palm 3-D Visual Object Classification with Hierarchical Radial Basis Function Networks

2001-03 Hans A. Kestler, Friedhelm Schwenker, Günther Palm RBF network classification of ECGs as a potential marker for sudden cardiac death

2001-04 Christian Dietrich, Friedhelm Schwenker, Klaus Riede, Günther Palm Classification of Bioacoustic Time Series Utilizing Pulse Detection, Time and Frequency Features and Data Fusion

2002-01 Stefanie Rinderle, Manfred Reichert, Peter Dadam Effiziente Verträglichkeitsprüfung und automatische Migration von Workflow- Instanzen bei der Evolution von Workflow-Schemata

2002-02 Walter Guttmann Deriving an Applicative Heapsort Algorithm

2002-03 Axel Dold, Friedrich W. von Henke, Vincent Vialard, Wolfgang Goerigk A Mechanically Verified Compiling Specification for a Realistic Compiler

2003-01 Manfred Reichert, Stefanie Rinderle, Peter Dadam A Formal Framework for Workflow Type and Instance Changes Under Correctness Checks

2003-02 Stefanie Rinderle, Manfred Reichert, Peter Dadam Supporting Workflow Schema Evolution By Efficient Compliance Checks

2003-03 Christian Heinlein Safely Extending Procedure Types to Allow Nested Procedures as Values

2003-04 Stefanie Rinderle, Manfred Reichert, Peter Dadam On Dealing With Semantically Conflicting Business Process Changes.

2003-05 Christian Heinlein

Dynamic Class Methods in Java

2003-06 Christian Heinlein Vertical, Horizontal, and Behavioural Extensibility of Software Systems

2003-07 Christian Heinlein Safely Extending Procedure Types to Allow Nested Procedures as Values (Corrected Version)

2003-08 Changling Liu, Jörg Kaiser Survey of Mobile Ad Hoc Network Routing Protocols)

2004-01 Thom Frühwirth, Marc Meister (eds.) First Workshop on Constraint Handling Rules

2004-02 Christian Heinlein Concept and Implementation of C+++, an Extension of C++ to Support User-Defined Operator Symbols and Control Structures

2004-03 Susanne Biundo, Thom Frühwirth, Günther Palm(eds.) Poster Proceedings of the 27th Annual German Conference on Artificial Intelligence

2005-01 Armin Wolf, Thom Frühwirth, Marc Meister (eds.) 19th Workshop on (Constraint) Logic Programming

2005-02 Wolfgang Lindner (Hg.), Universität Ulm , Christopher Wolf (Hg.) KU Leuven 2. Krypto-Tag – Workshop über Kryptographie, Universität Ulm

2005-03 Walter Guttmann, Markus Maucher Constrained Ordering

2006-01 Stefan Sarstedt Model-Driven Development with ACTIVECHARTS, Tutorial

2006-02 Alexander Raschke, Ramin Tavakoli Kolagari Ein experimenteller Vergleich zwischen einer plan-getriebenen und einer leichtgewichtigen Entwicklungsmethode zur Spezifikation von eingebetteten Systemen

2006-03 Jens Kohlmeyer, Alexander Raschke, Ramin Tavakoli Kolagari Eine qualitative Untersuchung zur Produktlinien-Integration über Organisationsgrenzen hinweg

2006-04 Thorsten Liebig Reasoning with OWL - System Support and Insights –

2008-01 H.A. Kestler, J. Messner, A. Müller, R. Schuler On the complexity of intersecting multiple circles for graphical display

2008-02 Manfred Reichert, Peter Dadam, Martin Jurisch,l Ulrich Kreher, Kevin Göser, Markus Lauer

Architectural Design of Flexible Process Management Technology

2008-03 Frank Raiser Semi-Automatic Generation of CHR Solvers from Global Constraint Automata

2008-04 Ramin Tavakoli Kolagari, Alexander Raschke, Matthias Schneiderhan, Ian Alexander Entscheidungsdokumentation bei der Entwicklung innovativer Systeme für produktlinien-basierte Entwicklungsprozesse

2008-05 Markus Kalb, Claudia Dittrich, Peter Dadam

Support of Relationships Among Moving Objects on Networks

2008-06 Matthias Frank, Frank Kargl, Burkhard Stiller (Hg.) WMAN 2008 – KuVS Fachgespräch über Mobile Ad-hoc Netzwerke

2008-07 M. Maucher, U. Schöning, H.A. Kestler An empirical assessment of local and population based search methods with different degrees of pseudorandomness

2008-08 Henning Wunderlich Covers have structure

2008-09 Karl-Heinz Niggl, Henning Wunderlich Implicit characterization of FPTIME and NC revisited

2008-10 Henning Wunderlich On span-Pсс and related classes in structural communication complexity

2008-11 M. Maucher, U. Schöning, H.A. Kestler On the different notions of pseudorandomness

2008-12 Henning Wunderlich On Toda’s Theorem in structural communication complexity

2008-13 Manfred Reichert, Peter Dadam Realizing Adaptive Process-aware Information Systems with ADEPT2

2009-01 Peter Dadam, Manfred Reichert The ADEPT Project: A Decade of Research and Development for Robust and Fexible Process Support Challenges and Achievements

2009-02 Peter Dadam, Manfred Reichert, Stefanie Rinderle-Ma, Kevin Göser, Ulrich Kreher, Martin Jurisch Von ADEPT zur AristaFlow® BPM Suite – Eine Vision wird Realität “Correctness by Construction” und flexible, robuste Ausführung von Unternehmensprozessen

2009-03 Alena Hallerbach, Thomas Bauer, Manfred Reichert Correct Configuration of Process Variants in Provop

2009-04 Martin Bader

On Reversal and Transposition Medians

2009-05 Barbara Weber, Andreas Lanz, Manfred Reichert Time Patterns for Process-aware Information Systems: A Pattern-based Analysis

2009-06 Stefanie Rinderle-Ma, Manfred Reichert Adjustment Strategies for Non-Compliant Process Instances

2009-07 H.A. Kestler, B. Lausen, H. Binder H.-P. Klenk. F. Leisch, M. Schmid

Statistical Computing 2009 – Abstracts der 41. Arbeitstagung

2009-08 Ulrich Kreher, Manfred Reichert, Stefanie Rinderle-Ma, Peter Dadam Effiziente Repräsentation von Vorlagen- und Instanzdaten in Prozess-Management-Systemen

2009-09 Dammertz, Holger, Alexander Keller, Hendrik P.A. Lensch Progressive Point-Light-Based Global Illumination

2009-10 Dao Zhou, Christoph Müssel, Ludwig Lausser, Martin Hopfensitz, Michael Kühl, Hans A. Kestler Boolean networks for modeling and analysis of gene regulation

2009-11 J. Hanika, H.P.A. Lensch, A. Keller Two-Level Ray Tracing with Recordering for Highly Complex Scenes

2009-12 Stephan Buchwald, Thomas Bauer, Manfred Reichert Durchgängige Modellierung von Geschäftsprozessen durch Einführung eines

Abbildungsmodells: Ansätze, Konzepte, Notationen

2010-01 Hariolf Betz, Frank Raiser, Thom Frühwirth A Complete and Terminating Execution Model for Constraint Handling Rules

2010-02 Ulrich Kreher, Manfred Reichert

Speichereffiziente Repräsentation instanzspezifischer Änderungen in Prozess-Management-Systemen

2010-03 Patrick Frey

Case Study: Engine Control Application 2010-04 Matthias Lohrmann und Manfred Reichert

Basic Considerations on Business Process Quality 2010-05 HA Kestler, H Binder, B Lausen, H-P Klenk, M Schmid, F Leisch (eds):

Statistical Computing 2010 - Abstracts der 42. Arbeitstagung 2010-06 Vera Künzle, Barbara Weber, Manfred Reichert

Object-aware Business Processes: Properties, Requirements, Existing Approaches

2011-01 Stephan Buchwald, Thomas Bauer, Manfred Reichert Flexibilisierung Service-orientierter Architekturen

2011-02 Johannes Hanika, Holger Dammertz, Hendrik Lensch Edge-Optimized À-Trous Wavelets for Local Contrast Enhancement with Robust Denoising

2011-03 Stefanie Kaiser, Manfred Reichert

Datenflussvarianten in Prozessmodellen: Szenarien, Herausforderungen, Ansätze 2011-04 Hans A. Kestler, Harald Binder, Matthias Schmid, Friedrich Leisch, Johann M. Kraus

(eds): Statistical Computing 2011 - Abstracts der 43. Arbeitstagung

2011-05 Vera Künzle, Manfred Reichert

PHILharmonicFlows: Research and Design Methodology 2011-06 David Knuplesch, Manfred Reichert

Ensuring Business Process Compliance Along the Process Life Cycle 2011-07 Marcel Dausend

Towards a UML Profile on Formal Semantics for Modeling Multimodal Interactive Systems

2011-08 Dominik Gessenharter

Model-Driven Software Development with ACTIVECHARTS - A Case Study 2012-01 Andreas Steigmiller, Thorsten Liebig, Birte Glimm

Extended Caching, Backjumping and Merging for Expressive Description Logics 2012-02 Hans A. Kestler, Harald Binder, Matthias Schmid, Johann M. Kraus (eds):

Statistical Computing 2012 - Abstracts der 44. Arbeitstagung 2012-03 Felix Schüssel, Frank Honold, Michael Weber

Influencing Factors on Multimodal Interaction at Selection Tasks 2012-04 Jens Kolb, Paul Hübner, Manfred Reichert

Model-Driven User Interface Generation and Adaption in Process-Aware Information Systems

2012-05 Matthias Lohrmann, Manfred Reichert

Formalizing Concepts for Efficacy-aware Business Process Modeling* 2012-06 David Knuplesch, Rüdiger Pryss, Manfred Reichert

A Formal Framework for Data-Aware Process Interaction Models 2013-01 Frank Kargl Abstract Proceedings of the 7th Workshop on Wireless and Mobile Ad- Hoc Networks (WMAN 2013) 2013-02 Andreas Lanz, Manfred Reichert, Barbara Weber

A Formal Semantics of Time Patterns for Process-aware Information Systems

2013-03 Matthias Lohrmann, Manfred Reichert Demonstrating the Effectiveness of Process Improvement Patterns with Mining Results

Ulmer Informatik-Berichte ISSN 0939-5091 Herausgeber: Universität Ulm Fakultät für Ingenieurwissenschaften und Informatik 89069 Ulm