Изменения

EPC метод был разработан в рамках [[ARIS]], проф. Wilhelm-August Scheer в  Institut für Wirtschaftsinformatik at the Universität des Saarlandes в начале 1990-х годов.<ref>а.-З. Scheer (2002). "АРИС. Vom Geschäftsprozess zum Anwendungssystem". Springer. стр.20.</ref> Используется многими компаниями для моделирования, анализа и реорганизации бизнес-процессов.

EPC метод был разработан в рамках [[ARIS]], проф. Wilhelm-August Scheer в  Institut für Wirtschaftsinformatik at the Universität des Saarlandes в начале 1990-х годов.<ref>а.-З. Scheer (2002). "АРИС. Vom Geschäftsprozess zum Anwendungssystem". Springer. стр.20.</ref> Используется многими компаниями для моделирования, анализа и реорганизации бизнес-процессов.

To quote from a publication on EPCs:<ref>Anni Tsai et al. (2006). "EPC Workflow Model to WIFA Model Conversion". In: ''2006 IEEE International Conference on Systems, Man, and Cybernetics, Taipei, Taiwan'', pp. 2758-2763]</ref> "An EPC is an [[ordered graph]] of events and functions. It provides various connectors that allow alternative and parallel execution of processes. Furthermore it is specified by the usages of logical operators, such as OR, AND, and XOR. A major strength of EPC is claimed to be its simplicity and easy-to-understand notation. This makes EPC a widely acceptable technique to denote business processes."

Цитата из публикации по EPC:<ref>Anni Tsai et al. (2006). "EPC Workflow Model to WIFA Model Conversion". In: ''2006 IEEE International Conference on Systems, Man, and Cybernetics, Taipei, Taiwan'', pp. 2758-2763]</ref> "EPC является [[упорядоченный граф|упорядоченным графом]] событий и функций. Он предоставляет собой различные соединения, позволяющие описывать альтернативное и параллельное выполнение процессов. Кроме того, он определяется использованием логических операторов, таких как OR, AND И XOR. Основная сила EPC, как утверждается, в его простоте и легком для понимания виде. Это делает EPC широко приемлемых методов для описания бизнес-процессов."

The statement that EPCs are ordered graphs is also found in other literature, but is probably a misformulation: an ordered graph is a(n undirected) graph with an explicitly provided total node ordering, while EPCs are [[directed graph]]s for which no explicit node ordering is provided.  No restrictions actually appear to exist on the possible structure of EPCs, but nontrivial structures involving parallelism have ill-defined execution semantics; in this respect they resemble UML [[activity diagram]]s.  Several scientific articles are devoted to providing well-defined execution semantics for general EPCs.<ref>[[Wil van der Aalst]] (1999). [http://is.tm.tue.nl/staff/wvdaalst/publications/p74.pdf ''Formalization and Verification of Event-driven Process Chains'']. In ''Information & Software Technology 41(10)'', pp. 639-650</ref><ref>Kees van Hee et al. (2006). [http://www.win.tue.nl/~ooanea/papers/HOSCoopIS05.pdf "Colored Petri Nets to Verify Extended Event-Driven Process Chains"]. In ''Proc. of the 4th Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems (MSVVEIS06)'', May 23–24, 2006 Paphos, Cyprus, pp. 76-85.</ref>  One particular issue is that EPCs require non-local semantics,<ref>Ekkart Kindler (2006).  

The statement that EPCs are ordered graphs is also found in other literature, but is probably a misformulation: an ordered graph is a(n undirected) graph with an explicitly provided total node ordering, while EPCs are [[directed graph]]s for which no explicit node ordering is provided.  No restrictions actually appear to exist on the possible structure of EPCs, but nontrivial structures involving parallelism have ill-defined execution semantics; in this respect they resemble UML [[activity diagram]]s.  Several scientific articles are devoted to providing well-defined execution semantics for general EPCs.<ref>[[Wil van der Aalst]] (1999). [http://is.tm.tue.nl/staff/wvdaalst/publications/p74.pdf ''Formalization and Verification of Event-driven Process Chains'']. In ''Information & Software Technology 41(10)'', pp. 639-650</ref><ref>Kees van Hee et al. (2006). [http://www.win.tue.nl/~ooanea/papers/HOSCoopIS05.pdf "Colored Petri Nets to Verify Extended Event-Driven Process Chains"]. In ''Proc. of the 4th Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems (MSVVEIS06)'', May 23–24, 2006 Paphos, Cyprus, pp. 76-85.</ref>  One particular issue is that EPCs require non-local semantics,<ref>Ekkart Kindler (2006).