Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Damm, Werner
Ihlemann, Carsten
Sofronie-Stokkermans, Viorica

dblp
dblp
dblp

Not MPG Author(s):

Damm, Werner

Editor(s):

Frazzoli, Emilio
Grosu, Radu

dblp
dblp

Not MPII Editor(s):

Frazzoli, Emilio
Grosu, Radu

BibTeX cite key*:

Damm-Ihlemann-Sofronie-Stokkermans2011

Title, Booktitle

Title*:

Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata

Booktitle*:

HSCC'11 : Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control

Event, URLs

URL of the conference:

http://hscc2011.cs.sunysb.edu/

URL for downloading the paper:

http://doi.acm.org/10.1145/1967701.1967714

Event Address*:

Chicago, Ill.

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

12 April 2011

Event End Date:

14 April 2011

Publisher

Name*:

ACM

URL:

http://www.springer-ny.com/

Address*:

New York, NY

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

73-82

Year*:

2011

VG Wort Pages:


ISBN/ISSN:

978-1-4503-0629-4

Sequence Number:


DOI:

10.1145/1967701.1967714



Note, Abstract, ©


(LaTeX) Abstract:

We study linear hybrid automata with dynamics of the form
$\sum a_i x_i \leq a$ and $\sum b_i {\dot x_i} \leq b$.
We show that verification of safety properties for reasonable
classes of such systems can be reduced to invariant checking
and bounded model checking and, ultimately, to checking the
validity of certain formulae (obtained using a polynomial
reduction).
We show that the problem of checking the validity of the formulae
obtained this way is typically in NP, and identify verification
tasks which can be performed in PTIME.
These reductions can also be used for parametric systems, both
for checking safety properties given constraints on parameters,
and for deriving constraints of parameters that guarantee that
safety properties hold.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Automation of Logic

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Damm-Ihlemann-Sofronie-Stokkermans2011,
AUTHOR = {Damm, Werner and Ihlemann, Carsten and Sofronie-Stokkermans, Viorica},
EDITOR = {Frazzoli, Emilio and Grosu, Radu},
TITLE = {Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata},
BOOKTITLE = {HSCC'11 : Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control},
PUBLISHER = {ACM},
YEAR = {2011},
PAGES = {73--82},
ADDRESS = {Chicago, Ill.},
ISBN = {978-1-4503-0629-4},
DOI = {10.1145/1967701.1967714},
}


Entry last modified by Uwe Brahm, 03/01/2013
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
12/20/2010 05:04:43 PM
Revisions
3.
2.
1.
0.
Editor(s)
Uwe Brahm
Anja Becker
Manuel Lamotte-Schubert
Viorica Sofronie-Stokkermans
Edit Dates
03/01/2013 10:43:35 AM
16.03.2012 13:09:31
25.01.2012 14:43:39
12/20/2010 05:04:43 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section