Characterising testing preorders for finite probabilistic processes
In 1992 Wang & Larsen extended the may-and must preorders of De Nicola and Hennessy
to processes featuring probabilistic as well as nondeterministic choice. They concluded with …
to processes featuring probabilistic as well as nondeterministic choice. They concluded with …
[HTML][HTML] On the semantics of Markov automata
Y Deng, M Hennessy - Information and Computation, 2013 - Elsevier
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 …
occur probabilistically, or may be subject to time delays. We define a novel notion of weak …
Testing finitary probabilistic processes
Y Deng, Y Deng - Semantics of Probabilistic Processes: An Operational …, 2014 - Springer
In this chapter we extend the results of Chap. 5 from finite to finitary processes, that is, finite-
state and finitely branching processes. Testing preorders can still be characterised as …
state and finitely branching processes. Testing preorders can still be characterised as …
Exploring probabilistic bisimulations, part I
M Hennessy - Formal Aspects of Computing, 2012 - Springer
We take a fresh look at strong probabilistic bisimulations for processes which exhibit both
non-deterministic and probabilistic behaviour. We suggest that it is natural to interpret such …
non-deterministic and probabilistic behaviour. We suggest that it is natural to interpret such …
Compositional bisimulation metric reasoning with probabilistic process calculi
We study which standard operators of probabilistic process calculi allow for compositional
reasoning with respect to bisimulation metric semantics. We argue that uniform continuity …
reasoning with respect to bisimulation metric semantics. We argue that uniform continuity …
[HTML][HTML] Back to the format: A survey on SOS for probabilistic processes
In probabilistic process algebras the classic qualitative description of process behaviour is
enriched with quantitative information on it, usually modelled in terms of probabilistic …
enriched with quantitative information on it, usually modelled in terms of probabilistic …
A testing scenario for probabilistic processes
We introduce a notion of finite testing, based on statistical hypothesis tests, via a variant of
the well-known trace machine. Under this scenario, two processes are deemed …
the well-known trace machine. Under this scenario, two processes are deemed …
Bisimulation for quantum processes
Quantum cryptographic systems have been commercially available, with a striking
advantage over classical systems that their security and ability to detect the presence of …
advantage over classical systems that their security and ability to detect the presence of …
Data races and static analysis for interrupt-driven kernels
We consider a class of interrupt-driven programs that model the kernel API libraries of some
popular real-time embedded operating systems and the synchronization mechanisms they …
popular real-time embedded operating systems and the synchronization mechanisms they …