Sciweavers

CADE
2012
Springer
11 years 10 months ago
Taming Past LTL and Flat Counter Systems
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
Stéphane Demri, Amit Kumar Dhar, Arnaud San...
TSE
2002
94views more  TSE 2002»
13 years 7 months ago
Improving the Precision of INCA by Eliminating Solutions with Spurious Cycles
The Inequality Necessary Condition Analyzer (INCA) is a finite-state verification tool that has been able to check properties of some very large concurrent systems. INCA checks a p...
Stephen F. Siegel, George S. Avrunin
JSC
1998
77views more  JSC 1998»
13 years 7 months ago
Explicit Bounds for the Solutions of Elliptic Equations with Rational Coefficients
Abstract. In this paper we give new, improved explicit upper bounds for the absolute values of the integer solutions and for the heights of S-integer solutions of elliptic equation...
Lajos Hajdu, T. Herendi
GLOBECOM
2008
IEEE
14 years 2 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...