What's decidable about availability languages?

DOI10.4230/LIPICS.FSTTCS.2015.192MaRDI QIDQ5275367zbMATH OpenFDO

Authors Mohamed Faouzi Atig, Roland Meyer, Mehdi Salehi, Parosh A. Abdulla

Publication date 13 July 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2015.192

zbMATH Keywords

availabilitydecidabilityemptinessformal languages

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Kleene, Rabin, and Scott Are Available
• Reachability analysis of communicating pushdown systems
• Characterizations of the decidability of some problems for regular trace languages
• Algorithmic analysis of programs with well quasi-ordered domains.
• When is containment decidable for probabilistic automata?

Cited in

(5)

• Enforcing availability in failure-aware communicating systems
• Bounded context switching for valence systems
• Model-Checking Counting Temporal Logics on Flat Structures
• The algebraic theory of Parikh automata
• An introduction to the theory of linear integer arithmetic (invited paper)

This page was built for publication: What's decidable about availability languages?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5275367)