Sciweavers

452 search results - page 60 / 91
» Diagnosability Analysis of Distributed Discrete Event System...
Sort
View
SPAA
2010
ACM
14 years 1 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
PODC
2010
ACM
14 years 23 days ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
ICRA
2003
IEEE
111views Robotics» more  ICRA 2003»
14 years 2 months ago
Fuzzy Petri nets for monitoring and recovery
- In this paper, we propose a unitary tool for modeling and analysis of discrete event systems monitoring. Uncertain knowledge of such tasks asks specific reasoning and adapted fuz...
Daniel I. Racoceanu, Eugenia Minca, Noureddine Zer...
ISORC
2008
IEEE
14 years 3 months ago
Usability Aspects of WCET Analysis
Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. A critical timing measure is the worst-case execution time (...
Jan Gustafsson