Sciweavers

1463 search results - page 111 / 293
» Model Checking Implicit-Invocation Systems
Sort
View
ICALP
2003
Springer
15 years 6 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich
JUCS
2007
108views more  JUCS 2007»
15 years 1 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
CONCUR
2009
Springer
15 years 8 months ago
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
Sergio Giro, Pedro R. D'Argenio, Luis María...
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 11 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
APSEC
2005
IEEE
15 years 7 months ago
Consistency and Interoperability Checking for Component Interaction Rules
In component-based software development, it is important to ensure interoperability between components based on their unambiguous semantic descriptions, in order to obtain a viabl...
Yan Jin, Jun Han