Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Verification of hybrid systems
Hybrid systems are models which combine discrete and continuous behavior. They occur
frequently in safety-critical applications in various domains such as health care …
frequently in safety-critical applications in various domains such as health care …
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 …
Model checking of continuous-time Markov chains against timed automata specifications
We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear
real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller …
real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller …
Quantitative model checking of continuous-time Markov chains against timed automata specifications
We study the following problem: given a continuous-time Markov chain (CTMC) C, and a
linear real-time property provided as a deterministic timed automaton (DTA) A, what is the …
linear real-time property provided as a deterministic timed automaton (DTA) A, what is the …
Efficient CTMC model checking of linear real-time objectives
This paper makes verifying continuous-time Markov chains (CTMCs) against deterministic
timed automata (DTA) objectives practical. We show that verifying 1-clock DTA can be done …
timed automata (DTA) objectives practical. We show that verifying 1-clock DTA can be done …
Defining fairness in reactive and concurrent systems
H Völzer, D Varacca - Journal of the ACM (JACM), 2012 - dl.acm.org
We define when a linear-time temporal property is a fairness property with respect to a given
system. This captures the essence shared by most fairness assumptions that are used in the …
system. This captures the essence shared by most fairness assumptions that are used in the …
Quantitative model-checking of one-clock timed automata under probabilistic semantics
In a probabilistic semantics for timed automata has been defined in order to rule out unlikely
(sequences of) events. The qualitative model-checking problem for LTL properties has been …
(sequences of) events. The qualitative model-checking problem for LTL properties has been …
Robust Analysis of Timed Automata Via Channel Machines
Whereas formal verification of timed systems has become a very active field of research, the
idealised mathematical semantics of timed automata cannot be faithfully implemented …
idealised mathematical semantics of timed automata cannot be faithfully implemented …
[PDF][PDF] Robustness in real-time systems.
N Markey - SIES, 2011 - people.irisa.fr
Robustness in Real-time Systems Page 1 Robustness in Real-time Systems Nicolas Markey
LSV – CNRS & ENS Cachan, France nicolas.markey@lsv.ens-cachan.fr Abstract We review …
LSV – CNRS & ENS Cachan, France nicolas.markey@lsv.ens-cachan.fr Abstract We review …
Transient analysis of networks of stochastic timed automata using stochastic state classes
Abstract Stochastic Timed Automata (STA) associate logical locations with continuous,
generally distributed sojourn times. In this paper, we introduce Networks of Stochastic Timed …
generally distributed sojourn times. In this paper, we introduce Networks of Stochastic Timed …