Sciweavers

395 search results - page 42 / 79
» Polynomial Approximations for Model Checking
Sort
View
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 7 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...
VMCAI
2009
Springer
15 years 4 months ago
Extending Symmetry Reduction by Exploiting System Architecture
Abstract. Symmetry reduction is a technique to alleviate state explosion in model checking by replacing a model of replicated processes with a bisimilar quotient model. The size of...
Richard J. Trefler, Thomas Wahl
WINE
2009
Springer
147views Economy» more  WINE 2009»
15 years 2 months ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta
ICALP
2010
Springer
14 years 12 months ago
Example-Guided Abstraction Simplification
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
Roberto Giacobazzi, Francesco Ranzato
MFCS
2009
Springer
15 years 4 months ago
Balanced Paths in Colored Graphs
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...