Coalgebra, as the abstract study of state-based systems, comes naturally...
Fixpoints are ubiquitous in computer science as they play a central role...
Anomaly detection is essential in many application domains, such as cybe...
We introduce stochastic decision Petri nets (SDPNs), which are a form of...
Strategy iteration is a technique frequently used for two-player games i...
We introduce a general and compositional, yet simple, framework that all...
We consider probabilistic systems with hidden state and unobservable
tra...
The framework of graded semantics uses graded monads to capture behaviou...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a mono...
This paper exploits extended Bayesian networks for uncertainty reasoning...
Reactive systems à la Leifer and Milner, an abstract categorical framewo...
Systems of fixpoint equations over complete lattices, consisting of (mix...
Behavioural equivalences can be characterized via bisimulation, modal lo...
The fuzzy modality `probably` is interpreted over probabilistic type spa...
The paper develops an abstract (over-approximating) semantics for
double...
Many analysis and verifications tasks, such as static program analyses a...
In probabilistic transition systems, behavioural metrics provide a more
...
The paper extends Bayesian networks (BNs) by a mechanism for dynamic cha...
Up-to techniques are a well-known method for enhancing coinductive proof...
We present a fuzzy (or quantitative) version of the van Benthem theorem,...
We study different behavioral metrics, such as those arising from both
b...