Alternation-Free Weighted Mu-Calculus: Decidability and Completeness
نویسندگان
چکیده
منابع مشابه
Alternation-Free Weighted Mu-Calculus: Decidability and Completeness
For more than two decades, specification and modelling formalisms have been sought that address essential non-functional properties of embedded and cyber-physical systems. In particular, timed automata [4] were used for expressing and analysing timing constraints of systems with respect to timed logics such as TCTL [3], Tμ [17], Lν [23] and MTL [19]. However, equally important non-functional pr...
متن کاملOn the decidability of the mu-calculus alternation hierarchy
From 12.12.2010 to 17.12.2010, the Dagstuhl Seminar 10501 “Advances and Applications of Automata on Words and Trees” was held in Schloss Dagstuhl – Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar res...
متن کاملGlobal Caching for the Alternation-free $\mu$-Calculus
We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-free μ-calculus. The algorithm supports global caching with intermediate propagation and runs in time 2. In game-theoretic terms, our algorithm integrates the steps for constructing and solving the Büchi game arising from the input tableau into a single procedure; this is done onthe-fly, i.e. may termina...
متن کاملProbabilistic Mu-Calculus: Decidability and Complete Axiomatization
We introduce a version of the probabilistic μ-calculus (PMC) built on top of a probabilistic modal logic that allows encoding n-ary inequational conditions on transition probabilities. PMC extends previously studied calculi and we prove that, despite its expressiveness, it enjoys a series of good metaproperties. Firstly, we prove the decidability of satisfiability checking by establishing the s...
متن کاملEfficient on-the-fly model-checking for regular alternation-free mu-calculus
Model-checking is a successful technique for automatically verifying concurrent finite-state systems. When building a model-checker, a good compromise must be made between the expressive power of the property description formalism, the complexity of the model-checking problem, and the user-friendliness of the interface. We present a temporal logic and an associated model-checking method that at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2015
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2015.12.018