Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM 49, 172–206 (2002)
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)
Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker BLAST. STTT 9(5-6), 505–525 (2007)
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)
Chaochen, Z., Hansen, M.R.: Duration Calculus: A Formal Approach to Real-Time Systems. EATCS Monographs. Springer, Heidelberg (2004)
Cassez, F., Larsen, K.G.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 138–152. Springer, Heidelberg (2000)
Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs. Springer, Heidelberg (2009)
de Souza e Silva, E., Gail, H.R.: Calculating availability and performability measures of repairable computer systems using randomization. Journal of the ACM 36(1), 171–193 (1989)
Larsen, K.G., Rasmussen, J.I.: Automata-theoretic techniques for modal logics of programs. Theoretical Computer Science 390, 197–213 (2008)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM Journal of Research 3(2), 115–125 (1959)
Rubino, G., Sericola, B.: Interval availability distribution computation. In: Proc. of FTCS, pp. 48–55. IEEE, Los Alamitos (1993)
Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: Proc. of PODS, pp. 155–166. ACM, New York (2003)
Trivedi, K.S.: Probability and Statistics with Reliability, Queuing, and Computer Science Applications, 2nd edn. Wiley, Chichester (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoenicke, J., Meyer, R., Olderog, ER. (2010). Kleene, Rabin, and Scott Are Available. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)