662 search results - page 31 / 133 » Model Checking Procedures for Infinite State Systems |
CADE
2008
Springer
15 years 9 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
ORL
2010
14 years 4 months ago
2010
Rationing is an inventory policy that allows prioritization of demand classes. It enables the inventory system to provide higher service levels for critical demand classes. In thi...
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms....
IJCAI
2003
14 years 11 months ago
2003
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...
102
Voted
FMCO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Formal methods, in particular model checking, are increasingly accepted as integral part of system development. With large software systems beyond the range of fully auto...