<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Rule-based Autocompletion of Business Process Models</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Thomas</forename><surname>Hornung</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Institute of Computer Science</orgName>
								<orgName type="institution">Albert-Ludwigs University Freiburg</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author role="corresp">
							<persName><forename type="first">Agnes</forename><surname>Koschmider</surname></persName>
							<email>koschmider|oberweis@aifb.uni-karlsruhe.de</email>
							<affiliation key="aff1">
								<orgName type="department">Institute of Applied Informatics and Formal Description Methods</orgName>
								<orgName type="institution">Universität Karlsruhe (TH)</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Andreas</forename><surname>Oberweis</surname></persName>
							<affiliation key="aff1">
								<orgName type="department">Institute of Applied Informatics and Formal Description Methods</orgName>
								<orgName type="institution">Universität Karlsruhe (TH)</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Rule-based Autocompletion of Business Process Models</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">704ABFB1767173345636829D67A678E5</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-25T06:56+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Several methods based upon textual programming languages or graphical notations have been proposed for manual modeling of business process models. But since manual process modeling is time-consuming and increases the amount of structural modeling errors, we aim at supporting the user during the process modeling phase. In this paper we present an initial idea for an automatic approach for completion of business process models that recommends appropriate completions to initial process fragments based on business rules and structural constraints.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>Manual process modeling is a time-consuming task and thus increases the total amount of modeling time. Typos and structural modeling errors make it particularly error-prone to model business processes manually. Therefore it would be useful to assist the user in modeling business processes by providing an autocompletion mechanism during process modeling. Usually, business process models are modeled according to specific business rules such as all high loss estimations must include an expert's inspection or if more than two persons travel together, the third pays only half price. Therefore to support automatic completion of such business process models, a data format with support for rule inferencing is required. By using Petri nets as the theoretical framework for this task, syntactic composition problems of initial process fragments and recommended process fragments can be solved. To be able to resolve conflicts on a semantical level, we introduce a description of rule-enhanced Petri nets with the ontology language OWL <ref type="bibr" target="#b0">[1]</ref> and the rule language SWRL <ref type="bibr" target="#b1">[2]</ref> in Section 2. Finally Section 3 sums up our approach.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Autocompletion Process</head><p>This section gives a high-level introduction in our proposal for an autocompletion mechanism for business process models as depicted in Figure <ref type="figure" target="#fig_0">1</ref>. The idea is that the user first selects a position in the process model and the recommendation system shows a list of meaningful process fragments that she can enter at this position. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1">Semantic business process models</head><p>A missing semantic representation of Petri net components hampers to utilize reasoning techniques that make it possible to (semi-)automatically reason about Petri net data. Therefore we describe traditional Petri nets with the Ontology Language OWL <ref type="bibr" target="#b2">[3]</ref>. These so-called semantic business process models (SBPM) combine process modeling methods with semantic technologies to support automatic processing of process components and they make it possible to implement an efficient algorithm for (semi-)automatic similarity computation between process model variants <ref type="bibr" target="#b3">[4]</ref>. Each Petri net element has a corresponding element in the SBPM as described in <ref type="bibr" target="#b0">[1]</ref> with two extensions: first we introduce a property isSelected with the domain Place or Transition and the range boolean (true or false) that ensures that appropriate recommendations are made only for the selected process element. The property initialElement with the domain PetriNet and the range Node (Place or Transition) indicates the start element of a process as depicted in Figure <ref type="figure" target="#fig_1">2</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2">Classification of rule types</head><p>Since ontologies are not good at modeling the dynamic state of Petri nets we additionally use the Semantic Web Rule Language (SWRL) to capture the dynamic nature of Petri nets and to model business rules that a process model needs to satisfy. Rule-based modeling in general ranges from Event-Condition-Action rules for databases <ref type="bibr" target="#b4">[5]</ref> to logic-based languages like Prolog <ref type="bibr" target="#b5">[6]</ref>, and rule engine approaches like Jess <ref type="bibr" target="#b6">[7]</ref>. We distinguish the following three types of rules in our autocompletion scenario:</p><p>1. Constraint rules: They concern the integrity of semantic business process models. These constraints are automatically pre-specified for every business process model by our autocompletion system, since they express restrictions on the OWL-based Petri net description, i.e. successors of places are transitions and vice versa. 2. Event-Condition-Action rules: They concern the integrity of semantic business process models and have a syntax described by IF, THEN, AND, OR, e.g. "If customer order is checked THEN manufacture item AND send article". 3. Dynamic rules: These rules are applied during process modeling by the modeler and may vary from one to another, e.g. "in a specific context an amount of 1000 Euro is considered a high loss".</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3">Formalization of rules</head><p>The next step of the autocompletion process is to formalize the rules which were classified in the previous section. To do this we first introduce the notion of order, i.e. which action is performed before or after the other. This is formalized with the SWRL predicates bef ore(action 1 , action 2 ) and af ter(action 1 , action 2 ), which evaluate to true, when action 1 appears before action 2 in the business process model or after respectively. These predicates can be specified on the semantic information provided by the OWL serialization of the process model ontology and allow for trivial checking of the constraint rules via an additional SWRL predicate arcP ossible(action, net), that is satisfied if the selected action is a transition and the first element in the process fragment under consideration is a place or vice versa.</p><p>To infer Event-Condition-Action style rules we compare the OWL version of the currently modeled process with given serializations of business process fragments in a repository. This is best illustrated with an example: given the business rule "IF request is checked THEN forward order" we would check the following conditions with the help of the beforementioned predicates:</p><p>1. The condition(s) of the IF part have to appear bef ore the selected element, and 2. The action(s) of the THEN part need to be either the first action of the process fragment or appear af ter the first element in the process fragment under consideration, and 3. The hypothetical connection of the currently modeled process fragment and the process fragment under consideration need to satisfy the constraint rules.</p><p>Finally dynamic rules can be realized by changing the action part of a business rule to a question for the modeler.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Conclusion</head><p>Often business processes are modeled according to specific business rules. In this paper we have described our idea of realizing an autocompletion of business process models. The main elements are that we use semantic business process models based on an OWL representation of Petri nets that allows us to efficiently compute the semantic similarity between process model variants. Additionally we use the Semantic Web Rule Language, which is based upon a combination of OWL DL with Unary/Binary Datalog RuleML <ref type="bibr" target="#b7">[8]</ref>, to model additional constraints imposed by business rules. Although the implementation of the recommendation system is not finished yet a study which has been conducted seems to confirm our approach.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 .</head><label>1</label><figDesc>Figure 1. Rule-based autocompletion process (rectangles depict transitions and circles depict places)</figDesc><graphic coords="2,137.18,140.84,324.00,103.68" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 .</head><label>2</label><figDesc>Figure 2. Extension of the Petri net Ontology introduced in [1]</figDesc><graphic coords="3,129.10,140.83,340.16,196.54" type="bitmap" /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Modeling semantic business process models</title>
		<author>
			<persName><forename type="first">A</forename><surname>Koschmider</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Oberweis</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Handbook of Ontologies for Business Interaction</title>
				<editor>
			<persName><forename type="first">P</forename><surname>Rittgen</surname></persName>
		</editor>
		<imprint>
			<publisher>Idea group publishing edn</publisher>
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
	<note>to appear)</note>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<title level="m" type="main">SWRL: A Semantic Web Rule Language Combining OWL and RuleML</title>
		<author>
			<persName><forename type="first">I</forename><surname>Horrocks</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Patel-Schneider</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Boley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Tabet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Grosof</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dean</surname></persName>
		</author>
		<ptr target="http://www.w3.org/Submission/2004/SUBM-SWRL-20040521/" />
		<imprint>
			<date type="published" when="2004">2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">OWL Web Ontology Language Overview</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">L</forename><surname>Mcguinness</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Van Harmelen</surname></persName>
		</author>
		<ptr target="http://www.w3.org/TR/owl-features/" />
	</analytic>
	<monogr>
		<title level="m">World Wide Web Consortium (W3C)</title>
				<imprint>
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
	<note type="report_type">Technical report</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Measuring Similarity between Semantic Business Process Models</title>
		<author>
			<persName><forename type="first">M</forename><surname>Ehrig</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Koschmider</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Oberweis</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. of the Fourth Asia-Pacific Conference on Conceptual Modelling</title>
				<meeting>of the Fourth Asia-Pacific Conference on Conceptual Modelling<address><addrLine>Australia</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
	<note>to appear</note>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Events in an Active Object-oriented Database System</title>
		<author>
			<persName><forename type="first">S</forename><surname>Gatziu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">R</forename><surname>Dittrich</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Rules in Database Systems</title>
				<imprint>
			<date type="published" when="1993">1993</date>
			<biblScope unit="page" from="23" to="39" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<author>
			<persName><forename type="first">W</forename><surname>Clocksin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Mellish</surname></persName>
		</author>
		<title level="m">Programming in Prolog</title>
				<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="1987">1987</date>
		</imprint>
	</monogr>
	<note>3 edn</note>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<author>
			<persName><forename type="first">E</forename><surname>Friedman-Hill</surname></persName>
		</author>
		<ptr target="http://herzberg.ca.sandia.gov/jess/" />
		<title level="m">Jess: the Java Expert System Shell, sandia national laboratories</title>
				<imprint>
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Design Rationale for RuleML: A Markup Language for Semantic Web Rules</title>
		<author>
			<persName><forename type="first">H</forename><surname>Boley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Tabet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Wagner</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">SWWS</title>
		<imprint>
			<biblScope unit="page" from="381" to="401" />
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
