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 …
[HTML][HTML] A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
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 …
Their labeled transitions define a one-step state-to-state reachability relation. This model …
Open bisimulation for quantum processes
Quantum processes describe concurrent communicating systems that may involve quantum
information. We propose a notion of open bisimulation for quantum processes and show that …
information. We propose a notion of open bisimulation for quantum processes and show that …
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 …
Logical, metric, and algorithmic characterisations of probabilistic bisimulation
Y Deng, W Du - arXiv preprint arXiv:1103.4577, 2011 - arxiv.org
Many behavioural equivalences or preorders for probabilistic processes involve a lifting
operation that turns a relation on states into a relation on distributions of states. We show …
operation that turns a relation on states into a relation on distributions of states. We show …
Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
M Bernardo, R De Nicola… - Logical Methods in …, 2014 - lmcs.episciences.org
Two of the most studied extensions of trace and testing equivalences to nondeterministic
and probabilistic processes induce distinctions that have been questioned and lack …
and probabilistic processes induce distinctions that have been questioned and lack …
Probabilistic Trace and Testing Semantics: The Importance of Being Coherent
M Bernardo - Foundations and Trends® in Programming …, 2022 - nowpublishers.com
It is well known that trace and testing semantics over nondeterministic and probabilistic
processes are influenced by the class of schedulers used to resolve nondeterministic …
processes are influenced by the class of schedulers used to resolve nondeterministic …
Coherent resolutions of nondeterminism
M Bernardo - … Engineering: 16th European Workshop, EPEW 2019 …, 2020 - Springer
We study the impact that different ways of resolving nondeterminism within probabilistic
automata have on the properties of probabilistic behavioral equivalences. Firstly, we provide …
automata have on the properties of probabilistic behavioral equivalences. Firstly, we provide …