[BOOK][B] Principles of model checking
A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …
technique for finding flaws in hardware and software; with extensive examples and both …
Model-checking algorithms for continuous-time Markov chains
Continuous-time Markov chains (CTMCs) have been widely used to determine system
performance and dependability characteristics. Their analysis most often concerns the …
performance and dependability characteristics. Their analysis most often concerns the …
A behavioural hierarchical analysis framework in a smart home: Integrating HMM and probabilistic model checking
Smart homes offer great convenience for people living alone and assistance for physically
impaired inhabitants. Robust behavioural analysis technology is one of the keys to …
impaired inhabitants. Robust behavioural analysis technology is one of the keys to …
[BOOK][B] Stochastic hybrid systems
Because they incorporate both time-and event-driven dynamics, stochastic hybrid systems
(SHS) have become ubiquitous in a variety of fields, from mathematical finance to biological …
(SHS) have become ubiquitous in a variety of fields, from mathematical finance to biological …
Mobile agent path planning under uncertain environment using reinforcement learning and probabilistic model checking
The major challenge in mobile agent path planning, within an uncertain environment, is
effectively determining an optimal control model to discover the target location as quickly as …
effectively determining an optimal control model to discover the target location as quickly as …
Comparative branching-time semantics for Markov chains
This paper presents various semantics in the branching-time spectrum of discrete-time and
continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation …
continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation …
Stochastic timed automata
A stochastic timed automaton is a purely stochastic process defined on a timed automaton,
in which both delays and discrete choices are made randomly. We study the almost-sure …
in which both delays and discrete choices are made randomly. We study the almost-sure …
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov
processes (LMPs) and compare it with the, now standard, notion of probabilistic …
processes (LMPs) and compare it with the, now standard, notion of probabilistic …
[BOOK][B] Stochastic relations: foundations for Markov transition systems
EE Doberkat - 2007 - taylorfrancis.com
Collecting information previously scattered throughout the vast literature, including the
author's own research, Stochastic Relations: Foundations for Markov Transition Systems …
author's own research, Stochastic Relations: Foundations for Markov Transition Systems …
[BOOK][B] Alea jacta est: verification of probabilistic, real-time and parametric systems
MIA Stoelinga - 2002 - repository.ubn.ru.nl
Alea jacta est. With the printing of this thesis, almost five years of research end. This was a
period of hard work, of astonishing elegance and beauty present in concurrency theory, with …
period of hard work, of astonishing elegance and beauty present in concurrency theory, with …