438 search results - page 4 / 88 » Efficient Timing Analysis Algorithms for Timed State Space E... |
ENTCS
2006
13 years 7 months ago
2006
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
FM
2001
Springer
14 years 4 days 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...
SFM
2007
Springer
14 years 1 months ago
2007
Springer
Stochastic performance models provide a powerful way of capturing and analysing the behaviour of complex concurrent systems. Traditionally, performance measures for these models ar...
PTS
2008
13 years 9 months ago
2008
The state space explosion due to concurrency and timing constraints of concurrent real-time systems (CRTS) presents significant challenges to the verification engineers. In this pa...
NIPS
2003
13 years 9 months ago
2003
In applying Hidden Markov Models to the analysis of massive data streams, it is often necessary to use an artificially reduced set of states; this is due in large part to the fac...