Sciweavers

94 search results - page 4 / 19
» A Performance Study of BDD-Based Model Checking
Sort
View
FMSD
2006
119views more  FMSD 2006»
13 years 7 months ago
Feature interaction detection by pairwise analysis of LTL properties - A case study
A Promela specification and a set of temporal properties are developed for a basic call service with a number of features. The properties are expressed in the logic LTL. Interactio...
Muffy Calder, Alice Miller
HVC
2007
Springer
108views Hardware» more  HVC 2007»
14 years 1 months ago
How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison
Abstract. This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The s...
David N. Jansen, Joost-Pieter Katoen, Marcel Olden...
FORMATS
2004
Springer
14 years 23 days ago
Symbolic Model Checking for Simply-Timed Systems
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
Nicolas Markey, Ph. Schnoebelen
SPIN
2000
Springer
13 years 11 months ago
Modeling the ASCB-D Synchronization Algorithm with SPIN: A Case Study
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
Nicholas Weininger, Darren D. Cofer
CAV
2005
Springer
129views Hardware» more  CAV 2005»
14 years 27 days ago
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
Roberto Sebastiani, Stefano Tonetta, Moshe Y. Vard...