Measuring the Complexity of User Processes using Shannon Entropy and Stochastic Petri Nets

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25410%2F17%3A39910616" target="_blank" >RIV/00216275:25410/17:39910616 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/DT.2017.8024287" target="_blank" >http://dx.doi.org/10.1109/DT.2017.8024287</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/DT.2017.8024287" target="_blank" >10.1109/DT.2017.8024287</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Measuring the Complexity of User Processes using Shannon Entropy and Stochastic Petri Nets

Popis výsledku v původním jazyce

Measuring complexity of processes or systems is currently a very popular topic. There is a wide range of defined complexity measures that quantify features such as legibility, modifiability, uncertainty, comprehensibility, easiness of implementation, user-friendliness and many others. The content of this work is a presentation of a method for quantification of complexity using Shannon entropy and stochastic Petri nets. Shannon entropy and Petri nets are an appropriate combination because they allow analysing the complexity of processes not only in terms of their structure but also in terms of their dynamic development under tension. On a simple example are outlined possible analyses and the correlation analysis examines the comparability with other selected complexity measures.

Název v anglickém jazyce

Measuring the Complexity of User Processes using Shannon Entropy and Stochastic Petri Nets

Popis výsledku anglicky

Measuring complexity of processes or systems is currently a very popular topic. There is a wide range of defined complexity measures that quantify features such as legibility, modifiability, uncertainty, comprehensibility, easiness of implementation, user-friendliness and many others. The content of this work is a presentation of a method for quantification of complexity using Shannon entropy and stochastic Petri nets. Shannon entropy and Petri nets are an appropriate combination because they allow analysing the complexity of processes not only in terms of their structure but also in terms of their dynamic development under tension. On a simple example are outlined possible analyses and the correlation analysis examines the comparability with other selected complexity measures.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the International Conference on Computer-Human Interaction Research and Applications CHIRA 2017

ISBN

978-989-758-267-7

ISSN

—

e-ISSN

neuvedeno

Počet stran výsledku

6

Strana od-do

212-217

Název nakladatele

SciTePress - Science and Technology Publications

Místo vydání

Porto

Místo konání akce

Funchal

Datum konání akce

31. 10. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—