321 search results - page 13 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
RTSS
1993
IEEE
14 years 26 days ago
1993
IEEE
FOSSACS
2003
Springer
14 years 2 months ago
2003
Springer
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
QEST
2008
IEEE
14 years 3 months ago
2008
IEEE
FOSSACS
2011
Springer
13 years 7 days ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
TACAS
2010
Springer
14 years 3 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...