IDEAS home Printed from https://ideas.repec.org/p/ete/kbiper/486751.html
   My bibliography  Save this paper

A full R/I-net construct lexicon for declare constraints

Author

Listed:
  • Johannes De Smedt
  • Seppe vanden Broucke
  • Jochen De Weerdt
  • Jan Vanthienen

Abstract

Recently, declarative process languages are gaining ground as the procedural way of capturing activities in a fixed work-flow is deemed to be inflexible. Declare, one of the prime languages of the declarative process modeling paradigm, is composed of logic-based activity constraints which are event-driven. In this paper, a template-based conversion is proposed of every Declare constraint into a single Petri net fragment with weighted, reset and inhibitor arcs, i.e. a weighted R/I-net. As such, a formalization of the execution semantics of Declare is obtained, similar to linear temporal logic or regular expressions, but now expressed in the form of Petri nets. Equivalence of Declare constraints and the respective Petri net templates are analyzed at the theoretical level and by means of a simulation experiment.

Suggested Citation

  • Johannes De Smedt & Seppe vanden Broucke & Jochen De Weerdt & Jan Vanthienen, 2015. "A full R/I-net construct lexicon for declare constraints," Working Papers of Department of Decision Sciences and Information Management, Leuven 486751, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
    • Handle: RePEc:ete:kbiper:486751
    as

    Download full text from publisher

    File URL: https://lirias.kuleuven.be/retrieve/306482
    File Function: A full R/I-net construct lexicon for declare constraints
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ete:kbiper:486751. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: library EBIB (email available below). General contact details of provider: https://feb.kuleuven.be/KBI .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.