Please use this identifier to cite or link to this item:
Title: A new breadth-first search algorithm for deciding SPDI reachability
Authors: Pace, Gordon J.
Keywords: Machine design -- Congresses
Hybrid systems
Issue Date: 2003
Publisher: University of Malta. Department of Computer Science
Citation: Pace, G. J. (2003). A new breadth-first search algorithm for deciding SPDI reachabilit. (No.CSAI2003-01). Msida.
Abstract: Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions (SPDIs). Using an important object of SPDIs’ phase portrait, the invariance kernels, which can be computed non-iteratively, we present a breadth-first search algorithm for solving the reachability problem for SPDIs. Invariance kernels play an important role in the termination of the algorithm.
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
A_new_breadth_first_search_algorithm_for_deciding_.pdf241.29 kBAdobe PDFView/Open

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