What's Decidable about Availability Languages?

We study here the algorithmic analysis of systems modeled in terms of availability languages. Our first main result is a positive answer to the emptiness problem: it is decidable whether a given availability language contains a word. The key idea is an inductive construction that replaces availability languages with Parikh-equivalent regular languages. As a second contribution, we solve the intersection problem modulo bounded languages: given availability languages and a bounded language, it is decidable whether the intersection of the former contains a word from the bounded language. We show that the problem is NP-complete. The idea is to reduce to satisfiability of existential Presburger arithmetic. Since the (general) intersection problem for availability languages is known to be undecidable, our results characterize the decidability border for this model. Our last contribution is a study of the containment problem between regular and availability languages. We show that safety verification, i.e., checking containment of an availability language in a regular language, is decidable. The containment problem of regular languages in availability languages is proven undecidable.

[1]  Jochen Hoenicke,et al.  Kleene, Rabin, and Scott Are Available , 2010, CONCUR.

[2]  Jakob Rehof,et al.  Context-Bounded Model Checking of Concurrent Software , 2005, TACAS.

[3]  B. Scarpellini.  Complexity of subcases of Presburger arithmetic , 1984 .

[4]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[5]  Pierre Ganty,et al.  Complexity of pattern-based verification for multithreaded programs , 2011, POPL '11.

[6]  Felix Klaedtke,et al.  Monadic Second-Order Logics with Cardinalities , 2003, ICALP.

[7]  Edmundo de Souza e Silva,et al.  Calculating availability and performability measures of repairable computer systems using randomization , 1989, JACM.

[8]  Gerardo Rubino,et al.  Interval availability distribution computation , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[9]  Michaël Cadilhac,et al.  Affine Parikh automata , 2012, RAIRO Theor. Informatics Appl..

[10]  J. Berstel,et al.  Context-free languages , 1993, SIGA.

[11]  Michaël Cadilhac,et al.  On the Expressiveness of Parikh Automata and Related Models , 2011, NCMA.

[12]  Thomas Schwentick,et al.  Numerical document queries , 2003, PODS.

[13]  Rupak Majumdar,et al.  Bounded underapproximations , 2008, Formal Methods Syst. Des..

[14]  Ursula Dresdner,et al.  Computation Finite And Infinite Machines , 2016 .

[15]  Anthony Widjaja Lin,et al.  Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters , 2012, CAV.

[16]  Pierre Ganty,et al.  Parikhʼs theorem: A simple and direct automaton construction , 2010, Inf. Process. Lett..

[17]  Alain Finkel,et al.  Bounded Parikh Automata , 2011, WORDS.

[18]  Thomas Schwentick,et al.  On the Complexity of Equational Horn Clauses , 2005, CADE.