![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
1st PASM 2004: London, UK
- Jeremy T. Bradley, William J. Knottenbelt:
Proceedings of the First International Workshop on Practical Applications of Stochastic Modelling, PASM 2004, London, UK, September 4, 2004. Electronic Notes in Theoretical Computer Science 128(4), Elsevier 2005 - Jeremy T. Bradley, William J. Knottenbelt:
Preface. 1-2 - Nil Geisweiller, Jeremie Bonte:
Performance Evaluation of a Real-time Simulation Architecture using Probabilistic Model Checking. 3-24 - Gábor Horváth
, Miklós Telek:
Analysis of a BMAP/D/1-Timer Multiplexer. 25-44 - Nigel Thomas:
Performability of a Secure Electronic Voting Algorithm. 45-58 - Carlo Bellettini
, Lorenzo Capra
, Mattia Monga
:
Quantitative Assessment of a Peer-to-peer Cooperative Infrastructure Using Stochastic Well-Formed Nets. 59-77 - Rossano Gaeta
, Marco Gribaudo, Daniele Manini
, Matteo Sereno:
Fluid Stochastic Petri Nets for Computing Transfer Time Distributions in Peer-to-Peer File Sharing Applications. 79-99 - Lucas Baldo, Leonardo Brenner, Luiz Gustavo Fernandes
, Paulo Fernandes
, Afonso Sales:
Performance Models For Master/Slave Parallel Programs. 101-121 - Mikael Buchholtz, Stephen T. Gilmore, Jane Hillston, Flemming Nielson:
Securing Statically-verified Communications Protocols Against Timing Attacks. 123-143 - Peter G. Harrison
, Soraya Zertal:
Calibration of a Queueing Model of RAID Systems. 145-164
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.