Kleene, Rabin, and Scott are available

Authors:
Jochen Hoenicke;Roland Meyer;Ernst-Rüdiger Olderog
Affiliations:
University of Freiburg;LIAFA, Paris Diderot University & CNRS;University of Oldenburg
Venue:
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Year:
2010

Citing 12
Cited 1

Calculating availability and performability measures of repairable computer systems using randomization

Journal of the ACM (JACM)
A theory of timed automata

Theoretical Computer Science
Probability and statistics with reliability, queuing and computer science applications

Probability and statistics with reliability, queuing and computer science applications
The SLAM project: debugging system software via static analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Timed regular expressions

Journal of the ACM (JACM)
Duration Calculus, a Logical Approach to Real-Time Systems

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
The Impressive Power of Stopwatches

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Numerical document queries

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computation: finite and infinite machines

Computation: finite and infinite machines
The software model checker Blast: Applications to software engineering

International Journal on Software Tools for Technology Transfer (STTT)
Finite automata and their decision problems

IBM Journal of Research and Development
Handbook of Weighted Automata

Handbook of Weighted Automata

Automatic verification of real-time systems with rich data: an overview

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

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.