Computation and visualisation of phase portraits for model checking SPDIs

Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/24035

Title:	Computation and visualisation of phase portraits for model checking SPDIs
Other Titles:	Tools and algorithms for the construction and analysis of systems
Authors:	Pace, Gordon J. Schneider, Gerardo
Keywords:	Computational complexity Parallel programs (Computer programs) -- Verification Machine design -- Congresses
Issue Date:	2008
Publisher:	Springer, Berlin, Heidelberg
Citation:	Pace, G., & Schneider, G. (2008). Computation and visualisation of phase portraits for model checking SPDIs. In Ramakrishnan C.R., Rehof J. (Eds.), Tools and algorithms for the construction and analysis of systems (pp. 341-345). Berlin, Heidelberg: Springer.
Abstract:	Hybrid systems combining discrete and continuous dynamics arise as mathematical models of various artificial and natural systems, and as an approximation to complex continuous systems. Reachability analysis has been the principal research question in the verification of hybrid systems, even though it is a wellknown result that most non-trivial subclasses of hybrid systems reachability and most verification problems are undecidable [1]. Nonetheless, various decidable subclasses have been identified, including polygonal hybrid systems (SPDIs) [2]. SPDIs can be used, for instance, in the analysis of approximations of non-linear differential equations in two-dimensions.
URI:	https://www.um.edu.mt/library/oar//handle/123456789/24035
Appears in Collections:	Scholarly Works - FacICTCS

Files in This Item:

File	Description	Size	Format
Computation_and_Visualisation_of_Phase_Portraits_f.pdf		150.42 kB	Adobe PDF	View/Open