Publications 2013

  • [PDF] D. M. M. Schunselaar, T. F. van der Avoort, H. M. W. Verbeek, and W. M. P. van der Aalst, “Yawl in the cloud,” in Yawl 2013, Bonn, Germany, 2013.
    [Bibtex]
    @Conference{Schunselaar13,
    Title = {YAWL in the Cloud},
    Author = {Schunselaar, D. M. M. and Avoort, T. F. van der and Verbeek, H. M. W. and Aalst, W. M. P. van der},
    Booktitle = {YAWL 2013},
    Year = {2013},
    Address = {Bonn, Germany},
    Month = {June},
    Number = {982},
    Series = {CEUR-WS},
    Abstract = {In the context of the CoSeLoG project (which involves 10 Dutch municipalities), we realised a proof-of-concept implementation based on YAWL. The municipalities want to share a common IT infrastructure and learn from one another, but also allow for local differences. Therefore, we extended YAWL to run in a cloud-based environment leveraging on existing configuration possibilities. To support "YAWL in the Cloud" we developed load-balancing capabilities that allow for the distribution of work over multiple YAWL engines. Moreover, we extended YAWL with multi-tenancy capabilities: one municipality may effectively use multiple engines without knowing it and one engine may safely run the processes of multiple municipalities.},
    Owner = {hverbeek},
    Timestamp = {2013.05.08}
    }
  • D. M. M. Schunselaar, H. M. W. Verbeek, W. M. P. van der Aalst, and H. A. Reijers, “A framework for efficiently deciding language inclusion for sound unlabelled wf-nets,” in Joint proceedings of pnse’13 and modbe’13, milano, italy, june 24-25, 2013., 2013, pp. 135-154.
    [Bibtex]
    @InProceedings{Schunselaar13a,
    Title = {A Framework for Efficiently Deciding Language Inclusion for Sound Unlabelled WF-Nets},
    Author = {Schunselaar, D. M. M. and Verbeek, H. M. W. and Aalst, W. M. P. van der and Reijers, H. A.},
    Booktitle = {Joint Proceedings of PNSE'13 and ModBE'13, Milano, Italy, June 24-25, 2013.},
    Year = {2013},
    Editor = {Moldt, D.},
    Month = {June},
    Pages = {135--154},
    Publisher = {CEUR-WS.org},
    Series = {CEUR Workshop Proceedings},
    Volume = {989},
    Owner = {hverbeek},
    Timestamp = {2013.08.06},
    Url = {http://ceur-ws.org/Vol-989/paper06.pdf}
    }
  • H. M. W. Verbeek, “Bpi challenge 2012: the transition system case,” in Bpm 2012 workshops, 2013, pp. 225-226.
    [Bibtex]
    @InProceedings{Verbeek13,
    Title = {BPI Challenge 2012: The Transition System Case},
    Author = {H. M. W. Verbeek},
    Booktitle = {BPM 2012 Workshops},
    Year = {2013},
    Editor = {La Rosa, M. and Soffer, P.},
    Note = {To appear},
    Pages = {225--226},
    Publisher = {Springer},
    Series = {LNBIP},
    Volume = {132},
    File = {Preprint:http\://www.win.tue.nl/~hverbeek/downloads/preprints/Verbeek12c.pdf:URL},
    Owner = {hverbeek},
    Timestamp = {2012.10.08},
    Url = {http://www.win.tue.nl/~hverbeek/downloads/preprints/Verbeek12c.pdf}
    }
  • H. M. W. Verbeek and W. M. P. van der Aalst, “An experimental evaluation of passage-based process discovery,” in Bpm 2012 workshop, 2013, pp. 205-210.
    [Bibtex]
    @InProceedings{Verbeek13a,
    Title = {An Experimental Evaluation of Passage-Based Process Discovery},
    Author = {Verbeek, H. M. W and Aalst, W. M. P. van der},
    Booktitle = {BPM 2012 Workshop},
    Year = {2013},
    Editor = {La Rosa, M. and Soffer, P.},
    Note = {To appear},
    Pages = {205--210},
    Publisher = {Springer},
    Series = {LNBIP},
    Volume = {132},
    Owner = {hverbeek},
    Timestamp = {2012.12.06}
    }
  • H. M. W. Verbeek and W. M. P. van der Aalst, “Decomposing replay problems: a case study,” in Joint proceedings of pnse’13 and modbe’13, milano, italy, june 24-25, 2013., 2013, pp. 219-235.
    [Bibtex]
    @InProceedings{Verbeek13c,
    Title = {Decomposing Replay Problems: A Case Study},
    Author = {Verbeek, H. M. W. and Aalst, W. M. P. van der},
    Booktitle = {Joint Proceedings of PNSE'13 and ModBE'13, Milano, Italy, June 24-25, 2013.},
    Year = {2013},
    Editor = {Moldt, D.},
    Month = {June},
    Pages = {219--235},
    Publisher = {CEUR-WS.org},
    Series = {CEUR Workshop Proceedings},
    Volume = {989},
    Owner = {hverbeek},
    Timestamp = {2013.08.06},
    Url = {http://ceur-ws.org/Vol-989/paper07.pdf}
    }
  • [PDF] H. M. W. Verbeek and W. M. P. van der Aalst, “Decomposing replay problems: a case study,” BPMcenter.org, BPM Center report BPM-13-09, 2013.
    [Bibtex]
    @TechReport{Verbeek13b,
    Title = {Decomposing Replay Problems: A Case Study},
    Author = {Verbeek, H. M. W and Aalst, W. M. P. van der},
    Institution = {BPMcenter.org},
    Year = {2013},
    Number = {BPM-13-09},
    Type = {BPM Center report},
    Owner = {hverbeek},
    Timestamp = {2013.05.07},
    Url = {http://bpmcenter.org/wp-content/uploads/reports/2013/BPM-13-09.pdf}
    }
  • [PDF] M. Westergaard and H. M. W. Verbeek, “Efficient implementation of simulation of prioritized transitions for high-level petri nets,” BPMcenter.org, BPM Center Report BPM-13-24, 2013.
    [Bibtex]
    @TechReport{Westergaard13,
    Title = {Efficient Implementation of Simulation of Prioritized Transitions for High-level Petri Nets},
    Author = {Westergaard, M. and Verbeek, H. M. W},
    Institution = {BPMcenter.org},
    Year = {2013},
    Number = {BPM-13-24},
    Type = {BPM Center Report},
    Abstract = {Transition priorities can be a useful mechanism when modeling using Petri nets. For example, exception handling can be modeled using high-priority transitions and background tasks can be modeled using low-priority transitions. Although transition priorities can be simulated in Petri nets using, e.g., inhibitor arcs, such constructs tend to unnecessarily clutter models. Hence, it is useful to support priorities directly. The main problem with transition priorities is that they introduce a nonlocal enabling condition. At first sight, this forces us to compute enabling for all transitions in a highest-priority-first order. However, this should be avoided whenever possible as computing whether transitions in high-level Petri nets are enabled is an expensive operation. This paper shows that we can minimize the number of enabling computations, and hence can do better. Experiments show that using the algorithms presented in this paper we can execute approximately 10 times as many transitions a second as is possible for simpler algorithms. This holds for both toy examples and real-life models, though the gain is often larger for real-life models.},
    Owner = {hverbeek},
    Timestamp = {2013.10.17},
    Url = {http://bpmcenter.org/wp-content/uploads/reports/2013/BPM-13-24.pdf}
    }

Leave a Reply