Publikationen zum Fachbereich Deklarative Modelle

Konferenzbeiträge und Beiträge auf Workshops

• Dirk Fahland, Daniel Lübke, Jan Mendling, Hajo Reijers, Barbara Weber, Matthias Weidlich, and Stefan Zugal. Declarative versus Imperative Process Modeling Languages: The Issue of Understandability. In John Krogstie, Terry Halpin, and Erik Proper, editors, Proceedings of the 14th International Conference on Exploring Modeling Methods in Systems Analysis and Design (EMMSAD'09), volume 29 of Lecture Notes in Business Information Processing, Amsterdam, The Netherlands, pages 353-366, June 2009. Springer-Verlag. Note: (to appear).

  Abstract: Advantages and shortcomings of different process modeling languages are heavily debated, both in academia and industry, but little evidence is presented to support judgements. With this paper we aim to contribute to a more rigorous, theoretical discussion of the topic by drawing a link to well-established research on program comprehension. In particular, we focus on imperative and declarative techniques of modeling a process. Cognitive research has demonstrated that imperative programs deliver sequential information much better while declarative programs offer clear insight into circumstantial information. In this paper we show that in principle this argument can be transferred to respective features of process modeling languages. Our contribution is a pair of propositions that are routed in the cognitive dimensions framework. In future research, we aim to challenge these propositions by an experiment.

  

• Dirk Fahland, Jan Mendling, Hajo Reijers, Barbara Weber, Matthias Weidlich, and Stefan Zugal. Declarative vs. Imperative Process Modeling Languages: The Issue of Maintainability. In Bela Mutschler, Roel Wieringa, and Jan Recker, editors, 1st International Workshop on Empirical Research in Business Process Management (ER-BPM'09), Ulm, Germany, pages 65-76, September 2009. Note: (LNBIP to appear).

  Abstract: The rise of interest in declarative languages for process modeling both justifies and demands empirical investigations into their presumed advantages over more traditional, imperative alternatives. Our concern in this paper is with the ease of maintaining business process models, for example due to changing performance or conformance demands. We aim to contribute to a rigorous, theoretical discussion of this topic by drawing a link to well-established research on maintainability of information artifacts.

  

• Dirk Fahland. Modeling and Verifying Declarative Workflows. In Dagstuhl ''zehn plus eins'', Aachen, pages 135, 2007. Verlagshaus Mainz.

• Dirk Fahland. Synthesizing Petri nets from LTL specifications - An engineering approach. In Stephan Philippi and Alexander Pinl, editors, Proceedings 14.Workshop Algorithmen und Werkzeuge für Petrinetze (AWPN), Arbeitsbericht aus dem Fach Informatik, Nr. 25/2007, Universität Koblenz-Landau, D, pages 69--74, September 2007.

  Abstract: In this paper we present a pattern-based approach for synthesizing truly distributed Petri nets from a class of LTL specifications. The synthesis allows for the automatic, correct generation of humanly conceivable Petri nets, thus circumventing a manual construction of nets, or the use of Büuchi automata which are not distributed and often less intuitive to understand.

  

• Dirk Fahland. Towards Analyzing Declarative Workflows. In Jana Koehler, Marco Pistore, Amit P. Sheth, Paolo Traverso, and Martin Wirsing, editors, Autonomous and Adaptive Web Services, number 07061 of Dagstuhl Seminar Proceedings, 2007. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany.

  Abstract: Enacting tasks in a workflow cannot always follow a pre-defined process model. In application domains like disaster management workflows are partially specified and circumstances of their enactment change. There exist various approaches for formal workflow models that are effective in such situations, like declarative specifications instead of operational models for formalizing flexible workflow process. These powerful models leave a gap to existing techniques in the domain of workflow modeling, workflow analysis, and workflow management. In this paper we bridge this gap with a compositional mechanism for translating declarative workflow models to operational workflow models. The mechanism is of a general nature and we reveal its principles as we provide an exemplary definition for translating DecSerFlow models based on LTL to Petri nets. We then demonstrate its use in analyzing and refining declarative models.

  

zurück zur Übersicht