This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of
labelled transition systems with exponentially delayed transitions. We show that IMCs are …

We introduce a unifying framework to provide the semantics of process algebras, including
their quantitative variants useful for modeling quantitative aspects of behaviors. The unifying …

We develop a compositional behavioural model that integrates a variation of probabilistic
automata into a conservative extension of interactive Markov chains. The model is rich …

Bialgebras and distributive laws are an abstract, categorical framework to study various
flavors of structural operational semantics. This paper aims to introduce the reader to the …

Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …

We survey the work on both discrete and continuous-space probabilistic systems as
coalgebras, starting with how probabilistic systems are modeled as coalgebras and followed …

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of
Mathematical Operational Semantics to higher-order languages. The fundamental well …

We discuss conceptional and foundational aspects of Markov automata [22]. We place this
model in the context of continuous-and discrete-time Markov chains, probabilistic automata …

Drug-target interaction (DTI) prediction is a problem that identifies novel protein-ligand
interactions from previous information. DTI plays an important role in computer-aided drug …

Weighted transition systems are defined, parametrized by a commutative monoid of weights.
These systems are further understood as coalgebras for functors of a specific form. A …