From post

Belief Bisimulation for Hidden Markov Models - Logical Characterisation and Decision Algorithm.

, , и . NASA Formal Methods, том 7226 из Lecture Notes in Computer Science, стр. 326-340. Springer, (2012)

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.

 

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

Stuttering equivalence is too slow!, и . CoRR, (2016)An O(mlogn) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation., , , и . ACM Trans. Comput. Log., 18 (2): 13:1-13:34 (2017)Formal Verification of Consensus in the Taurus Distributed Database., , , , , , и . FM, том 13047 из Lecture Notes in Computer Science, стр. 741-751. Springer, (2021)CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper)., , , , , , и . SEFM, том 13550 из Lecture Notes in Computer Science, стр. 324-331. Springer, (2022)Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata., , и . QEST, стр. 311-322. IEEE Computer Society, (2006)Fortuna: Model Checking Priced Probabilistic Timed Automata., , и . QEST, стр. 273-281. IEEE Computer Society, (2010)Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts., , и . Requir. Eng., 7 (4): 243-263 (2002)A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems., , , и . CoRR, (2019)Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS., , , и . Formal Aspects Comput., 35 (4): 25:1-25:21 (декабря 2023)Accelerated Verification of Parametric Protocols with Decision Trees., , , , и . ICCD, стр. 397-404. IEEE, (2020)