Kleene, Rabin, and Scott Are Available
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regular availability expressions (rae) and availability automata. We prove that the intersection problem of rae is undecidable. We establish a Kleene theorem that shows the equivalence of the formalisms and states precise correspondence of flat rae and simple availability automata. For these automata, we provide an extension of the powerset construction for finite automata due to Rabin and Scott. As a consequence, we can state a complementation algorithm. This enables us to solve the synthesis problem and to reduce model checking of availability properties to reachability.
Unable to display preview. Download preview PDF.
- Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. In: Proc. of POPL, pp. 1–3. ACM, New York (2002)Google Scholar
- Rubino, G., Sericola, B.: Interval availability distribution computation. In: Proc. of FTCS, pp. 48–55. IEEE, Los Alamitos (1993)Google Scholar
- Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: Proc. of PODS, pp. 155–166. ACM, New York (2003)Google Scholar
- Trivedi, K.S.: Probability and Statistics with Reliability, Queuing, and Computer Science Applications, 2nd edn. Wiley, Chichester (2001)Google Scholar