Sciweavers

117 search results - page 4 / 24
» Avoiding State Explosion for Distributed Systems with Timest...
Sort
View
APN
2008
Springer
14 years 11 months ago
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
Kais Klai, Denis Poitrenaud
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
14 years 11 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
EEF
2000
15 years 1 months ago
Distributed and Structured Analysis Approaches to Study Large and Complex Systems
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...
Gianfranco Ciardo
FSTTCS
1998
Springer
15 years 1 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
MMB
2010
Springer
185views Communications» more  MMB 2010»
14 years 11 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker