Author of the publication

Probabilistic Mu-Calculus: Decidability and Complete Axiomatization.

, , and . FSTTCS, volume 65 of LIPIcs, page 25:1-25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Alternation-Free Weighted Mu-Calculus: Decidability and Completeness., , and . MFPS, volume 319 of Electronic Notes in Theoretical Computer Science, page 289-313. Elsevier, (2015)Reasoning About Bounds in Weighted Transition Systems., , , , and . CoRR, (2017)A Decidable Recursive Logic for Weighted Transition Systems., , and . ICTAC, volume 8687 of Lecture Notes in Computer Science, page 460-476. Springer, (2014)On decidability of recursive weighted logics., , and . Soft Comput., 22 (4): 1085-1102 (2018)A Complete Approximation Theory for Weighted Transition Systems., , , , and . SETTA, volume 9984 of Lecture Notes in Computer Science, page 213-228. (2016)Probabilistic Mu-Calculus: Decidability and Complete Axiomatization., , and . FSTTCS, volume 65 of LIPIcs, page 25:1-25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Decidability and Expressiveness of Recursive Weighted Logic., , and . Ershov Memorial Conference, volume 8974 of Lecture Notes in Computer Science, page 216-231. Springer, (2014)Specification in PDL with Recursion., and . NASA Formal Methods, volume 7226 of Lecture Notes in Computer Science, page 181-194. Springer, (2012)Concurrent weighted logic., , and . J. Log. Algebraic Methods Program., 84 (6): 884-897 (2015)Adequacy and Complete Axiomatization for Timed Modal Logic., , , and . MFPS, volume 308 of Electronic Notes in Theoretical Computer Science, page 183-210. Elsevier, (2014)