From post

Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics.

, , и . STACS, том 30 из LIPIcs, стр. 211-223. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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.

 

Другие публикации лиц с тем же именем

Obligation Blackwell Games and p-Automata, и . CoRR, (2012)Interleaving & Reconfigurable Interaction: Separating Choice from Scheduling using Glue., , и . CoRR, (2021)Fair $ω$-Regular Games., , , и . CoRR, (2023)A PO Characterisation of Reconfiguration., , и . ICTAC, том 13572 из Lecture Notes in Computer Science, стр. 42-59. Springer, (2022)Runtime Verification Meets Controller Synthesis., , и . ISoLA (1), том 13701 из Lecture Notes in Computer Science, стр. 382-396. Springer, (2022)Safety Verification of Piecewise-Deterministic Markov Processes., , , и . HSCC, стр. 257-266. ACM, (2016)A Survey on Satisfiability Checking for the μ-Calculus Through Tree Automata., и . Principles of Systems Design, том 13660 из Lecture Notes in Computer Science, стр. 228-251. Springer, (2022)Fairness for Infinite-State Systems., , и . TACAS, том 9035 из Lecture Notes in Computer Science, стр. 384-398. Springer, (2015)A Forward Analysis for Recurrent Sets., , и . SAS, том 9291 из Lecture Notes in Computer Science, стр. 293-311. Springer, (2015)On Automation of CTL* Verification for Infinite-State Systems., , и . CAV (1), том 9206 из Lecture Notes in Computer Science, стр. 13-29. Springer, (2015)