Monitoring CTMCs by multi-clock timed automata
This paper presents a numerical algorithm to verify continuous-time Markov chains (CTMCs)
against multi-clock deterministic timed automata (DTA). These DTA allow for specifying …
against multi-clock deterministic timed automata (DTA). These DTA allow for specifying …
Trace relations and logical preservation for Markov automata
A Sharma - Formal Modeling and Analysis of Timed Systems: 16th …, 2018 - Springer
Markov automata (MAs) have been introduced in [16] as a continuous-time version of
Segala's probabilistic automata (PAs)[29]. This paper defines several variants of trace …
Segala's probabilistic automata (PAs)[29]. This paper defines several variants of trace …
[PDF][PDF] Reduction Techniques for Nondeterministic and Probabilistic Systems
A Sharma - 2015 - core.ac.uk
Abstract Model checking is an automated verification method guaranteeing that a
mathematical model of a system satisfies a formally described property. It can be used to …
mathematical model of a system satisfies a formally described property. It can be used to …
Trace relations and logical preservation for continuous-time Markov decision processes
A Sharma - Theoretical Aspects of Computing–ICTAC 2017: 14th …, 2017 - Springer
Equivalence relations are widely used for comparing the behavior of stochastic systems.
This paper introduces several variants of trace equivalence for continuous-time Markov …
This paper introduces several variants of trace equivalence for continuous-time Markov …
[PDF][PDF] Verifying probabilistic systems: new algorithms and complexity results
H Fu - 2014 - publications.rwth-aachen.de
The content of the dissertation falls in the area of formal verification of probabilistic systems.
It comprises four parts listed below: 1. the decision problem of (probabilistic) simulation …
It comprises four parts listed below: 1. the decision problem of (probabilistic) simulation …
Fluid model checking of timed properties
L Bortolussi, R Lanciani - Formal Modeling and Analysis of Timed Systems …, 2015 - Springer
We address the problem of verifying timed properties of Markovian models of large
populations of interacting agents, modelled as finite state automata. In particular, we focus …
populations of interacting agents, modelled as finite state automata. In particular, we focus …
Non-bisimulation based behavioral relations for Markov automata
A Sharma - Formal Modeling and Analysis of Timed Systems: 16th …, 2018 - Springer
Abstract Markov automata (MAs)[16] extend probabilistic automata (PAs)[29] with stochastic
aspects [22]. This paper defines two equivalence relations, namely, weighted Markovian …
aspects [22]. This paper defines two equivalence relations, namely, weighted Markovian …
[PDF][PDF] Monitoring CTMCs by Multi-clock Timed Automata
N Zhan - publications.rwth-aachen.de
This paper presents a numerical algorithm to verify continuous-time Markov chains (CTMCs)
against multi-clock deterministic timed automata (DTA). These DTA allow for specifying …
against multi-clock deterministic timed automata (DTA). These DTA allow for specifying …
Verifying probabilistic timed automata against omega-regular dense-time properties
Probabilistic timed automata (PTAs) are timed automata (TAs) extended with discrete
probability distributions. They serve as a mathematical model for a wide range of …
probability distributions. They serve as a mathematical model for a wide range of …
Fluid Model Checking of Timed Properties
IMT Lucca - Formal Modeling and Analysis of Timed Systems - Springer
We address the problem of verifying timed properties of Markovian models of large
populations of interacting agents, modelled as finite state automata. In particular, we focus …
populations of interacting agents, modelled as finite state automata. In particular, we focus …