Reachability problems for hierarchical piecewise constant derivative systems

In this paper, we investigate the computability and complexity of reachability problems for two-dimensional hierarchical piecewise constant derivative (HPCD) systems. The main interest in HPCDs stems from the fact that their reachability problem is on the border between decidability and undecidabili...

Full description

Saved in:
Bibliographic Details
Main Authors: Paul Bell, Shang Chen
Format: Default Conference proceeding
Published: 2013
Subjects:
Other information and computing sciences not elsewhere classified
untagged
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/13390
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/13390

Similar Items