Issues in distributed timed model checking: Building Zeus

Authors:
Víctor Braberman;Alfredo Olivero;Fernando Schapachnik
Affiliations:
Universidad de Buenos Aires, Computer Science Department, FCEyN, Buenos Aires, Argentina;Universidad Argentina de la Empresa, Department of Information Technology, FIyCE, Buenos Aires, Argentina;Universidad de Buenos Aires, Computer Science Department, FCEyN, Buenos Aires, Argentina
Venue:
International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Year:
2005

Citing 0
Cited 5

A toolsuite for the verification of real-time systems in Eclipse

eclipse '06 Proceedings of the 2006 OOPSLA workshop on eclipse technology eXchange
Efficient online monitoring of web-service SLAs

Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Distributed Symbolic Bounded Property Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Hypervolume approximation in timed automata model checking

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Achieving speedups in distributed symbolic reachability analysis through asynchronous computation

CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we present Zeus, a distributed timed model checker that evolves from the TCTL model checker Kronos [13] and that currently can handle backwards computation of reachability properties [2] over timed automata [3].Zeus was developed following a software architecture-centric approach. Its conceptual architecture was conceived to be sufficiently modular to house several features such as a priori graph partitioning, synchronous and asynchronous computation, communication piggybacking, delayed messaging, and dead-time utilization.Surprisingly enough, early experiments pinpointed the difficulties of getting speedups using asynchronous versions and showed interesting results on the synchronous counterpart, although being intuitively less attractive.