72 search results - page 6 / 15 » Markov Chain Modelling of the Probabilistic Packet Marking A... |
123
Voted
FORMATS
2006
Springer
15 years 6 months ago
2006
Springer
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
106
click to vote
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
193
Voted
CLIMA
2011
14 years 2 months ago
2011
Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of effi...
141
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
138
Voted
ICGI
2004
Springer
15 years 8 months ago
2004
Springer
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...