Sciweavers

689 search results - page 43 / 138
» A Modal-Logic Based Graph Abstraction
Sort
View
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
14 years 10 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
14 years 2 months ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...
FORMATS
2008
Springer
13 years 11 months ago
Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
Louis-Marie Traonouez, Didier Lime, Olivier H. Rou...
IDA
2009
Springer
14 years 4 months ago
Selecting Computer Architectures by Means of Control-Flow-Graph Mining
Abstract Deciding which computer architecture provides the best performance for a certain program is an important problem in hardware design and benchmarking. While previous approa...
Frank Eichinger, Klemens Böhm
PPAM
2005
Springer
14 years 3 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale