Now showing items 1-2 of 2
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection
(Springer Verlag, 2018-02-23)
We consider the problem of approximate reduction of non-deterministic automata that appear in hardware-accelerated network intrusion detection systems (NIDSes). We define an error distance of a reduced automaton from the ...
Shepherding Hordes of Markov Chains
(Springer International Publishing, 2019-04-17)
This paper considers large families of Markov chains (MCs) that are defined over a set of parameters with finite discrete domains. Such families occur in software product lines, planning under partial observability, and ...