Article ID Journal Published Year Pages File Type
10328878 Electronic Notes in Theoretical Computer Science 2005 16 Pages PDF
Abstract
After reviewing why it is so hard to have good speedups in distributed timed model checking, we present the methods used to get promising results when verifying reachability properties over timed automata [Alur, R. and D. L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235].
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On-the-fly Workload Prediction and Redistribution in the Distributed Timed Model Checker Zeus
Authors
, , ,