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.

• Type: Conference
• Year: 2010
• Where: CONCUR
• Authors: Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger Olderog
• Keywords: Availability, Availability Automata, CONCUR 2010, Distributed And Parallel Computing, Regular Availability Expressions