Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Applied software architecture
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
Research in Model-Checking is focused on increasing the size of the problems tools can deal with. The ultimate wave has been the use of Distributed-Computing, where a cluster of computers work together to solve the problem [8, 3, 9].In our work we present a distributed model-checker that evolves from the tool Kronos [5] and can handle backwards computation of TCTL-reachability formulae [1] over timed-automata [2]. Our proposal, including the arguments of its correctness, is based on software architectures, using a notation adapted from [6]. We find such an approach a natural and general way to address the development of complex tools that need to incorporate new features and optimizations as they evolve.We introduce some interesting features such as a priori graph partitioning (using METIS [7], a standard library for graph partitioning), a sophisticated machinery to reach optimum performance (communication piggybacking and delayed messaging) and dead-time utilization, where every processor uses time intervals of inactivity to perform auxiliary, time-consuming tasks that will later speed up the rest of the computation.The correctness proof strategy combines an architecture evolution with the theoretical results about fix point calculation developed by Patrick Cousot in 1978 [4].