7 search results - page 1 / 2 » Verification by approximate forward and backward reachabilit... |
ICCAD
1998
IEEE
13 years 9 months ago
1998
IEEE
FORMATS
2009
Springer
13 years 8 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
FORTE
2009
13 years 2 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
CAV
2007
Springer
13 years 8 months ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
FMSD
2006
13 years 4 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...