Deciding Reachability for 3-Dimensional Multi-Linear Systems

Details Deciding Reachability for 3-Dimensional Multi-Linear Systems Deciding Reachability for 3-Dimensional Multi-Linear Systems

2011-06-07

arxiv.org/abs/1106.1245v1

EPTCS 54, 2011, pp. 250-262

Computer Science

Logic in Computer Science

In Proceedings GandALF 2011, arXiv:1106.0814

Scientific paper

10.4204/EPTCS.54.18

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.

Affiliated with

Also associated with

No associations

Rating

Deciding Reachability for 3-Dimensional Multi-Linear Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deciding Reachability for 3-Dimensional Multi-Linear Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deciding Reachability for 3-Dimensional Multi-Linear Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26183