SAS
2000
Springer
13 years 8 months ago
2000
Springer
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that all...
APN
2000
Springer
13 years 8 months ago
2000
Springer
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
HYBRID
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. In this paper we discuss the problem of calculating the reachable states of a dynamical system de ned by ordinary di erential equations or inclusions. We present a protot...
WDAG
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
ICFEM
2004
Springer
13 years 10 months ago
2004
Springer
We present a novel approach for verifying safety properties of finite state machines communicating over unbounded FIFO channels that is based on applying machine learning techniqu...