<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Venice, Italy &amp; Moscow,
Russia
" yavkotylev@edu.hse.ru (Y.V. Kotylev); amitsyuk@hse.ru (A.A. Mitsyuk)
~ https://pais.hse.ru/en/ (A.A. Mitsyuk)</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Software System Behavior Can Be Analyzed with Visual Analytics</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yaroslav V. Kotylev</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexey A. Mitsyuk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Research University Higher School of Economics</institution>
          ,
          <addr-line>20 Myasnitskaya St., Moscow 101000</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>Enterprise software systems are usually large and complex. They can have complicated architecture and millions of diferent states. It is dificult to imagine a process of designing new software system or analysis of developed system without various modeling techniques. Visual presentation of the software system structure and behavior provides possibilities which can facilitate better analysis. Graphical notation of the Petri net formalism is often used for software system description. An extension of Petri net is the high-level Petri net formalism can be successfully used for the description of modular software systems. There are a lot of related tools that can be used for “static” visualization of high-level Petri net. The current work considers possible methods of dynamic visualization of high-level Petri nets which describe software system from behavioral perspective.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Software Visualization</kwd>
        <kwd>High-level Petri Nets</kwd>
        <kwd>Dynamic Visualization</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Complexity of enterprise software systems steadily grows year by year, release by release [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The
software system modeling process has already become too dificult to design and analyze it without
special models and tools. A Petri net is a mathematical modeling language for the description of
distributed systems. A Petri net has not only precise mathematical notation, but a graphical notation
as well [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. These two aspects made Petri nets useful for several areas such as: process modeling,
software system design and analysis, data analysis, etc.
      </p>
      <p>
        Modern software systems are characterized by large number of independent processes. For
instance, they are often implemented in service-oriented style. Service-oriented architecture (SOA)
represents a system as a set of independent components which provide services to another modules
via communication protocols over a network. Components often have shared resources, for example,
common data storage. As a result, enterprise systems confront two important issues: data integration
and data sharing [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. How to prove or at least analyze correctness of such systems? perception is
based on graphical visualization, Petri nets could be used for those purposes.
      </p>
      <p>Modern enterprise systems are too complex to analyze them as a single artefact. So that displaying
software systems as a plain graph will not be helpful. There are several approaches to reduce the
perception of complexity such as grouping or abstraction. For example, a dozen of modules of the
b)
system could be grouped by any common feature and could be considered as a single element with
hidden details.</p>
      <p>
        Hierarchical high-level Petri net is an extended formalism with the basic idea of constructing a
large model by combining a number of small Petri nets into a larger net [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. A hierarchical high-level
Petri net often can be translated into a behaviorally equivalent ordinary Petri net. In case of enterprise
system structure visualization, each part of the system could be depicted as an ordinary Petri net at
the lowest level of visualization abstraction and the set of modules could be drawn as a single element
at the highest level of abstraction.
      </p>
      <p>But visualization of “static” structure of the system does not cover all aspects of systems description.
Behavioral (or “dynamic’) aspect of a system is as important as its structure. In this paper we try to
ifnd ways to answer the question “How to visualize dynamics of a complex hierarchical system?”</p>
    </sec>
    <sec id="sec-2">
      <title>2. Software system analysis with high-level Petri nets visualization</title>
      <p>As Petri nets language is not only a mathematical formalism but graphical notation as well, it could
be used for software system visualization. We have already mentioned in Introduction section that
modern enterprise software systems are developed with a module-based approach. Modules can be
fully separated on the same level of hierarchy or nested into other modules, and anyway their
internal states are independent and communication between modules carried out overall network. But
nonetheless the modules often share common resources such as data. The extension of ordinary Petri
nets is the high-level Petri net formalism. It could be used for building visualizations of such
systems. Each module of the system can be represented as a single ordinary Petri net. And then, a set of
ordinary Petri nets can be aggregated to a hierarchical high-level Petri net to represent system as a
whole.</p>
      <p>
        There are several approaches for high-level Petri net visualization. One of them is hierarchical
layered-layout visualization [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The main idea of layered-layout approach is to display each element
net onto a single layer on distinct level with links to main net. Figure 1 a) shows a manual-made
visualization of a nested Petri net [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], and Figure 1 b) shows the same nested Petri net visualized
using layered layout (some element nets are collapsed).
      </p>
      <p>This method is useful for static analysis of Petri net structure, when users are able to collapse
needless element nets to hide redundant structures and expand element nets which are needed to be
analyzed to investigate them in detail. But this approach does not support any dynamic features. In
this work, we are going to consider dynamic visualization of real behavior of the system.</p>
      <sec id="sec-2-1">
        <title>2.1. What does it mean “real behavior” and how to analyze it?</title>
        <p>Let’s imagine that user has already had a software system prototype or a fully developed system.
And the model of the system is described in the high-level Petri net formalism. It is possible to run
the system on a test data and gather produced logs. Surely the logging part of the system should be
prepared in advance: logs should be presented entirely and in appropriate format. Each event record
should contain at least:
• timestamp;
• identifier of log activity (it’s needed to define a related transition of the Petri net model);
• thread identifier (for multi-thread or multi-agent environments).</p>
        <p>These logs can be used for replaying and visualizing system behavior on a high-level Petri net model.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Existing approaches to visualize process dynamics in information systems</title>
        <p>In this project, our aim is to achieve convenient visualization techniques by combining ideas from
graph drawing, process visualization, and introducing completely new ideas.</p>
        <p>Existing approaches to visualize process dynamics in information systems came mostly from
process modeling and process mining fields. In process modeling, many tools have been developed to
edit process models, show them graphically. They allow us to view and change model structure. Such
tools often enhanced with a simulation module/plug-in that is able to execute model step-by-step
showing changes in model state to the user.</p>
        <p>
          Let us consider several examples of modeling tools and editors. One of the tools applied in business
process management education is WoPeD [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] (https://woped.dhbw-karlsruhe.de/). It is suitable for
working with static workflow nets, editing their structure, calculating properties of these models.
        </p>
        <p>
          Another tool to deal with ordinary Petri nets is called Carassius [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] (https://pais.hse.ru/research/
projects/carassius). The tool is typical for such type of applications. It supports editing and visualizing
of Petri nets shown on a plane view.
        </p>
        <p>Carassius supports simulation of ordinary Petri nets. In this mode, a user can study how a system
modeled by the Petri net is executed due to P/T-net semantics. Figure 2 shows how Petri net simulation
looks in Carassius. Here the intensity of blue coloring depicts the time from the firing of a transition.
Yellow token is the one that has been produced at the last simulation step.</p>
        <p>
          At the same time, approaches have been proposed to visualize static structure of high-level Petri
nets of diferent types. Coloured Petri nets are one of the most commonly used type of high-level
Petri nets. They support a concept of hierarchy and complex control-flow constructs. CPN Tools [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]
(http://cpntools.org/) is a tool for Coloured Petri nets. Figure 3 shows the very basic CPN model.
        </p>
        <p>
          Reference nets is another type of high-level Petri nets which support the concept of hierarchy. Also
these nets support data-flow modeling. Renew [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] (http://www.renew.de/) is a well-designed tool for
modeling, analyzing, and simulating reference nets. A basic sample model during simulation process
is shown in Figure 4.
        </p>
        <p>What is common in all these tools supporting Petri net modeling? Models are shown using basic
graph drawing algorithms. Moreover, special algorithms for Petri net drawing can apply the fact that
an ordinary Petri net is s bipartite graphs. Petri net structure can be shown in a flat view independently
of their type. They have nodes and arcs of diferent types which are shown by rectangular, ellipse, and
arrow forms of diferent appearance. Petri net marking is usually shown by tokens in place nodes.
These tokens graphically depicted as dots or small circles inside larger places. Marking can also be
shown by a number of tokens in a corresponding place (like in Figure 4).</p>
        <p>It is important to mention that usually editors can not really show dynamics. They show static
pictures or GUI with structure and state of modeled system. These pictures are able to change because
of the user action.</p>
        <p>
          Rather diferent approach for visualizing process dynamics can be found in process mining. ProM
Framework [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] is the most developed open source process mining tool. This tool supports diferent
types of process visualization including dynamic views.
        </p>
        <p>
          Fuzzy mining [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] is used to discover process models which show how process activities relate
to each other via a directly follows relation and other relations. This approach is implemented as a
ProM-plugin Fuzzy miner. This plug-in is equipped with an ability to show dynamic visualizations
out of a model and an event log. Figure 5 shows how this visualization looks like.
        </p>
        <p>As earlier, we have a graph-based process model. Nodes represent process activities, while arcs
represent relations between these activities. For example, an arc connects two nodes if there is a
directly-follows relation between the two corresponding activities. Thus, the process structure is
shown. But we also can see black tokens which are actually moving through the model. Active arcs
are shown in red coloring. We can also see frequency of activities: frequent ones became dark-red
after several times.</p>
        <p>
          Another tool with the same capability is called Inductive visual miner [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. It is also implemented
as a ProM plug-in but now also exists as a separate tool. Inductive mining is one of the most popular
process discovery algorithms as it allows us to discover a well-structured process model consuming
a relatively short time period. Inductive miner is enhanced with a convenient GUI which is able to
visualize dynamics of the discovered process as it is shown in Figure 6. Yellow tokens run through
the model. More frequently executed parts of the model became more bluish with time.
        </p>
        <p>
          Both these approaches show to the user how real behavior from and event log can be replayed on the
corresponding process model. Commercial tools like Fluxicon Disco [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] (https://fluxicon.com/disco/)
or Celonis (https://www.celonis.com/) support the same functionality.
        </p>
        <p>
          Visual representation of process dynamics as process movies has been also researched for declarative
on-line discovery [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. Of interest is the approach of mapping event logs on specially prepared visual
backgrounds to show process characteristics [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <p>The goal of our project is to combine ideas of static graph-based model visualization for high-level
Petri nets with the concept of “process movies” from process mining which allow us to show process
dynamics recorded in event logs.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Why you can not visualize high-level Petri net dynamics easily?</title>
        <p>There are several dificulties related to dynamic visualization of software system behavior with
highlevel Petri nets. If the system is displayed as a whole, users will disperse concentration due to high
amount of redundant information. On the other hand, if the most system modules (element nets) are
collapsed as it feasibly in layered-layout approach, users will have a chance to lose important details
hidden in collapsed nets. Therefore, a method of auto hiding/exposition of element nets should be
proposed to maintain completeness-clarity visualization balance between details and system
complexity.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Objectives</title>
        <p>Let us summarize the main objective of the project. The main objective is to develop visual analytics
methods which will successfully catch process dynamics in multi-agent systems represented as
highlevel Petri nets. Proposed methods should take into attention key properties of multi-agent systems:
their complex and hierarchical multilevel structure; dynamic asynchronous agent activities,
communications and collaborations; large number of events and activities in such distributed systems. It is of
most importance to support user with visual tools to highlight the most important fraction of system
behaviour while shading immaterial detail. As navigation device shows only roads which are
important for driver, visual analytics tool should assist a researcher by highlighting the most significant
model parts.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Completeness-clarity balance</title>
      <p>We are going to introduce the four variables intended for automatic decision making on the
displaying/hiding element Petri nets during dynamic visualization of high-level Petri net model of the system
based on logs:
• rate of event importance;
• time interval of calculation;
• distance between time intervals;
• displaying threshold.</p>
      <p>Let us consider proposed values on the example of a typical learning management information
system (LMS). The system has a lot of diferent modules. Also, this system has been modeled using
the high-level Petri net formalism. In graphical notation, each module of the system is depicted as an
element Petri net. Also, system logs were translated into Petri net run. For example, the system has
an event - user submitted login and password. This event could be transformed into the following
part of the run: input tokens  1 (login),  2 (password) were removed from the place   1 and output
token  3 was added to the   2 with firing of transition   .</p>
      <p>One of the modules is an academic discipline support module. This module provides functions
related to learning process such as updating course info, uploading homework exercises by students.</p>
      <sec id="sec-3-1">
        <title>3.1. Rate of event importance</title>
        <p>The idea is to assign weights or measure of importance for each activity of the system. This measure
should be allocated by user to distinguish significant events and secondary events. The value of rate
of event importance will be taken into account to make a decision whether to display the element net
to which the activity belongs or not. The value of rate of event importance belongs to the interval
.
[0; + )8</p>
        <p>For instance, the system has logs for two types of activities: visiting “discipline info” page by any
user, and changing a course material. We can assume that the activity of changing course materials is
much more important than the activity of visiting info-page by a single user. It doesn’t make sense to
display the element net of the discipline each time when users visit the info-page. At the same time
we expect that the element net will be displayed at the moment of changing course materials because
it may lead to additional activities such as user notification, database updates, uploading new files,
etc. Thus, based on a subjective opinion we can assign “0” rate of event importance to info-page visit
event and “20” to material course update event.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Time interval of calculation</title>
        <p>In order to analyze dynamic behavior of the system, we propose to split up logs of each module by
time intervals and make a decision of displaying an element net for each interval separately. Let’s
examine new activity of the academic discipline support module of the LMS — uploading homework
exercises by students. Event of this type are a meaningful activity with rate of event importance greater
than zero. We can assume that in terms of behavioral analysis, we don’t care about infrequent
homework loadings. Contrariwise, we definitely know that frequency of uploads rises sharply before a
deadline. The deadline may lead to updating course materials (new home tasks, for example),
changing discipline description or even to the finish of the academic discipline. Time interval of calculation
provides the ability to measure the frequency of process activities (events). On the subject of the
previous example, we would like to display element net of the module before a deadline, when rate of
posting homework by students is bigger than 100 per hour. “Hour” is a time interval of calculation.
The value of time intervals of calculation could be tuned for each element Petri net of high-level Petri
net individually.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Time gap between intervals</title>
        <p>Time gap between intervals — time between beginnings of two nearest time intervals of calculation.
The value of time gap between intervals should not be greater than time interval of calculation and
could be tuned for each element Petri net of high-level Petri net individually as well as time intervals
of calculation.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Displaying threshold</title>
        <p>Displaying threshold is the final value for decision making about displaying the certain element net for
a chosen time interval. It should be compared with level of interval importance (see Equation 1) — sum
of events from the chosen time interval multiplied by events’ rate event of importance. If the result
of calculation is greater than the value of displaying threshold, then the element net should be drawn
fully. If the result of calculation is smaller than the value of displaying threshold, then the element net
should be hidden for a time interval. The value of threshold of displaying could be unique for each
element net.</p>
        <p>a)
 
 
 
b)
= time interval identifier,
= type of chosen event,
  = number of k-type events within the i interval,
  = rate event of importance of k-type event.
modules —
the  ) part.</p>
        <sec id="sec-3-4-1">
          <title>Module</title>
        </sec>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. How can we apply the proposed completeness-clarity balance method?</title>
        <p>Let’s consider a simple example. There is a pack of logs for a software system with three diferent
in tokens  1
and  2</p>
        <p>of the module  . This system has the high-level Petri net representation. Figure 7
shows the system with all modules at the  ) part and shows the system with hidden submodules at
 , 
and  ). Modules 
and</p>
        <p>are submodules of the module  , and they are “packed”
want to lose visualization of the element net of the the 
module when  1
happens. This event relates
has three types of events:  1,  2</p>
        <p>and  3. Event  1 is very important activity and we don’t
to transition</p>
        <sec id="sec-3-5-1">
          <title>1. Event  2 (happens when the transition</title>
        </sec>
        <sec id="sec-3-5-2">
          <title>2 is firing) doesn’t deserve attention</title>
        </sec>
        <sec id="sec-3-5-3">
          <title>And finally,  3 event is not significant at all. as a unique activity, but it will be useful to analyze system behavior in case of sequence of  2 events.</title>
          <p>The following values were chosen as parameters for completeness-clarity balance method:
• time interval of calculation = 1 hour;
• distance between time intervals = 40 minutes;
• displaying threshold = 90.
• time interval 1 - from 00:00AM to 01:00AM contains 1  1, 4  2 and 19  3;
• time interval 2 - from 00:40AM to 01:40AM contains 0  1, 4  2 and 13  3;
• time interval 3 - from 01:20AM to 02:40AM contains 0  1, 10  2 and 8  3;
Using Equation 1 we can calculate level of interval importance (LoII) for each interval:
•  
•  
 
 
1 = 1 ∗ 90 + 4 ∗ 10 + 19 ∗ 0 = 130;
2 = 0 ∗ 90 + 4 ∗ 10 + 13 ∗ 0 = 40;
•     3 = 0 ∗ 90 + 10 ∗ 10 + 8 ∗ 0 = 100.</p>
          <p>And finally we can compare each LoII with displaying threshold (DT) = 90. The results of calculation
show that element net will be displayed for    1,    3 and will be hidden for
   2:</p>
          <p>Time interval LoII of interval Element net will be displayed</p>
        </sec>
        <sec id="sec-3-5-4">
          <title>LoII &gt; DT</title>
          <p>Time interval 1
Time interval 2
Time interval 3</p>
          <p>Figure 9 shows three states of the system: the left state at the    1 (we can see the  1
event -   1 is firing), the central state during the    2 (the module  is hidden) and the
right one is about    3, when the element net for the module  appears again due to  2
event. Please note that for the example module  has its own events and the time when the element
net is displayed difers from the module  .</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions and Future Work</title>
      <p>In this paper we presented the first ideas on how process dynamics can be visualized based on
hierarchical high-level Petri nets. The paper documents a first part of development of dynamic visualization
tool of high-level Petri net. The result of the research will provide methods of dynamic Petri net
visualization and make it possible to develop visualization tool.</p>
      <p>The visualization tool will be executed together with simulation/log processing engine. This engine
will be a back-end part of the product which will scan real software systems’ logs and send related
commands to visualization tool. Working together log processing engine and visualization tool will
provide the user with the ability to analyze structure and behavior of chosen software system.</p>
      <p>Dynamic visualization based on real logs can help to find bottlenecks and unwanted processes
interaction. Also, it will help to analyze interaction of diferent modules with shared resources. A
hierarchical approach of the software system visualization will allow user to get rid of redundant details
by wrapping layers of hierarchy. It means that dynamic visualization of the software system via
highlevel Petri net will combine advantages of static (structural) and dynamic (behavioral) visualization
for more convenient analysis of the software systems.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This work is supported by the Basic Research Program at the National Research University Higher
School of Economics.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>M. M. Lehman</surname>
          </string-name>
          , Programs, life cycles, and
          <article-title>laws of software evolution</article-title>
          ,
          <source>Proceedings of the IEEE</source>
          <volume>68</volume>
          (
          <year>1980</year>
          )
          <fpage>1060</fpage>
          -
          <lpage>1076</lpage>
          . doi:
          <volume>10</volume>
          .1109/PROC.
          <year>1980</year>
          .
          <volume>11805</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Desel</surname>
          </string-name>
          , G. Juhás, ”
          <article-title>what is a petri net?”</article-title>
          , in: Unifying Petri Nets, volume
          <volume>2128</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2001</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>25</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Ai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <article-title>Service-oriented architecture of specific domain data center</article-title>
          ,
          <source>in: GCC</source>
          , volume
          <volume>3251</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2004</year>
          , pp.
          <fpage>855</fpage>
          -
          <lpage>858</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Jensen</surname>
          </string-name>
          ,
          <string-name>
            <surname>Coloured Petri</surname>
          </string-name>
          Nets - Basic
          <string-name>
            <surname>Concepts</surname>
          </string-name>
          ,
          <source>Analysis Methods and Practical Use - Volume</source>
          <volume>1</volume>
          ,
          <string-name>
            <surname>Second</surname>
            <given-names>Edition</given-names>
          </string-name>
          ,
          <source>Monographs in Theoretical Computer Science. An EATCS Series</source>
          , Springer,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Mitsyuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. V.</given-names>
            <surname>Kotylev</surname>
          </string-name>
          ,
          <article-title>Layered layouts for software systems visualization using nested petri nets</article-title>
          , in: V.
          <string-name>
            <surname>Itsykson</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Scedrov</surname>
          </string-name>
          , V. Zakharov (Eds.),
          <source>Tools and Methods of Program Analysis</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          , pp.
          <fpage>127</fpage>
          -
          <lpage>138</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>I. A.</given-names>
            <surname>Lomazova</surname>
          </string-name>
          ,
          <article-title>Nested petri nets - a formalism for specification and verification of multiagent distributed systems</article-title>
          ,
          <source>Fundam. Inform</source>
          .
          <volume>43</volume>
          (
          <year>2000</year>
          )
          <fpage>195</fpage>
          -
          <lpage>214</lpage>
          . URL: http://dx.doi.org/10.3233/ FI-2000-43123410. doi:
          <volume>10</volume>
          .3233/FI-2000-43123410.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Freytag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sänger</surname>
          </string-name>
          ,
          <article-title>Woped - an educational tool for workflow nets</article-title>
          ,
          <source>in: BPM (Demos)</source>
          , volume
          <volume>1295</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2014</year>
          , p.
          <fpage>31</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Nikitina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mitsyuk</surname>
          </string-name>
          ,
          <article-title>Carassius: A simple process model editor</article-title>
          ,
          <source>Proceedings of ISP RAS 27</source>
          (
          <year>2015</year>
          )
          <fpage>219</fpage>
          -
          <lpage>236</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Ratzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wells</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. M.</given-names>
            <surname>Lassen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Laursen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Qvortrup</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Stissing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Westergaard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Christensen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jensen</surname>
          </string-name>
          ,
          <article-title>Cpn tools for editing, simulating, and analysing coloured petri nets</article-title>
          , in: W.
          <string-name>
            <surname>M. P. van der Aalst</surname>
          </string-name>
          , E. Best (Eds.),
          <source>Applications and Theory of Petri Nets</source>
          <year>2003</year>
          , Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2003</year>
          , pp.
          <fpage>450</fpage>
          -
          <lpage>462</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L.</given-names>
            <surname>Cabac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Haustermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mosteller</surname>
          </string-name>
          , Renew
          <volume>2</volume>
          .5
          <article-title>- towards a comprehensive integrated development environment for petri net-based applications</article-title>
          ,
          <source>in: Application and Theory of Petri Nets and Concurrency - 37th International Conference, PETRI NETS</source>
          <year>2016</year>
          , Toruń, Poland, June 19- 24,
          <year>2016</year>
          . Proceedings,
          <year>2016</year>
          , pp.
          <fpage>101</fpage>
          -
          <lpage>112</lpage>
          . URL: http://dx.doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -39086-
          <issue>4</issue>
          _7. doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -39086-4\_7.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>H. M. W. Verbeek</surname>
            ,
            <given-names>J. C. A. M.</given-names>
          </string-name>
          <string-name>
            <surname>Buijs</surname>
            ,
            <given-names>B. F. van Dongen</given-names>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>Prom 6: The process mining toolkit</article-title>
          ,
          <source>Proc. of BPM Demonstration Track</source>
          <volume>615</volume>
          (
          <year>2010</year>
          )
          <fpage>34</fpage>
          -
          <lpage>39</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C. W.</given-names>
            <surname>Günther</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>Fuzzy mining - adaptive process simplification based on multi-perspective metrics</article-title>
          ,
          <source>in: BPM</source>
          , volume
          <volume>4714</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2007</year>
          , pp.
          <fpage>328</fpage>
          -
          <lpage>343</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S. J. J.</given-names>
            <surname>Leemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fahland</surname>
          </string-name>
          ,
          <string-name>
            <surname>W. M. P. van der Aalst</surname>
          </string-name>
          ,
          <article-title>Process and deviation exploration with inductive visual miner, in: BPM (Demos)</article-title>
          , volume
          <volume>1295</volume>
          <source>of CEUR Workshop Proceedings</source>
          , CEURWS.org,
          <year>2014</year>
          , p.
          <fpage>46</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>C. W.</given-names>
            <surname>Günther</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rozinat</surname>
          </string-name>
          , Disco:
          <article-title>Discover your processes</article-title>
          ,
          <source>in: BPM (Demos)</source>
          , volume
          <volume>940</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>40</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Burattin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cimitile</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F. M.</given-names>
            <surname>Maggi</surname>
          </string-name>
          , Lights, camera, action
          <article-title>! business process movies for online process discovery</article-title>
          ,
          <source>in: Business Process Management Workshops</source>
          , volume
          <volume>202</volume>
          <source>of Lecture Notes in Business Information Processing</source>
          , Springer,
          <year>2014</year>
          , pp.
          <fpage>408</fpage>
          -
          <lpage>419</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>M. de Leoni</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Suriadi</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. H. M. ter Hofstede</surname>
            ,
            <given-names>W. M. P. van der Aalst</given-names>
          </string-name>
          ,
          <article-title>Turning event logs into process movies: animating what has really happened</article-title>
          ,
          <source>Software and Systems Modeling</source>
          <volume>15</volume>
          (
          <year>2016</year>
          )
          <fpage>707</fpage>
          -
          <lpage>732</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>