884 Hits in 4.2 sec

Introduction [chapter]

Wil M. P. van der Aalst
2011 Process Mining  
M.P. van der Aalst Schleiden, Germany December 2010  ...  Wil M.P. van der Aalst Schleiden, Germany December 2010 Many individuals and organizations contributed to the techniques and tools described in this book.  ... 
doi:10.1007/978-3-642-19345-3_1 fatcat:64nerr5y7jfp5gtzazbsjxjjoy

Object-Centric Behavioral Constraints [article]

Wil M. P. van der Aalst, Guangming Li, Marco Montali
2017 arXiv   pre-print
always hold (P) and not just eventually (♦).  ...  At any point in time a delivery corresponds to one of more order lines (denoted P 1.. * ) and an order line refers to as most one delivery (denoted P 0..1).  ... 
arXiv:1703.05740v1 fatcat:ndfsvbd62vdlhlb3l5civxhwdi

Behavioral Service Substitution [chapter]

Christian Stahl, Wil M. P. van der Aalst
2013 Web Services Foundations  
P. van der Aalst Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, PO Box 513, 5600 MB Eindhoven, The Netherlands e-mail: C.Stahl|W.M.P.v.d.Aalst@tue.An illustration showing  ...  ChristianFig. 1. 1 1 Stahl and Wil M.  ... 
doi:10.1007/978-1-4614-7518-7_9 fatcat:xjxx36m5undzpoc4uguvbdijui

Introduction [chapter]

Marlon Dumas, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede
2005 Process-Aware Information Systems  
The results can be applied to specific languages or pairs thereof, like for example WF nets (van der Aalst 1998), YAWL (van der Aalst & ter Hofstede 2003), or BPEL (Andrews, Curbera, Dholakia, Goland,  ...  In previous work, well-known notions of equivalence such as trace equivalence (Wombacher & Mahleko 2002) , weak bisimulation , and branching bisimulation (van der Aalst & Basten 2002) have been used in  ... 
doi:10.1002/0471741442.ch1 fatcat:gqxtolzc7rafpjefbk6hor4zcq

Compositional Service Trees [chapter]

Wil M. P. van der Aalst, Kees M. van Hee, Peter Massuthe, Natalia Sidorova, Jan Martijn van der Werf
2009 Lecture Notes in Computer Science  
Thus, A ⊕ B : mσ −→ m t −→ m (i.e. m (p) = m(p) − • t(p) + t • (p) = m (p) − • t(p) + t • (p) = m (p) .  ...  Sinceσ ∈ (T B ) * , for all places pP A holds m(p) = m(p) = m (p) and there exists a marking m ∈ R(A ⊕ B) such that A ⊕ B : m t =⇒ m and m Rm .  ... 
doi:10.1007/978-3-642-02424-5_17 fatcat:wigbv3kytzcf7c25cb3fynenyy

Context-Aware Compliance Checking [chapter]

Jan Martijn E. M. van der Werf, H. M. W. Verbeek, Wil M. P. van der Aalst
2012 Lecture Notes in Computer Science  
The set of all instances of M is denoted by I(M ).  ...  An instance of a context model M = (O, α, ι, R, σ, τ) is a 3-tuple (I O , I A , I R ) where -I O : O → P(U) defines the available concept instances.  ... 
doi:10.1007/978-3-642-32885-5_7 fatcat:bcxf2pqdtzbkxdpfdr3ldztrie

Freezing Sub-Models During Incremental Process Discovery: Extended Version [article]

Daniel Schuster, Sebastiaan J. van Zelst, Wil M. P. van der Aalst
2021 arXiv   pre-print
m n .  ...  ·σ m · (r, close) | m≥1 ∧ ∀1≤i≤m σ i ∈ RS( T (v 1 )) ∧ ∀1≤i≤m−1 σ i ∈RS( T (v 2 )) Definition 4 (Process Tree Language).  ...  Tc ← T p T (rc) ; // try next higher subtree as insert candidate 13 apply post-processing to T ; // remove non-required nodes/simplify tree 14 return T ; // corresponds to T in Figure 5  ... 
arXiv:2108.00215v1 fatcat:lu2xyjispbbqbpq5zi4xcdulde

Alignment Approximation for Process Trees [article]

Daniel Schuster and Sebastiaan van Zelst and Wil M. P. van der Aalst
2020 arXiv   pre-print
., SA:T →P(A) and EA:T →P(A). If T is not a leaf node, we refer to its two subtrees as T 1 and T 2 .  ...  m n .  ... 
arXiv:2009.14094v2 fatcat:jzzebuj2nrbqrevds5je3pz24a

Interactive Process Improvement using Simulation of Enriched Process Trees [article]

Mahsa Pourbafrani, Wil M. P. van der Aalst
2022 arXiv   pre-print
Pourbafrani and Wil M. P. van der Aalst Table 3: A sample example of EMD measurement for two event logs [19].  ...  Pourbafrani and Wil M. P. van der Aalst Table 1: A part of a sample event log. Each row represents an event.  ... 
arXiv:2201.07755v1 fatcat:ksg44dhqtbbu5fyw6luhrchfpa

Data Scientist: The Engineer of the Future [chapter]

Wil M. P. van der Aalst
2014 Enterprise Interoperability VI  
pu te r sc ie nc e co m pu te r sc ie nc e d a ta s c ie n c e d a ta s c ie n c e Fig. 9 .  ...  technical skills, is creative and communicative, and is able to realize end-to-end solutions. from several more traditional disciplines like mathematics and computer science. mathematics mathematics co m  ... 
doi:10.1007/978-3-319-04948-9_2 fatcat:lwifwplhbbdvpdgdecvz4nuwrm

EMiT: A Process Mining Tool [chapter]

Boudewijn F. van Dongen, Wil M. P. van der Aalst
2004 Lecture Notes in Computer Science  
The "P-net orientation" setting specifies whether the Petri net should be draw from left to right or from top to bottom. The "Page size" setting can be set to "A4" or "Letter".  ... 
doi:10.1007/978-3-540-27793-4_26 fatcat:tc25tioczrh7tfugjpmrwry5ba

Business Process Simulation Revisited [chapter]

Wil M. P. van der Aalst
2010 Lecture Notes in Business Information Processing  
Computer simulation attempts to "mimic" real-life or hypothetical behavior on a computer to see how processes or systems can be improved and to predict their performance under different circumstances. Simulation has been successfully applied in many disciplines and is considered to be a relevant and highly applicable tool in Business Process Management (BPM). Unfortunately, in reality the use of simulation is limited. Few organizations actively use simulation. Even organizations that purchase
more » ... ons that purchase simulation software (stand-alone or embedded in some BPM suite), typically fail to use it continuously over an extended period. This keynote paper highlights some of the problems causing the limited adoption of simulation. For example, simulation models tend to oversimplify the modeling of people working part-time on a process. Also simulation studies typically focus on the steady-state behavior of business processes while managers are more interested in short-term results (a "fast forward button" into the future) for operational decision making. This paper will point out innovative simulation approaches leveraging on recent breakthroughs in process mining.
doi:10.1007/978-3-642-15723-3_1 fatcat:kt45iwq4inabfmo2lo3lwleoyy

Patterns of Process Modeling [chapter]

Wil M. P. van der Aalst, Arthur H. M. ter Hofstede, Marlon Dumas
2005 Process-Aware Information Systems  
If the ordered goods are available, wil put a token in .  ...  The discriminator is a special case of the n-out-of-m join (sometimes referred to as partial join [6] ) as it corresponds to a 1-out-of-m join.  ... 
doi:10.1002/0471741442.ch8 fatcat:cs4b5q2svnehdlkwoy226ubb5e

Practical Aspect of Privacy-Preserving Data Publishing in Process Mining [article]

Majid Rafiei, Wil M. P. van der Aalst
2020 arXiv   pre-print
, ptlkc-privacy, and p-privacy-metadata.  ...  separate GitHub repositories. 3 To facilitate the usage and integration of the privacy preservation techniques, they are also published as standard Python packages ( pp-role-mining, p-connector-dfg  ... 
arXiv:2009.11542v1 fatcat:vi2c6rda75hx3pmzgcawao4xbi

Business Process Simulation Survival Guide [chapter]

Wil M. P. van der Aalst
2014 Handbook on Business Process Management 1  
IE[X] = p and Var[X] = p(1 − p). 0 ≤ p ≤ 1 k ∈ {0, 1} 1 − p k = 0 p k = 1 p p(1 − p) homogeneous a < b k ∈ {a, . . . , b} 1 (b−a)+1 a+b 2 (b−a)((b−a)+2) 12 binomial 0 ≤ p ≤ 1 k ∈ {0, 1, . . . , n} n k  ...  Most random generators generate a series of pseudo-random numbers X i m according to the formula: X n = (aX n−1 + b) modulo m For each i, X i is a number from the set {0, 1, 2, . . . , m − 1} and X i m  ... 
doi:10.1007/978-3-642-45100-3_15 dblp:series/ihis/Aalst15 fatcat:xsqulxdqknc4heekqtvz2he5va
« Previous Showing results 1 — 15 out of 884 results