Incremental computation of synthesis rules for free-choice Petri nets
| Autor: | Dixit, Prabhakar M., Verbeek, H. M.W., van der Aalst, Wil M.P., Ölveczky, Peter Csaba, Bae, Kyungmin |
|---|---|
| Přispěvatelé: | Process Science |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Structure (mathematical logic)
Free-choice Petri nets Theoretical computer science Incremental synthesis rules computation Event (computing) Computer science Business process Computation 0102 computer and information sciences 02 engineering and technology Petri net Interactive system Net (mathematics) 01 natural sciences Interactive editing 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Free choice petri nets |
| Zdroj: | Formal Aspects of Component Software-15th International Conference, FACS 2018, Proceedings, 97-117 STARTPAGE=97;ENDPAGE=117;TITLE=Formal Aspects of Component Software-15th International Conference, FACS 2018, Proceedings Formal Aspects of Component Software ISBN: 9783030021450 FACS |
| Popis: | In this paper, we propose a novel approach that calculates all the possible applications of synthesis rules, for well-formed free-choice Petri nets [8], in a speedy way to enable an interactive editing system. The proposed approach uses a so-called incremental synthesis structure, which can be used to extract all the synthesis rules, corresponding to a given net. Furthermore, this structure is updated incrementally, i.e. after usage of a synthesis rule, to obtain the incremental synthesis structure of the newly synthesized net. We prove that the proposed approach is correct and complete in order to synthesize any well-formed free-choice Petri net, starting with an initial well-formed atomic net and the corresponding incremental synthesis structure. A variant of the proposed approach has been implemented that allows interactive modeling (discovery) of sound business processes (from event logs). Experimental results show that the proposed approach is fast, and outperforms the baseline, and hence is well-suited for enabling interactive synthesis of very large nets. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|