Sciweavers

138 search results - page 6 / 28
» Model Checking Round-Based Distributed Algorithms
Sort
View
SPIN
2004
Springer
15 years 2 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
FAC
2008
117views more  FAC 2008»
14 years 9 months ago
Model checking Duration Calculus: a practical approach
Abstract. Model checking of real-time systems against Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. The existing algo...
Roland Meyer, Johannes Faber, Jochen Hoenicke, And...
KBSE
2003
IEEE
15 years 2 months ago
Parallel Breadth-First Search LTL Model-Checking
We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detect...
Jiri Barnat, Lubos Brim, Jakub Chaloupka
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 3 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
FORMATS
2007
Springer
15 years 3 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio