Canonical Automata via Distributive Law Homomorphisms. Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva. EPTCS 351, 2021, 296-313. 2021 shelley2024-07-26T09:03:55+00:00 Share this content FacebookXLinkedInWhatsAppEmail Related Posts Sufficient Conditions for Robustness of RDMA Programs. Sufficient Conditions for Robustness of RDMA Programs. Simplifying Imperfect Recall Games. Simplifying Imperfect Recall Games. Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives. Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives. Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata. Accelerating Markov Chain Model Checking: Good-for-Games Meets Unambiguous Automata.
by