57 search results - page 7 / 12 » Improvements in BDD-Based Reachability Analysis of Timed Aut... |
JFP
2008
13 years 7 months ago
2008
t two complementary improvements for abstract-interpretation-based flow analysis r-order languages: (1) abstract garbage collection and (2) abstract counting.1,2 garbage collecti...
PSTV
1992
13 years 9 months ago
1992
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
TCS
2002
13 years 7 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
ENTCS
2002
13 years 7 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...