Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory

Autor: Kalenkova, Anna, Carmona, Josep, Polyvyanyy, Artem, La Rosa, Marcello

Publikováno v: Fundamenta Informaticae. 183:293-317

State-of-the-art process discovery methods construct free-choice process models from event logs. Consequently, the constructed models do not take into account indirect dependencies between events. Whenever the input behaviour is not free-choice, thes

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a908f864b6893f2bf8ccc05a6f06c296
https://doi.org/10.3233/fi-2021-2089

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

Publikováno v: 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

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 i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d60b60241e50fddc0df5c9fb033e556
https://research.tue.nl/nl/publications/bdaccb73-a155-4cfc-ae66-80c6cbeb72c3

Extremal Throughputs in Free-Choice Nets

Autor: Anne Bouillard, Bruno Gaujal, Jean Mairesse

Publikováno v: 26th International Conference on Application and Theory of Petri Nets 2005
26th International Conference on Application and Theory of Petri Nets 2005, 2005, Miami, Florida, United States. pp.108-127
Discrete Event Dynamic Systems
Discrete Event Dynamic Systems, 2006, 16 (3), pp.327-352. ⟨10.1007/s10626-006-9326-y⟩
Discrete Event Dynamic Systems, Springer Verlag, 2006, 16 (3), pp.327-352. ⟨10.1007/s10626-006-9326-y⟩
Applications and Theory of Petri Nets 2005 ISBN: 9783540263012
ICATPN

Journal version: "Extremal throughput in free-choice nets", Discrete Event Dynamic Systems, vol. 16, n. 3, p. 327-352, 2006.; International audience; We give a method to compute the throughput in a timed live and bounded free-choice Petri net under a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da64dee8e7fc6296e2014cbfe4eabd7d
https://doi.org/10.1007/s10626-006-9326-y

Some observations on supervisory policies that enforce liveness in partially controlled Free-Choice Petri nets

Autor: Ramavarapu S. Sreenivas

Publikováno v: Mathematics and Computers in Simulation. 70:266-274

Every arc from a place to a transition in a Free-Choice Petri net (FCPN) is either the unique output arc of the place, or, the unique input arc to the transition [M.H.T. Hack, Analysis of production schemata by Petri nets, Master's thesis, Massachuse

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ccaf17d56669daa6958416616c7b7f82
https://doi.org/10.1016/j.matcom.2005.11.002

On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets

Autor: Ramavarapu S. Sreenivas

Publikováno v: Systems & Control Letters. 31:41-48

A Petri net (PN) (Peterson, 1981; Reisig, 1985) is said to be live if it is possible to fire any transition from every reachable marking, although not necessarily immediately. A free-choice Petri net FCPN) is a PN, where every arch from a place to a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::21a4fc5c9558602a9997cfc55a012f91
https://doi.org/10.1016/s0167-6911(97)00019-4