https://researcher.itu.dk/p/en/research-outputs/bisimulations-meet-pctl-equivalences-for-probabilistic-automata
Bisimulations Meet PCTL Equivalences for Probabilistic Automata — IT University of Copenhagen
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
university of copenhagenprobabilistic automatabisimulationsmeetpctl
https://researcher.itu.dk/p/en/research-outputs/abstract-probabilistic-automata
Abstract Probabilistic Automata — IT University of Copenhagen
Abstract Probabilistic Automata
university of copenhagenprobabilistic automataabstract
https://research.google/pubs/lp-distance-and-equivalence-of-probabilistic-automata-2/
Lsubp/sub Distance and Equivalence of Probabilistic Automata
probabilistic automatasubdistanceequivalence
https://iccl.inf.tu-dresden.de/web/Inproceedings3470/en
Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata -...
Christel Baier, Sascha Klüppelholz, Timm Spork. Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata. In Ana Sokolova,...
unambiguous finite automataprobabilistic modelcheckingviafamilies