Sciweavers

182 search results - page 9 / 37
» A general probabilistic framework for worst case timing anal...
Sort
View
TACAS
2009
Springer
167views Algorithms» more  TACAS 2009»
14 years 2 months ago
ITPN-PerfBound: A Performance Bound Tool for Interval Time Petri Nets
The ITPN-PerfBound is a tool for the modeling and analysis of Interval Time Petri Nets (ITPN), that is Petri Nets in which firing time intervals, and possibly firing frequency in...
Elina Pacini Naumovich, Simona Bernardi, Marco Gri...
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 9 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
TSE
2010
120views more  TSE 2010»
13 years 5 months ago
Time and Probability-Based Information Flow Analysis
Abstract—In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial stud...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
13 years 7 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 7 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat