Fluid Performability Analysis of Nested Automata Models
نویسندگان
چکیده
In this paper we present a class of nested automata for the modelling of performance, availability, and reliability of software systems with hierarchical structure, which we call systems of systems. Quantitative modelling provides valuable insight into the dynamic behaviour of software systems, allowing non-functional properties such as performance, dependability and availability to be assessed. However, the complexity of many systems challenges the feasibility of this approach as the required mathematical models grow too large to afford computationally efficient solution. In recent years it has been found that in some cases a fluid, or mean field, approximation can provide very good estimates whilst dramatically reducing the computational cost. The systems of systems which we propose are hierarchically arranged automata in which influence may be exerted between siblings, between parents and children, and even from children to parents, allowing a wide range of complex dynamics to be captured. We show that, under mild conditions, systems of systems can be equipped with fluid approximation models which are several orders of magnitude more efficient to run than explicit state representations, whilst providing excellent estimates of performability measures. This is a significant extension of previous fluid approximation results, with valuable applications for software performance modelling.
منابع مشابه
Automata and Logics for Concurrent Systems: Five Models in Five Pages
We survey various automata models of concurrent systems and their connection with monadic second-order logic: finite automata, class memory automata, nested-word automata, asynchronous automata, and message-passing automata.
متن کاملLogics and Automata for Software Model - Checking 1
While model-checking of pushdown models is by now an established technique in software verification, temporal logics and automata traditionally used in this area are unattractive on two counts. First, logics and automata traditionally used in model-checking cannot express requirements such as pre/post-conditions that are basic to software analysis. Second, unlike in the finite-state world, wher...
متن کاملApproximate Performability and Dependability Analysis Using Generalized Stochastic Petri Nets
Haverkort, B.R., Approximate performability and dependability analysis using generalized stochastic Petri nets, Performance Evaluation 18 (1993) 61-78. Since current day fault-tolerant and distributed computer and communicat ion systems tend to be large and complex, their corresponding performability models will suffer from the same characteristics. Therefore, calculating performability measure...
متن کاملSymbolic Visibly Pushdown Automata
Nested words model data with both linear and hierarchical structure such as XML documents and program traces. A nested word is a sequence of positions together with a matching relation that connects open tags (calls) with the corresponding close tags (returns). Visibly Pushdown Automata are a restricted class of pushdown automata that process nested words, and have many appealing theoretical pr...
متن کاملModel Checking Functional and Performability Properties of Stochastic Fluid Models
Model checking of stochastic processes has been introduced to verify functional as well as performability properties of formally specified systems. In this paper, model checking for a wide class of stochastic fluid models (SFMs) is considered. We present a branching time temporal logic, which is similar to the continuous stochastic logic (CSL), for expressing real-time probabilistic properties ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 310 شماره
صفحات -
تاریخ انتشار 2015