Kleene, Rabin, and Scott Are Available

  • Jochen Hoenicke
  • Roland Meyer
  • Ernst-Rüdiger Olderog
Conference paper

DOI: 10.1007/978-3-642-15375-4_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6269)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jochen Hoenicke
    • 1
  • Roland Meyer
    • 2
  • Ernst-Rüdiger Olderog
    • 3
  1. 1.University of Freiburg 
  2. 2.LIAFA, Paris Diderot University & CNRS 
  3. 3.University of Oldenburg 

Personalised recommendations