A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems
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.
KeywordsPhase Portrait Multivalued Function Feasible Path Hybrid Automaton Reachability Analysis
Unable to display preview. Download preview PDF.
- [FvDFH96]Foley, J.D., van Dam, A., Feiner, S.K., Hughes, J.F.: Computer graphics (2nd ed. in C): principles and practice. Addison-Wesley Longman Publishing Co., Inc., Boston (1996)Google Scholar
- [MP93]Maler, O., Pnueli, A.: Reachability analysis of planar multi-linear systems. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 194–209. Springer, Heidelberg (1993)Google Scholar
- [PS06]Pace, G., Schneider, G.: Static analysis of SPDIs for state-space reduction. Technical Report 336, Department of Informatics, University of Oslo, PO Box 1080 Blindern, N-0316 Oslo, Norway (April 2006)Google Scholar