dc.contributor.author | Tveretina, Olga | |
dc.date.accessioned | 2013-01-15T17:28:57Z | |
dc.date.available | 2013-01-15T17:28:57Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | Tveretina , O 2011 , Deciding Reachability for 3-Dimensional Multi-Linear Systems . in Procs of 2nd Int Symposium on Games, Automata, Logics and Formal Verification : GandALF 2011 . vol. 54 , Electronic Proceedings in Theoretical Computer Science , pp. 250-262 . https://doi.org/10.4204/EPTCS.54.18 | |
dc.identifier.uri | http://hdl.handle.net/2299/9665 | |
dc.description.abstract | This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the partition, which governs the dynamical behavior of the system within it. The reachability problem for multi-linear systems has been proven to be decidable for the two-dimensional case and undecidable for the dimension three and higher. Multi-linear systems however exhibit certain properties that make them very suitable for topological analysis. We prove that reachability can be decided exactly in the 3-dimensional case when systems satisfy certain conditions. We show with experiments that our approach can be orders of magnitude more efficient than simulation | en |
dc.format.extent | 160564 | |
dc.language.iso | eng | |
dc.publisher | Electronic Proceedings in Theoretical Computer Science | |
dc.relation.ispartof | Procs of 2nd Int Symposium on Games, Automata, Logics and Formal Verification | |
dc.subject | Hybrid systems, the reachability problem, decidability | |
dc.title | Deciding Reachability for 3-Dimensional Multi-Linear Systems | en |
dc.contributor.institution | School of Physics, Engineering & Computer Science | |
dc.contributor.institution | Biocomputation Research Group | |
rioxxterms.versionofrecord | 10.4204/EPTCS.54.18 | |
rioxxterms.type | Other | |
herts.preservation.rarelyaccessed | true | |