SIGLEAvailable from British Library Document Supply Centre-DSC:8092.7029(CSR-00-6) / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Probabilistic timed automata are an extension of timed automata with discreteprobability distributio...
none1noThe usefulness of formal methods for the description and verification of complex systems is n...
AbstractWe propose a model of probabilistic timed automaton which substitutes for the non-determinis...
Training Centre of the United Nations University (UNU). It is based in Macau, and was founded i
We consider the problem of automatically verifying real-time systems with continuously distributed r...
Probabilistic (or quantitative) verification is a branch of formal methods dealing with stochastic m...
SIGLEAvailable from British Library Document Supply Centre-DSC:7623.6171(4/00) / BLDSC - British Lib...
International audienceIn [BBBBG-lics08] a probabilistic semantics for timed automata has been define...
Probabilistic timed automata are timed automata extended with discrete probabil-ity distributions, a...
AbstractProbabilistic timed automata are timed automata extended with discrete probability distribut...
Probabilistic timed automata are timed automata extended with discrete probability distributions, an...
SIGLEAvailable from British Library Document Supply Centre- DSC:7624.255(YU-YCS--175) / BLDSC - Brit...
We study the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-tim...
We study the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-tim...
The following full text is a publisher's version. For additional information about this publica...
Probabilistic timed automata are an extension of timed automata with discreteprobability distributio...
none1noThe usefulness of formal methods for the description and verification of complex systems is n...
AbstractWe propose a model of probabilistic timed automaton which substitutes for the non-determinis...
Training Centre of the United Nations University (UNU). It is based in Macau, and was founded i
We consider the problem of automatically verifying real-time systems with continuously distributed r...
Probabilistic (or quantitative) verification is a branch of formal methods dealing with stochastic m...
SIGLEAvailable from British Library Document Supply Centre-DSC:7623.6171(4/00) / BLDSC - British Lib...
International audienceIn [BBBBG-lics08] a probabilistic semantics for timed automata has been define...
Probabilistic timed automata are timed automata extended with discrete probabil-ity distributions, a...
AbstractProbabilistic timed automata are timed automata extended with discrete probability distribut...
Probabilistic timed automata are timed automata extended with discrete probability distributions, an...
SIGLEAvailable from British Library Document Supply Centre- DSC:7624.255(YU-YCS--175) / BLDSC - Brit...
We study the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-tim...
We study the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-tim...
The following full text is a publisher's version. For additional information about this publica...
Probabilistic timed automata are an extension of timed automata with discreteprobability distributio...
none1noThe usefulness of formal methods for the description and verification of complex systems is n...
AbstractWe propose a model of probabilistic timed automaton which substitutes for the non-determinis...
DOI
Add to ORKG