Please use this identifier to cite or link to this item:
Title: A compositional algorithm for parallel model checking of polygonal hybrid systems
Authors: Pace, Gordon J.
Schneider, Gerardo
Keywords: Computational complexity
Parallel programs (Computer programs) -- Verification
Machine design -- Congresses
Issue Date: 2006
Publisher: Springer-Verlag Berlin Heidelberg
Citation: Pace, G., & Schneider, G. (2006, November). A compositional algorithm for parallel model checking of polygonal hybrid systems. Third International Colloquium on Theoretical Aspects of Computing - ICTAC 2006, Tunis. 168-182.
Abstract: The reachability problem as well as the computation of the phase portrait for the class of planar hybrid systems defined by constant differential inclusions (SPDI), has been shown to be decidable. The existing reachability algorithm is based on the exploitation of topological properties of the plane which are used to accelerate certain kind of cycles. The complexity of the algorithm makes the analysis of large systems generally unfeasible. In this paper we present a compositional parallel algorithm for reachability analysis of SPDIs. The parallelization is based on the qualitative information obtained from the phase portrait of an SPDI, in particular the controllability kernel.
ISBN: 3540488154
ISSN: 03029743
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
A_Compositional_Algorithm_for_Parallel_Model_Check.pdf491.75 kBAdobe PDFView/Open

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.