Search Results for author:
Found 5 papers, 1 papers with code
Interpretable Anomaly Detection via Discrete Optimization
Anomaly detection is essential in many application domains, such as cyber security, law enforcement, medicine, and fraud protection.
Probabilistic Systems with Hidden State and Unobservable Transitions
We consider probabilistic systems with hidden state and unobservable transitions, an extension of Hidden Markov Models (HMMs) that in particular admits unobservable {\epsilon}-transitions (also called null transitions), allowing state changes of which the observer is unaware.
Fixpoint Theory -- Upside Down
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below the greatest fixpoint (e. g., for providing bisimilarity witnesses).
Logic in Computer Science
Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks
In particular, Bayesian networks are used as symbolic representations of probability distributions, modelling the observer's knowledge about the tokens in the net.
Fixpoint Games on Continuous Lattices
A simple parity game, referred to as fixpoint game, is defined that provides a correct and complete characterisation of the solution of equation systems over continuous lattices, a quite general class of lattices widely used in semantics.
Logic in Computer Science D.2.4; F.3.1; F.3.2
