Abstract

In networked software, interactive behaviors of software entities generate lots of behavioral footprints, some of them may lose tokens or tokens are useless. The paper studies the constructing process of State Transition Model (STM) in which the process of incomplete transactions are satisfied with Markov property, it is pointed that the STM are originally extracted from behavior log files generated by the runtime behaviors of networked software. The contributions of this paper are to mark the partly tokenized behavior footprints in the STM through Maximum Flow (MF) algorithm, then find the original source for each behavior footprint. The experiment results indicate that the maximum flow algorithm can accurately turn the partly tokenized behavior into complete footprint sequences.

Keywords:

Behavior footprints, incomplete transaction maximum flow algorithm, networked software, state transition model,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.