321 search results - page 12 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
FORMATS
2004
Springer
14 years 2 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
FORMATS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
CONCUR
1999
Springer
14 years 1 months ago
1999
Springer
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
RTSS
1995
IEEE
14 years 9 days ago
1995
IEEE
E cient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. Howe...
CAV
2006
Springer
14 years 15 days ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...