138 search results - page 8 / 28 » Model Checking Round-Based Distributed Algorithms |
ISORC
2005
IEEE
15 years 3 months ago
2005
IEEE
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...
CONCUR
2003
Springer
15 years 2 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
68
Voted
FORMATS
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
101
click to vote
FORMATS
2004
Springer
15 years 2 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
We develop a sound foundation for model checking algorithms for the class of PRS-style BDI agents, by showing how a reachability graph for any given PRS-type agent can be construc...