Publications 2008

  • [PDF] [DOI] W. M. P. van der Aalst, M. Dumas, C. Ouyang, A. Rozinat, and H. M. W. Verbeek, “Conformance checking of service behavior,” Acm transactions on internet technology (toit), vol. 8, iss. 3, pp. 1-30, 2008.
    [Bibtex]
    @Article{Aalst08a,
    Title = {Conformance Checking of Service Behavior},
    Author = {Aalst, W. M. P. van der and Dumas, M. and Ouyang, C. and Rozinat, A. and Verbeek, H. M. W.},
    Journal = {ACM Transactions on Internet Technology (TOIT)},
    Year = {2008},
    Number = {3},
    Pages = {1--30},
    Volume = {8},
    Abstract = {A service-oriented system is composed of independent software units, namely services, that interact with one another exclusively through message exchanges. The proper functioning of such system depends on whether or not each individual service behaves as the other services expect it to behave. Since services may be developed and operated independently, it is unrealistic to assume that this is always the case. This article addresses the problem of checking and quantifying how much the actual behavior of a service, as recorded in message logs, conforms to the expected behavior as specified in a process model. We consider the case where the expected behavior is defined using the BPEL industry standard (Business Process Execution Language for Web Services). BPEL process definitions are translated into Petri nets and Petri net-based conformance checking techniques are applied to derive two complementary indicators of conformance: fitness and appropriateness. The approach has been implemented in a toolset for business process analysis and mining, namely ProM, and has been tested in an environment comprising multiple Oracle BPEL servers.},
    Doi = {10.1145/1361186.1361189},
    File = {Preprint of published paper:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Aalst08a:URL;CFP Special issue on Middleware for Service-Oriented Computing:http\://www.cis.uoguelph.ca/~qmahmoud/soa-middleware-cfp.pdf:PDF;ACM TOIT:http\://www.acm.org/toit/:URL},
    Owner = {hverbeek},
    Timestamp = {2008.11.03},
    Url = {http://portal.acm.org/ft_gateway.cfm?id=1361189&type=pdf&coll=GUIDE&dl=GUIDE&CFID=35617930&CFTOKEN=70387686}
    }
  • [PDF] W. M. P. van der Aalst, K. M. van Hee, A. H. M. ter Hofstede, N. Sidorova, H. M. W. Verbeek, M. Voorhoeve, and M. T. Wynn, “Soundness of workflow nets with reset arcs is undecidable!,” in Proceedings of the international workshop on concurrency methods issues and applications (china’08), J. Kleijn and M. Koutny, Eds., Xi’an, China: Xidian University, 2008, pp. 57-72.
    [Bibtex]
    @InCollection{Aalst08b,
    Title = {Soundness of Workflow Nets with Reset Arcs is Undecidable!},
    Author = {Aalst, W. M. P. van der and Hee, K. M. van and Hofstede, A. H. M. ter and Sidorova, N. and Verbeek, H. M. W. and Voorhoeve, M. and Wynn, M. T.},
    Booktitle = {Proceedings of the International Workshop on Concurrency Methods Issues and Applications (CHINA'08)},
    Publisher = {Xidian University},
    Year = {2008},
    Address = {Xi'an, China},
    Editor = {Kleijn, J. and Koutny, M.},
    Month = {June},
    Pages = {57--72},
    Abstract = {Petri nets are often used to model and analyze workflows. Many workflow languages have been mapped onto Petri nets in order to provide formal semantics or to verify correctness properties. Typically, the so-called Workflow nets are used to model and analyze workflows and variants of the classical soundness property are used as a correctness notion. Since many workflow languages have cancelation features, a mapping to workflow nets is not always possible. Therefore, it is interesting to consider workflow nets with reset arcs. Unfortunately, soundness is undecidable for workflow nets with reset arcs. In this paper, we provide a proof and insights into the theoretical limits of workflow verification.},
    File = {CHINA'08:http\://homepages.cs.ncl.ac.uk/maciej.koutny/CHINA-2008.htm:URL;Preprint of published paper:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Aalst08b.pdf:PDF},
    Owner = {hverbeek},
    Timestamp = {2008.11.03},
    Url = {http://www.win.tue.nl/~hverbeek/downloads/preprints/Aalst08b.pdf}
    }
  • [PDF] W. M. P. van der Aalst, K. M. van Hee, A. H. M. ter Hofstede, N. Sidorova, H. M. W. Verbeek, M. Voorhoeve, and M. T. Wynn, “Soundness of workflow nets: classification, decidability, and analysis,” BPMcenter.org, BPM Center Report BPM-08-02, 2008.
    [Bibtex]
    @TechReport{Aalst08c,
    Title = {Soundness of Workflow Nets: Classification, Decidability, and Analysis},
    Author = {Aalst, W. M. P. van der and Hee, K. M. van and Hofstede, A. H. M. ter and Sidorova, N. and Verbeek, H. M. W. and Voorhoeve, M. and Wynn, M. T.},
    Institution = {BPMcenter.org},
    Year = {2008},
    Number = {BPM-08-02},
    Type = {BPM Center Report},
    Abstract = {Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check the so-called soundness property. This property guarantees the absence of livelocks, deadlocks, and other anomalies that can be detected without domain knowledge. Several authors have proposed alternative notions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or priorities. This paper provides an overview of the different notions of soundness and investigates these in the presence of different extensions of workflow nets. We will show that the eight soundness notions described in the literature are decidable for workflow nets. However, most extensions will make all of these notions undecidable. This nicely shows the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.},
    File = {BPMcenter.org:http\://www.bpmcenter.org/:URL;Preprint of published paper:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Aalst08c.pdf:PDF},
    Owner = {hverbeek},
    Timestamp = {2008.11.03},
    Url = {http://bpmcenter.org/wp-content/uploads/reports/2008/BPM-08-02.pdf}
    }
  • [PDF] W. M. P. van der Aalst, V. Rubin, H. M. W. Verbeek, B. F. van Dongen, E. Kindler, and C. W. Günther, “Process mining: a two-step approach to balance between underfitting and overfitting,” BPMcenter.org, BPM Center Report BPM-08-01, 2008.
    [Bibtex]
    @TechReport{Aalst08,
    Title = {Process Mining: A Two-Step Approach to Balance Between Underfitting and Overfitting},
    Author = {Aalst, W. M. P. van der and Rubin, V. and Verbeek, H. M. W. and Dongen, B. F. van and Kindler, E. and G\"{u}nther, C. W.},
    Institution = {BPMcenter.org},
    Year = {2008},
    Number = {BPM-08-01},
    Type = {BPM Center Report},
    Abstract = {Process mining includes the automated discovery of processes from event logs. Based on observed events (e.g., activities being executed or messages being exchanged) a process model is constructed. One of the essential problems in process mining is that one cannot assume to have seen all possible behavior. At best one has seen a representative subset. Therefore, classical synthesis techniques are not suitable as they aim at finding a model that is able to exactly reproduce the log. Existing process mining techniques try to avoid such “overfitting” by generalizing the model to allow for more behavior. This generalization is often driven by the representation language and very crude assumptions about completeness. As a result parts of the model are “overfitting” (allow only what has actually been observed) while other parts may be “underfitting” (allow for much more behavior without strong support for it). None of the existing techniques enables the user to control the balance between “overfitting” and “underfitting”. To address this, we propose a two-step approach. First, using a configurable approach, a transition system is constructed. Then, using the “theory of regions”, the model is synthesized. The approach has been implemented in the context of ProM and overcomes many of the limitations of traditional approaches.},
    File = {BPMcenter.org:http\://www.bpmcenter.org/:URL;Preprint of published paper:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Aalst08.pdf:PDF},
    Owner = {hverbeek},
    Timestamp = {2008.11.03},
    Url = {http://bpmcenter.org/wp-content/uploads/reports/2008/BPM-08-01.pdf}
    }
  • [PDF] W. M. P. van der Aalst and H. M. W. Verbeek, “Process mining in web services: the websphere case,” Ieee bulletin of the technical committee on data engineering (tcde), vol. 31, iss. 3, pp. 46-49, 2008.
    [Bibtex]
    @Article{Aalst08d,
    Title = {Process Mining in Web Services: The WebSphere Case},
    Author = {Aalst, W. M. P. van der and Verbeek, H. M. W.},
    Journal = {IEEE Bulletin of the Technical committee on Data Engineering (TCDE)},
    Year = {2008},
    Number = {3},
    Pages = {46--49},
    Volume = {31},
    Abstract = {Process mining has emerged as a way to discover or check the conformance of processes based on event logs. This enables organizations to learn from processes as they really take place. Since web services are distributed over autonomous parties, it is vital to monitor the correct execution of processes. Fortunately, the “web services stack” assists in collecting structured event logs. This information can be used to extract new information about service processes (e.g., bottlenecks, unused paths, etc.) and to check the conformance (e.g., deviations from some predefined process). In this paper, we illustrate the potential of process mining in the context of web services. In particular, we show what a process mining tool like ProM can contribute in IBM's WebSphere environment.},
    File = {TCDE:http\://tab.computer.org/tcde/bull_about.html:URL;Preprint of published paper:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Aalst08d.pdf:PDF},
    Owner = {hverbeek},
    Timestamp = {2008.11.03},
    Url = {http://sites.computer.org/debull/A08Sept/aalst.pdf}
    }
  • [PDF] K. M. van Hee, H. M. W. Verbeek, C. Stahl, and N. Sidorova, “A framework for linking and pricing no-cure-no-pay services,” Eindhoven University of Technology, Computer Science Report 08/19, 2008.
    [Bibtex]
    @TechReport{Hee08,
    Title = {A Framework for Linking and Pricing No-Cure-No-Pay Services},
    Author = {Hee, K. M. van and Verbeek, H. M. W. and Stahl, C. and Sidorova, N.},
    Institution = {Eindhoven University of Technology},
    Year = {2008},
    Number = {08/19},
    Type = {Computer Science Report},
    Abstract = {In this paper, we present a framework that allows us to orchestrate web services such that the web services involved in this orchestration interact properly. To achieve this, we predefine service interfaces and certain routing constructs. Furthermore, we define a number of rules to incrementally compute the price of such a properly interacting orchestration (i.e. a web service) from the price of its web services. The fact that a web service gets only payed after its service is delivered (no-cure-no-pay) is reflected by considering a probability of success. To determine a safe price that includes the risk a web service takes, we consider the variance of costs.},
    File = {Computer Science Reports:http\://library.tue.nl/catalog/TUEPublication.csp?Type=ComputerScienceReports&Sort=Year:URL;Preprint of published paper:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Hee08.pdf:PDF},
    Owner = {hverbeek},
    Timestamp = {2008.11.03},
    Url = {http://alexandria.tue.nl/repository/books/636538.pdf}
    }
  • [PDF] [DOI] J. Mendling, H. M. W. Verbeek, B. F. van Dongen, W. M. P. van der Aalst, and G. Neumann, “Detection and prediction of errors in epcs of the sap reference model,” Data and knowledge engineering (dke), vol. 64, iss. 1, pp. 312-329, 2008.
    [Bibtex]
    @Article{Mendling08,
    Title = {Detection and prediction of errors in EPCs of the SAP reference model},
    Author = {Mendling, J. and Verbeek, H. M. W. and Dongen, B. F. van and Aalst, W. M. P. van der and Neumann, G.},
    Journal = {Data and Knowledge Engineering (DKE)},
    Year = {2008},
    Number = {1},
    Pages = {312--329},
    Volume = {64},
    Abstract = {Up to now there is neither data available on how many errors can be expected in process model collections, nor is it understood why errors are introduced. In this article, we provide empirical evidence for these questions based on the SAP reference model. This model collection contains about 600 process models expressed as Event-driven Process Chains (EPCs). We translated these EPCs into YAWL models, and analyzed them using the verification tool WofYAWL. We discovered that at least 34 of these EPCs contain errors. Moreover, we used logistic regression to show that complexity of EPCs has a significant impact on error probability.},
    Doi = {10.1016/j.datak.2007.06.019},
    File = {DKE:http\://www.sciencedirect.com/science/journal/0169023X:URL;Preprint of published paper:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Mendling08.pdf:PDF},
    Owner = {hverbeek},
    Timestamp = {2008.11.03}
    }
  • [PDF] [DOI] H. M. W. Verbeek, A. J. Pretorius, W. M. P. van der Aalst, and J. J. van Wijk, “Assessing state spaces using petri net synthesis and attribute-based visualisation,” Lncs transactions on petri nets and other models of concurrency (topnoc) i, vol. 5100, pp. 152-171, 2008.
    [Bibtex]
    @Article{Verbeek08,
    Title = {Assessing State Spaces using Petri Net Synthesis and Attribute-based Visualisation},
    Author = {Verbeek, H. M. W. and Pretorius, A. J. and Aalst, W. M. P. van der and Wijk, J. J. van},
    Journal = {LNCS Transactions on Petri Nets and Other Models of Concurrency (ToPNoC) I},
    Year = {2008},
    Pages = {152--171},
    Volume = {5100},
    Abstract = {State spaces are commonly used representations of system behavior. A state space may be derived from a model of system behavior but can also be obtained through process mining. For a good understanding of the system's behavior, an analyst may need to assess the state space. Unfortunately, state spaces of realistic applications tend to be very large. This makes this assessment hard. In this paper, we tackle this problem by combining Petri-net synthesis (i.e., regions theory) and visualization. Using Petri-net synthesis we generate the attributes needed for attribute-based visualization. Using visualization we can assess the state space. We demonstrate that such an approach is possible and describe our implementation using existing tools. The only limiting factor of our approach is the performance of current synthesis techniques.},
    Comment = {Appeared as Vol. 5100 in hte LNCS series},
    Doi = {10.1007/978-3-540-89287-8_10},
    File = {ToPNoC:http\://dx.doi.org/10.1007/978-3-540-89287-8:URL;Preprint of published paper:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Verbeek08.pdf:URL},
    Owner = {hverbeek},
    Timestamp = {2008.11.03},
    Url = {http://www.springerlink.com/content/t3x70330x87wju72/fulltext.pdf}
    }

Leave a Reply