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 …

Abstract Generalised Stochastic Petri Nets (GSPN s) are a popular modelling formalism for
performance and dependability analysis. Their semantics is traditionally associated to …

Markov automata describe systems in terms of events which may be nondeterministic, may
occur probabilistically, or may be subject to time delays. We define a novel notion of weak …

Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are
therefore a powerful semantic foundation for modeling concurrent systems with random …

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 …

Quantum cryptographic systems have been commercially available, with a striking
advantage over classical systems that their security and ability to detect the presence of …

Labeled transition systems are typically used as behavioral models of concurrent processes.
Their labeled transitions define a one-step state-to-state reachability relation. This model …

Quantum cryptographic systems have been commercially available, with a striking
advantage over classical systems that their security and ability to detect the presence of …

Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two
automata are equivalent if and only if they accept each word with the same probability. On …

Probabilistic automata (PAs) have been successfully applied in formal verification of
concurrent and stochastic systems. Efficient model checking algorithms have been studied …