University of Illinois Urbana-Champaign

A Decidable Class of Planar Linear Hybrid Systems

Prabhakar, Pavithra; Vladimerou, Vladimeros; Viswanathan, Mahesh; Dullerud, Geir E.

Content Files
A Decidable Class of Planar Linear Hybrid Systems.pdf

Permalink

https://hdl.handle.net/2142/11419

Description

Title
A Decidable Class of Planar Linear Hybrid Systems
Author(s)
  • Prabhakar, Pavithra
  • Vladimerou, Vladimeros
  • Viswanathan, Mahesh
  • Dullerud, Geir E.
Issue Date
2008-01
Keyword(s)
computer science
Date of Ingest
2009-04-22T20:49:20Z
Abstract
The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid automata without resets. These automata are a special class of linear hybrid automata with only two variables, whose flows in all states is monotonic along some direction in the plane, and in which the continuous variables are not reset on a discrete transition. We also prove the undecidability for the same class of automata in 4-dimensions.
Type of Resource
text
Genre of Resource
Technical Report
Permalink
http://hdl.handle.net/2142/11419
Copyright and License Information
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections

Research and Tech Reports - Computer Science PRIMARY