73 search results - page 1 / 15 » Reachability and Timing Analysis in Data Flow Networks: A Ca... |
EUROMICRO
1996
IEEE
13 years 9 months ago
1996
IEEE
FM
2001
Springer
13 years 9 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
PDC
2004
ACM
13 years 10 months ago
2004
ACM
Most experiments with participative design are with small scale, stand alone and not very strategic applications of ICT in organizations. However, modern ICT applications are incr...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
CCR
2010
13 years 4 months ago
2010
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...