On some class of mathematical models for static analysis of critical-mission asynchronous systems

Abstract

A mathematical model of asynchronous software system is considered in the paper. This model bases on the notion abstract finite pre-machine which generalizes the notion abstract finite automaton. In contrast to generally accepted models the model proposed in the paper makes possible to specify more complex system behaviour than it is provided by finite automata models. Specifically, live-lock anomaly can be specified using the notion pre-machine. Authors adduce the criterion of live-lock existence and illustrate it by example.