Using Declarative Workflow Modeling to Achieve Happiness in Life

This post has 839 words. Reading it will take approximately 4 minutes.

This is a presentation I’ve just finished (at the time of publication).  This presentation includes content from this presentation and these three demos.  To get more information, check either of these papers:

• M. Westergaard, “Better Algorithms for Analyzing and Enacting Declarative Workflow Languages Using LTL,” in Business Process Management, 2011, pp. 83-98.
  [Bibtex]

  @inproceedings{improved-translation,
  author = {Westergaard, Michael},
  affiliation = {Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands},
  title = {Better Algorithms for Analyzing and Enacting Declarative Workflow Languages Using LTL},
  booktitle = {Business Process Management},
  series = {Lecture Notes in Computer Science},
  editor = {Rinderle-Ma, Stefanie and Toumani, Farouk and Wolf, Karsten},
  publisher = {Springer Berlin / Heidelberg},
  isbn = {978-3-642-23058-5},
  keyword = {Computer Science},
  pages = {83-98},
  volume = {6896},
  url = {http://dx.doi.org/10.1007/978-3-642-23059-2_10},
  doi = {10.1007/978-3-642-23059-2_10},
  note = {10.1007/978-3-642-23059-2_10},
  abstract = {Declarative workflow languages are easy for humans to understand and use for specifications, but difficult for computers to check for consistency and use for enactment. Therefore, declarative languages need to be translated to something a computer can handle. One approach is to translate the declarative language to linear temporal logic (LTL), which can be translated to finite automata. While computers are very good at handling finite automata, the translation itself is often a road block as it may take time exponential in the size of the input. Here, we present algorithms for doing this translation much more efficiently (around a factor of 10,000 times faster and handling 10 times larger systems on a standard computer), making declarative specifications scale to realistic settings.},
  year = {2011}
  }

• M. Westergaard and F. M. Maggi, “Modeling and Verification of a Protocol for Operational Support Using Coloured Petri Nets,” in Applications and Theory of Petri Nets, 2011, pp. 169-188.
  [Bibtex]

  @inproceedings{osprotocol,
  author = {Westergaard, Michael and Maggi, Fabrizio Maria},
  affiliation = {Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands},
  title = {Modeling and Verification of a Protocol for Operational Support Using Coloured Petri Nets},
  booktitle = {Applications and Theory of Petri Nets},
  series = {Lecture Notes in Computer Science},
  editor = {Kristensen, Lars Michael and Petrucci, Laure},
  publisher = {Springer Berlin / Heidelberg},
  isbn = {},
  pages = {169-188},
  volume = {6709},
  doi = {10.1007/978-3-642-21834-7_10},
  note = {10.1007/978-3-642-21834-7_10},
  abstract = {In this paper, we describe the modeling and analysis of a protocol for operational support during workflow enactment. Operational support provides online replies to questions such as  is my execution valid?  and  how do I end the execution in the fastest/cheapest way? , and may be invoked multiple times for each execution.   Multiple applications (operational support providers) may be able to answer such questions, so a protocol supporting this should be able to handle multiple providers, maintain data between queries about the same execution, and discard information when it is no longer needed.    We present a coloured Petri net model of a protocol satisfying our requirements. The model is used both to make our requirements clear by building a model-based prototype before implementation and to verify that the devised protocol is correct.    We present techniques to make analysis of the large state-space of the model possible, including modeling techniques and an improved state representation for coloured Petri nets allowing explicit representation of state spaces with more than 108 states on a normal PC.    We briefly describe our implementation in the process mining tool ProM and how we have used it to improve an existing provider.},
  year = {2011}
  }

• M. Westergaard, “Access/CPN 2.0: A High-Level Interface to Coloured Petri Net Models,” in Applications and Theory of Petri Nets, L. M. Kristensen and L. Petrucci, Eds., Springer Berlin / Heidelberg, 2011, vol. 6709, pp. 328-337.
  [Bibtex]

  @incollection{accesscpn2,
  author = {Westergaard, Michael},
  affiliation = {Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands},
  title = {Access/CPN 2.0: A High-Level Interface to Coloured Petri Net Models},
  booktitle = {Applications and Theory of Petri Nets},
  series = {Lecture Notes in Computer Science},
  editor = {Kristensen, Lars Michael and Petrucci, Laure},
  publisher = {Springer Berlin / Heidelberg},
  isbn = {},
  pages = {328-337},
  volume = {6709},
  doi = {10.1007/978-3-642-21834-7_19},
  note = {10.1007/978-3-642-21834-7_19},
  abstract = {This paper introduces Access/CPN 2.0, which extends Access/ CPN with high-level primitives for interacting with coloured Petri net (CPN) models in Java programs. The primitives allow Java programs to monitor and interact with places and transitions during execution, and embed entire programs as subpages of CPN models or embed CPN models as parts of programs. This facilitates building environments for systematic testing of program components using a CPN models. We illustrate the use of Access/CPN 2.0 in the context of business processes by embedding a workflow system into a CPN model.},
  year = {2011}
  }

The four demos mentioned in the slide-set are embedded here in the order they are shown.

Using Declarative Workflow Modeling to Achieve Happiness in Life, 4.0 out of 5 based on 2 ratings