We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Although static systems for information flow security are well-studied, few works address run-time information flow monitoring. Run-time information flow control offers distinc...