Prioritized Process Test: More Efficiency in Testing of Business Processes and Workflows

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00318369" target="_blank" >RIV/68407700:21230/17:00318369 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007/978-981-10-4154-9_67" target="_blank" >https://link.springer.com/chapter/10.1007/978-981-10-4154-9_67</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-981-10-4154-9_67" target="_blank" >10.1007/978-981-10-4154-9_67</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Prioritized Process Test: More Efficiency in Testing of Business Processes and Workflows

Popis výsledku v původním jazyce

Testing business processes and workflows in information systems, while aiming to cover all possible paths, requires high efforts demanding considerable costs. In this paper, we propose an algorithm generating a path-based test cases from the system model, based on weighted directed graph. The approach brings an alternative to the currently established test requirements concept. The algorithm reflects various levels of priorities of particular functions in the tested system, previously defined by the test designer. When compared to simulated naive approaches based on reverse reduction of test set, our proposed algorithm produces more efficient test cases in terms of number of the total test steps, whilst keeping the same level of test coverage of the priority functions of the tested system.

Název v anglickém jazyce

Prioritized Process Test: More Efficiency in Testing of Business Processes and Workflows

Popis výsledku anglicky

Testing business processes and workflows in information systems, while aiming to cover all possible paths, requires high efforts demanding considerable costs. In this paper, we propose an algorithm generating a path-based test cases from the system model, based on weighted directed graph. The approach brings an alternative to the currently established test requirements concept. The algorithm reflects various levels of priorities of particular functions in the tested system, previously defined by the test designer. When compared to simulated naive approaches based on reverse reduction of test set, our proposed algorithm produces more efficient test cases in terms of number of the total test steps, whilst keeping the same level of test coverage of the priority functions of the tested system.

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

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Lecture Notes in Electrical Engineering

ISBN

978-981-10-4153-2

ISSN

1876-1100

e-ISSN

—

Počet stran výsledku

9

Strana od-do

585-593

Název nakladatele

Springer Nature Singapore Pte Ltd.

Místo vydání

—

Místo konání akce

Macau

Datum konání akce

20. 3. 2017

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

WRD - Celosvětová akce

Kód UT WoS článku

000425796900067