@article{YousfiWeske2019, author = {Yousfi, Alaaeddine and Weske, Mathias}, title = {Discovering commute patterns via process mining}, series = {Knowledge and Information Systems}, volume = {60}, journal = {Knowledge and Information Systems}, number = {2}, publisher = {Springer}, address = {London}, issn = {0219-1377}, doi = {10.1007/s10115-018-1255-1}, pages = {691 -- 713}, year = {2019}, abstract = {Ubiquitous computing has proven its relevance and efficiency in improving the user experience across a myriad of situations. It is now the ineluctable solution to keep pace with the ever-changing environments in which current systems operate. Despite the achievements of ubiquitous computing, this discipline is still overlooked in business process management. This is surprising, since many of today's challenges, in this domain, can be addressed by methods and techniques from ubiquitous computing, for instance user context and dynamic aspects of resource locations. This paper takes a first step to integrate methods and techniques from ubiquitous computing in business process management. To do so, we propose discovering commute patterns via process mining. Through our proposition, we can deduce the users' significant locations, routes, travel times and travel modes. This information can be a stepping-stone toward helping the business process management community embrace the latest achievements in ubiquitous computing, mainly in location-based service. To corroborate our claims, a user study was conducted. The significant places, routes, travel modes and commuting times of our test subjects were inferred with high accuracies. All in all, ubiquitous computing can enrich the processes with new capabilities that go beyond what has been established in business process management so far.}, language = {en} } @article{YousfiHeweltBaueretal.2018, author = {Yousfi, Alaaeddine and Hewelt, Marcin and Bauer, Christine and Weske, Mathias}, title = {Toward uBPMN-Based patterns for modeling ubiquitous business processes}, series = {IEEE Transactions on Industrial Informatics}, volume = {14}, journal = {IEEE Transactions on Industrial Informatics}, number = {8}, publisher = {Inst. of Electr. and Electronics Engineers}, address = {Piscataway}, issn = {1551-3203}, doi = {10.1109/TII.2017.2777847}, pages = {3358 -- 3367}, year = {2018}, abstract = {Ubiquitous business processes are the new generation of processes that pervade the physical space and interact with their environments using a minimum of human involvement. Although they are now widely deployed in the industry, their deployment is still ad hoc . They are implemented after an arbitrary modeling phase or no modeling phase at all. The absence of a solid modeling phase backing up the implementation generates many loopholes that are stressed in the literature. Here, we tackle the issue of modeling ubiquitous business processes. We propose patterns to represent the recent ubiquitous computing features. These patterns are the outcome of an analysis we conducted in the field of human-computer interaction to examine how the features are actually deployed. The patterns' understandability, ease-of-use, usefulness, and completeness are examined via a user experiment. The results indicate that these four indexes are on the positive track. Hence, the patterns may be the backbone of ubiquitous business process modeling in industrial applications.}, language = {en} } @article{YousfiBatoulisWeske2019, author = {Yousfi, Alaaeddine and Batoulis, Kimon and Weske, Mathias}, title = {Achieving Business Process Improvement via Ubiquitous Decision-Aware Business Processes}, series = {ACM Transactions on Internet Technology}, volume = {19}, journal = {ACM Transactions on Internet Technology}, number = {1}, publisher = {Association for Computing Machinery}, address = {New York}, issn = {1533-5399}, doi = {10.1145/3298986}, pages = {19}, year = {2019}, abstract = {Business process improvement is an endless challenge for many organizations. As long as there is a process, it must he improved. Nowadays, improvement initiatives are driven by professionals. This is no longer practical because people cannot perceive the enormous data of current business environments. Here, we introduce ubiquitous decision-aware business processes. They pervade the physical space, analyze the ever-changing environments, and make decisions accordingly. We explain how they can be built and used for improvement. Our approach can be a valuable improvement option to alleviate the workload of participants by helping focus on the crucial rather than the menial tasks.}, language = {en} } @unpublished{WeskeYangMaglio2012, author = {Weske, Mathias and Yang, Jian and Maglio, Paul P.}, title = {Special issue service oriented computing (ICSOC) guest editors' introduction}, series = {International journal of cooperative information systems}, volume = {21}, journal = {International journal of cooperative information systems}, number = {1}, publisher = {World Scientific}, address = {Singapore}, issn = {0218-8430}, doi = {10.1142/S0218843012020017}, pages = {1 -- 2}, year = {2012}, language = {en} } @article{WeskevanderAalstVerbeek2004, author = {Weske, Mathias and van der Aalst, Wil M. P. and Verbeek, H. M. W.}, title = {Advances in business process management}, issn = {0169-023X}, year = {2004}, language = {en} } @misc{WeskeSadiqSofferetal.2016, author = {Weske, Mathias and Sadiq, Shazia and Soffer, Pnina and Voelzer, Hagen}, title = {Preface to BPM 2014}, series = {Information systems}, volume = {56}, journal = {Information systems}, publisher = {Elsevier}, address = {Oxford}, issn = {0306-4379}, doi = {10.1016/j.is.2015.09.006}, pages = {233 -- 234}, year = {2016}, language = {en} } @unpublished{WeskeRinderleMaToumanietal.2013, author = {Weske, Mathias and Rinderle-Ma, Stefanie and Toumani, Farouk and Wolf, Karsten}, title = {Special section on BPM 2011 conference. - Special Issue}, series = {Information systems}, volume = {38}, journal = {Information systems}, number = {4}, publisher = {Elsevier}, address = {Oxford}, issn = {0306-4379}, doi = {10.1016/j.is.2013.01.003}, pages = {545 -- 546}, year = {2013}, language = {en} } @book{Weske2007, author = {Weske, Mathias}, title = {Business Process Management : Concepts, Languages, Architectures}, publisher = {Springer-Verlag Berlin Heidelberg}, address = {Berlin, Heidelberg}, isbn = {978-3-540-73521-2}, doi = {10.1007/978-3-540-73522-9}, pages = {368 S.}, year = {2007}, language = {en} } @article{WeidlichZiekowGaletal.2014, author = {Weidlich, Matthias and Ziekow, Holger and Gal, Avigdor and Mendling, Jan and Weske, Mathias}, title = {Optimizing event pattern matching using business process models}, series = {IEEE transactions on knowledge and data engineering}, volume = {26}, journal = {IEEE transactions on knowledge and data engineering}, number = {11}, publisher = {Inst. of Electr. and Electronics Engineers}, address = {Los Alamitos}, issn = {1041-4347}, doi = {10.1109/TKDE.2014.2302306}, pages = {2759 -- 2773}, year = {2014}, abstract = {A growing number of enterprises use complex event processing for monitoring and controlling their operations, while business process models are used to document working procedures. In this work, we propose a comprehensive method for complex event processing optimization using business process models. Our proposed method is based on the extraction of behaviorial constraints that are used, in turn, to rewrite patterns for event detection, and select and transform execution plans. We offer a set of rewriting rules that is shown to be complete with respect to the all, seq, and any patterns. The effectiveness of our method is demonstrated in an experimental evaluation with a large number of processes from an insurance company. We illustrate that the proposed optimization leads to significant savings in query processing. By integrating the optimization in state-of-the-art systems for event pattern matching, we demonstrate that these savings materialize in different technical infrastructures and can be combined with existing optimization techniques.}, language = {en} } @article{WeidlichPolyvyanyyMendlingetal.2011, author = {Weidlich, Matthias and Polyvyanyy, Artem and Mendling, Jan and Weske, Mathias}, title = {Causal behavioural profiles - efficient computation, applications, and evaluation}, series = {Fundamenta informaticae}, volume = {113}, journal = {Fundamenta informaticae}, number = {3-4}, publisher = {IOS Press}, address = {Amsterdam}, issn = {0169-2968}, doi = {10.3233/FI-2011-614}, pages = {399 -- 435}, year = {2011}, abstract = {Analysis of behavioural consistency is an important aspect of software engineering. In process and service management, consistency verification of behavioural models has manifold applications. For instance, a business process model used as system specification and a corresponding workflow model used as implementation have to be consistent. Another example would be the analysis to what degree a process log of executed business operations is consistent with the corresponding normative process model. Typically, existing notions of behaviour equivalence, such as bisimulation and trace equivalence, are applied as consistency notions. Still, these notions are exponential in computation and yield a Boolean result. In many cases, however, a quantification of behavioural deviation is needed along with concepts to isolate the source of deviation. In this article, we propose causal behavioural profiles as the basis for a consistency notion. These profiles capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities of a process model. Consistency based on these profiles is weaker than trace equivalence, but can be computed efficiently for a broad class of models. In this article, we introduce techniques for the computation of causal behavioural profiles using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S-or T-nets. We also elaborate on the findings of applying our technique to three industry model collections.}, language = {en} }